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_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_minInArray_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:55:22,432 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:55:22,435 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:55:22,452 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:55:22,453 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:55:22,454 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:55:22,457 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:55:22,459 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:55:22,461 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:55:22,462 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:55:22,464 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:55:22,464 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:55:22,465 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:55:22,467 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:55:22,470 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:55:22,476 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:55:22,477 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:55:22,482 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:55:22,487 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:55:22,490 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:55:22,492 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:55:22,494 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:55:22,498 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:55:22,498 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:55:22,498 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:55:22,499 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:55:22,501 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:55:22,502 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:55:22,503 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:55:22,504 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:55:22,504 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:55:22,505 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:55:22,505 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:55:22,505 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:55:22,506 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:55:22,507 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:55:22,507 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 11:55:22,522 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:55:22,523 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:55:22,524 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:55:22,524 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:55:22,524 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:55:22,525 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:55:22,525 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:55:22,525 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:55:22,525 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:55:22,525 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:55:22,526 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:55:22,526 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:55:22,526 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:55:22,526 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:55:22,526 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:55:22,527 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:55:22,527 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:55:22,527 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:55:22,527 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:55:22,528 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:55:22,528 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:55:22,528 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:55:22,528 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:55:22,528 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:55:22,529 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:55:22,529 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:55:22,529 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:55:22,529 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:55:22,529 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:55:22,530 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:55:22,530 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:55:22,576 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:55:22,589 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:55:22,598 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:55:22,601 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:55:22,601 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:55:22,603 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_minInArray_false-unreach-call_ground.i [2018-11-23 11:55:22,670 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/998182d56/f76118fd45a640c4a96a632d9ffac682/FLAG5fa37ea7b [2018-11-23 11:55:23,107 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:55:23,108 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_minInArray_false-unreach-call_ground.i [2018-11-23 11:55:23,115 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/998182d56/f76118fd45a640c4a96a632d9ffac682/FLAG5fa37ea7b [2018-11-23 11:55:23,448 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/998182d56/f76118fd45a640c4a96a632d9ffac682 [2018-11-23 11:55:23,458 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:55:23,459 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:55:23,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:55:23,465 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:55:23,469 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:55:23,471 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:55:23" (1/1) ... [2018-11-23 11:55:23,474 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 11:55:23, skipping insertion in model container [2018-11-23 11:55:23,475 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:55:23" (1/1) ... [2018-11-23 11:55:23,486 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:55:23,513 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:55:23,745 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:55:23,751 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:55:23,779 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:55:23,812 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:55:23,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:23 WrapperNode [2018-11-23 11:55:23,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:55:23,814 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:55:23,814 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:55:23,814 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:55:23,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:23" (1/1) ... [2018-11-23 11:55:23,838 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:23" (1/1) ... [2018-11-23 11:55:23,847 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:55:23,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:55:23,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:55:23,848 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:55:23,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:23" (1/1) ... [2018-11-23 11:55:23,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:23" (1/1) ... [2018-11-23 11:55:23,862 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:23" (1/1) ... [2018-11-23 11:55:23,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:23" (1/1) ... [2018-11-23 11:55:23,872 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:23" (1/1) ... [2018-11-23 11:55:23,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:23" (1/1) ... [2018-11-23 11:55:23,881 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:23" (1/1) ... [2018-11-23 11:55:23,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:55:23,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:55:23,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:55:23,884 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:55:23,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:23" (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 11:55:24,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:55:24,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:55:24,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:55:24,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:55:24,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:55:24,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:55:24,013 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:55:24,013 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:55:24,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:55:24,014 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:55:24,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:55:24,518 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:55:24,519 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 11:55:24,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:55:24 BoogieIcfgContainer [2018-11-23 11:55:24,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:55:24,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:55:24,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:55:24,524 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:55:24,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:55:23" (1/3) ... [2018-11-23 11:55:24,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c7c3c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:55:24, skipping insertion in model container [2018-11-23 11:55:24,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:23" (2/3) ... [2018-11-23 11:55:24,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c7c3c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:55:24, skipping insertion in model container [2018-11-23 11:55:24,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:55:24" (3/3) ... [2018-11-23 11:55:24,528 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_minInArray_false-unreach-call_ground.i [2018-11-23 11:55:24,537 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:55:24,544 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:55:24,563 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:55:24,598 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:55:24,599 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:55:24,599 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:55:24,599 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:55:24,601 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:55:24,601 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:55:24,601 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:55:24,602 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:55:24,602 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:55:24,621 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 11:55:24,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:55:24,628 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:24,629 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:24,632 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:24,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:24,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1513105276, now seen corresponding path program 1 times [2018-11-23 11:55:24,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:24,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:24,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:24,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:24,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:24,781 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-23 11:55:24,785 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28#true} is VALID [2018-11-23 11:55:24,786 INFO L273 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-23 11:55:24,786 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #55#return; {28#true} is VALID [2018-11-23 11:55:24,787 INFO L256 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret4 := main(); {28#true} is VALID [2018-11-23 11:55:24,787 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {28#true} is VALID [2018-11-23 11:55:24,790 INFO L273 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2018-11-23 11:55:24,790 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#false} havoc ~x~0;~x~0 := 0; {29#false} is VALID [2018-11-23 11:55:24,791 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {29#false} is VALID [2018-11-23 11:55:24,791 INFO L256 TraceCheckUtils]: 9: Hoare triple {29#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {29#false} is VALID [2018-11-23 11:55:24,791 INFO L273 TraceCheckUtils]: 10: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2018-11-23 11:55:24,792 INFO L273 TraceCheckUtils]: 11: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2018-11-23 11:55:24,792 INFO L273 TraceCheckUtils]: 12: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-23 11:55:24,795 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 11:55:24,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:55:24,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:55:24,804 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 11:55:24,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:24,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:55:24,866 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 11:55:24,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:55:24,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:55:24,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:55:24,878 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-23 11:55:25,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:25,054 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2018-11-23 11:55:25,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:55:25,054 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 11:55:25,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:25,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:55:25,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2018-11-23 11:55:25,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:55:25,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2018-11-23 11:55:25,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 49 transitions. [2018-11-23 11:55:25,380 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 11:55:25,390 INFO L225 Difference]: With dead ends: 41 [2018-11-23 11:55:25,390 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 11:55:25,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 11:55:25,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 11:55:25,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 11:55:25,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:25,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 11:55:25,434 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 11:55:25,434 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 11:55:25,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:25,438 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 11:55:25,438 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 11:55:25,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:25,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:25,439 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 11:55:25,439 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 11:55:25,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:25,442 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 11:55:25,443 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 11:55:25,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:25,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:25,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:25,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:25,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:55:25,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-23 11:55:25,448 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 13 [2018-11-23 11:55:25,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:25,448 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 11:55:25,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:55:25,449 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 11:55:25,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:55:25,449 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:25,450 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:25,450 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:25,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:25,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1609256121, now seen corresponding path program 1 times [2018-11-23 11:55:25,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:25,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:25,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:25,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:25,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:25,532 INFO L256 TraceCheckUtils]: 0: Hoare triple {152#true} call ULTIMATE.init(); {152#true} is VALID [2018-11-23 11:55:25,532 INFO L273 TraceCheckUtils]: 1: Hoare triple {152#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {152#true} is VALID [2018-11-23 11:55:25,533 INFO L273 TraceCheckUtils]: 2: Hoare triple {152#true} assume true; {152#true} is VALID [2018-11-23 11:55:25,533 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {152#true} {152#true} #55#return; {152#true} is VALID [2018-11-23 11:55:25,533 INFO L256 TraceCheckUtils]: 4: Hoare triple {152#true} call #t~ret4 := main(); {152#true} is VALID [2018-11-23 11:55:25,536 INFO L273 TraceCheckUtils]: 5: Hoare triple {152#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {154#(= main_~i~0 0)} is VALID [2018-11-23 11:55:25,537 INFO L273 TraceCheckUtils]: 6: Hoare triple {154#(= main_~i~0 0)} assume !(~i~0 < 100000); {153#false} is VALID [2018-11-23 11:55:25,537 INFO L273 TraceCheckUtils]: 7: Hoare triple {153#false} havoc ~x~0;~x~0 := 0; {153#false} is VALID [2018-11-23 11:55:25,537 INFO L273 TraceCheckUtils]: 8: Hoare triple {153#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {153#false} is VALID [2018-11-23 11:55:25,538 INFO L256 TraceCheckUtils]: 9: Hoare triple {153#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {153#false} is VALID [2018-11-23 11:55:25,538 INFO L273 TraceCheckUtils]: 10: Hoare triple {153#false} ~cond := #in~cond; {153#false} is VALID [2018-11-23 11:55:25,538 INFO L273 TraceCheckUtils]: 11: Hoare triple {153#false} assume 0 == ~cond; {153#false} is VALID [2018-11-23 11:55:25,539 INFO L273 TraceCheckUtils]: 12: Hoare triple {153#false} assume !false; {153#false} is VALID [2018-11-23 11:55:25,540 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 11:55:25,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:55:25,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:55:25,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 11:55:25,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:25,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:55:25,578 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 11:55:25,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:55:25,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:55:25,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:55:25,580 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 3 states. [2018-11-23 11:55:25,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:25,824 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 11:55:25,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:55:25,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 11:55:25,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:25,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:55:25,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-23 11:55:25,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:55:25,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-23 11:55:25,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2018-11-23 11:55:25,913 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 11:55:25,916 INFO L225 Difference]: With dead ends: 34 [2018-11-23 11:55:25,916 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 11:55:25,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 11:55:25,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 11:55:25,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-11-23 11:55:25,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:25,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 21 states. [2018-11-23 11:55:25,955 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 21 states. [2018-11-23 11:55:25,955 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 21 states. [2018-11-23 11:55:25,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:25,957 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-23 11:55:25,958 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 11:55:25,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:25,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:25,959 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 23 states. [2018-11-23 11:55:25,959 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 23 states. [2018-11-23 11:55:25,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:25,962 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-23 11:55:25,962 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 11:55:25,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:25,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:25,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:25,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:25,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:55:25,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-23 11:55:25,965 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 13 [2018-11-23 11:55:25,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:25,966 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-23 11:55:25,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:55:25,966 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 11:55:25,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:55:25,967 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:25,967 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:25,967 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:25,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:25,968 INFO L82 PathProgramCache]: Analyzing trace with hash -30491421, now seen corresponding path program 1 times [2018-11-23 11:55:25,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:25,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:25,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:25,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:25,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:26,129 INFO L256 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2018-11-23 11:55:26,129 INFO L273 TraceCheckUtils]: 1: Hoare triple {279#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {279#true} is VALID [2018-11-23 11:55:26,130 INFO L273 TraceCheckUtils]: 2: Hoare triple {279#true} assume true; {279#true} is VALID [2018-11-23 11:55:26,130 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {279#true} {279#true} #55#return; {279#true} is VALID [2018-11-23 11:55:26,131 INFO L256 TraceCheckUtils]: 4: Hoare triple {279#true} call #t~ret4 := main(); {279#true} is VALID [2018-11-23 11:55:26,147 INFO L273 TraceCheckUtils]: 5: Hoare triple {279#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {281#(= main_~i~0 0)} is VALID [2018-11-23 11:55:26,162 INFO L273 TraceCheckUtils]: 6: Hoare triple {281#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {281#(= main_~i~0 0)} is VALID [2018-11-23 11:55:26,179 INFO L273 TraceCheckUtils]: 7: Hoare triple {281#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {281#(= main_~i~0 0)} is VALID [2018-11-23 11:55:26,194 INFO L273 TraceCheckUtils]: 8: Hoare triple {281#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {282#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:26,210 INFO L273 TraceCheckUtils]: 9: Hoare triple {282#(<= main_~i~0 1)} assume !(~i~0 < 100000); {280#false} is VALID [2018-11-23 11:55:26,211 INFO L273 TraceCheckUtils]: 10: Hoare triple {280#false} havoc ~x~0;~x~0 := 0; {280#false} is VALID [2018-11-23 11:55:26,211 INFO L273 TraceCheckUtils]: 11: Hoare triple {280#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {280#false} is VALID [2018-11-23 11:55:26,211 INFO L256 TraceCheckUtils]: 12: Hoare triple {280#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {280#false} is VALID [2018-11-23 11:55:26,212 INFO L273 TraceCheckUtils]: 13: Hoare triple {280#false} ~cond := #in~cond; {280#false} is VALID [2018-11-23 11:55:26,212 INFO L273 TraceCheckUtils]: 14: Hoare triple {280#false} assume 0 == ~cond; {280#false} is VALID [2018-11-23 11:55:26,213 INFO L273 TraceCheckUtils]: 15: Hoare triple {280#false} assume !false; {280#false} is VALID [2018-11-23 11:55:26,215 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 11:55:26,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:26,215 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:26,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:26,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:26,561 INFO L256 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2018-11-23 11:55:26,562 INFO L273 TraceCheckUtils]: 1: Hoare triple {279#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {279#true} is VALID [2018-11-23 11:55:26,562 INFO L273 TraceCheckUtils]: 2: Hoare triple {279#true} assume true; {279#true} is VALID [2018-11-23 11:55:26,562 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {279#true} {279#true} #55#return; {279#true} is VALID [2018-11-23 11:55:26,563 INFO L256 TraceCheckUtils]: 4: Hoare triple {279#true} call #t~ret4 := main(); {279#true} is VALID [2018-11-23 11:55:26,565 INFO L273 TraceCheckUtils]: 5: Hoare triple {279#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {301#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:26,565 INFO L273 TraceCheckUtils]: 6: Hoare triple {301#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {301#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:26,567 INFO L273 TraceCheckUtils]: 7: Hoare triple {301#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {301#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:26,567 INFO L273 TraceCheckUtils]: 8: Hoare triple {301#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {282#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:26,572 INFO L273 TraceCheckUtils]: 9: Hoare triple {282#(<= main_~i~0 1)} assume !(~i~0 < 100000); {280#false} is VALID [2018-11-23 11:55:26,573 INFO L273 TraceCheckUtils]: 10: Hoare triple {280#false} havoc ~x~0;~x~0 := 0; {280#false} is VALID [2018-11-23 11:55:26,573 INFO L273 TraceCheckUtils]: 11: Hoare triple {280#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {280#false} is VALID [2018-11-23 11:55:26,573 INFO L256 TraceCheckUtils]: 12: Hoare triple {280#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {280#false} is VALID [2018-11-23 11:55:26,574 INFO L273 TraceCheckUtils]: 13: Hoare triple {280#false} ~cond := #in~cond; {280#false} is VALID [2018-11-23 11:55:26,574 INFO L273 TraceCheckUtils]: 14: Hoare triple {280#false} assume 0 == ~cond; {280#false} is VALID [2018-11-23 11:55:26,574 INFO L273 TraceCheckUtils]: 15: Hoare triple {280#false} assume !false; {280#false} is VALID [2018-11-23 11:55:26,575 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 11:55:26,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:26,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 11:55:26,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 11:55:26,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:26,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:55:26,638 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:26,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:55:26,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:55:26,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:55:26,639 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 5 states. [2018-11-23 11:55:27,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:27,029 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-23 11:55:27,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:55:27,029 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 11:55:27,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:27,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:55:27,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2018-11-23 11:55:27,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:55:27,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2018-11-23 11:55:27,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 42 transitions. [2018-11-23 11:55:27,138 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:27,141 INFO L225 Difference]: With dead ends: 37 [2018-11-23 11:55:27,141 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 11:55:27,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:55:27,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 11:55:27,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-23 11:55:27,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:27,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 24 states. [2018-11-23 11:55:27,157 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 24 states. [2018-11-23 11:55:27,157 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 24 states. [2018-11-23 11:55:27,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:27,160 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 11:55:27,160 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 11:55:27,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:27,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:27,161 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states. [2018-11-23 11:55:27,162 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states. [2018-11-23 11:55:27,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:27,164 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 11:55:27,164 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 11:55:27,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:27,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:27,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:27,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:27,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:55:27,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-23 11:55:27,167 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 16 [2018-11-23 11:55:27,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:27,168 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-23 11:55:27,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:55:27,168 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 11:55:27,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:55:27,169 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:27,169 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:27,169 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:27,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:27,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1208509561, now seen corresponding path program 2 times [2018-11-23 11:55:27,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:27,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:27,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:27,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:27,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:27,295 INFO L256 TraceCheckUtils]: 0: Hoare triple {467#true} call ULTIMATE.init(); {467#true} is VALID [2018-11-23 11:55:27,296 INFO L273 TraceCheckUtils]: 1: Hoare triple {467#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {467#true} is VALID [2018-11-23 11:55:27,296 INFO L273 TraceCheckUtils]: 2: Hoare triple {467#true} assume true; {467#true} is VALID [2018-11-23 11:55:27,296 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {467#true} {467#true} #55#return; {467#true} is VALID [2018-11-23 11:55:27,296 INFO L256 TraceCheckUtils]: 4: Hoare triple {467#true} call #t~ret4 := main(); {467#true} is VALID [2018-11-23 11:55:27,298 INFO L273 TraceCheckUtils]: 5: Hoare triple {467#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {469#(= main_~i~0 0)} is VALID [2018-11-23 11:55:27,300 INFO L273 TraceCheckUtils]: 6: Hoare triple {469#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {469#(= main_~i~0 0)} is VALID [2018-11-23 11:55:27,301 INFO L273 TraceCheckUtils]: 7: Hoare triple {469#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {469#(= main_~i~0 0)} is VALID [2018-11-23 11:55:27,302 INFO L273 TraceCheckUtils]: 8: Hoare triple {469#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {470#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:27,306 INFO L273 TraceCheckUtils]: 9: Hoare triple {470#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {470#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:27,307 INFO L273 TraceCheckUtils]: 10: Hoare triple {470#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {470#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:27,308 INFO L273 TraceCheckUtils]: 11: Hoare triple {470#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {471#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:27,308 INFO L273 TraceCheckUtils]: 12: Hoare triple {471#(<= main_~i~0 2)} assume !(~i~0 < 100000); {468#false} is VALID [2018-11-23 11:55:27,309 INFO L273 TraceCheckUtils]: 13: Hoare triple {468#false} havoc ~x~0;~x~0 := 0; {468#false} is VALID [2018-11-23 11:55:27,309 INFO L273 TraceCheckUtils]: 14: Hoare triple {468#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {468#false} is VALID [2018-11-23 11:55:27,310 INFO L256 TraceCheckUtils]: 15: Hoare triple {468#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {468#false} is VALID [2018-11-23 11:55:27,310 INFO L273 TraceCheckUtils]: 16: Hoare triple {468#false} ~cond := #in~cond; {468#false} is VALID [2018-11-23 11:55:27,311 INFO L273 TraceCheckUtils]: 17: Hoare triple {468#false} assume 0 == ~cond; {468#false} is VALID [2018-11-23 11:55:27,311 INFO L273 TraceCheckUtils]: 18: Hoare triple {468#false} assume !false; {468#false} is VALID [2018-11-23 11:55:27,312 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:27,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:27,312 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:27,322 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:55:27,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:55:27,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:27,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:27,539 INFO L256 TraceCheckUtils]: 0: Hoare triple {467#true} call ULTIMATE.init(); {467#true} is VALID [2018-11-23 11:55:27,539 INFO L273 TraceCheckUtils]: 1: Hoare triple {467#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {467#true} is VALID [2018-11-23 11:55:27,540 INFO L273 TraceCheckUtils]: 2: Hoare triple {467#true} assume true; {467#true} is VALID [2018-11-23 11:55:27,540 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {467#true} {467#true} #55#return; {467#true} is VALID [2018-11-23 11:55:27,540 INFO L256 TraceCheckUtils]: 4: Hoare triple {467#true} call #t~ret4 := main(); {467#true} is VALID [2018-11-23 11:55:27,541 INFO L273 TraceCheckUtils]: 5: Hoare triple {467#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {490#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:27,541 INFO L273 TraceCheckUtils]: 6: Hoare triple {490#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {490#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:27,547 INFO L273 TraceCheckUtils]: 7: Hoare triple {490#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {490#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:27,564 INFO L273 TraceCheckUtils]: 8: Hoare triple {490#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {470#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:27,565 INFO L273 TraceCheckUtils]: 9: Hoare triple {470#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {470#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:27,566 INFO L273 TraceCheckUtils]: 10: Hoare triple {470#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {470#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:27,567 INFO L273 TraceCheckUtils]: 11: Hoare triple {470#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {471#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:27,567 INFO L273 TraceCheckUtils]: 12: Hoare triple {471#(<= main_~i~0 2)} assume !(~i~0 < 100000); {468#false} is VALID [2018-11-23 11:55:27,568 INFO L273 TraceCheckUtils]: 13: Hoare triple {468#false} havoc ~x~0;~x~0 := 0; {468#false} is VALID [2018-11-23 11:55:27,568 INFO L273 TraceCheckUtils]: 14: Hoare triple {468#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {468#false} is VALID [2018-11-23 11:55:27,568 INFO L256 TraceCheckUtils]: 15: Hoare triple {468#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {468#false} is VALID [2018-11-23 11:55:27,568 INFO L273 TraceCheckUtils]: 16: Hoare triple {468#false} ~cond := #in~cond; {468#false} is VALID [2018-11-23 11:55:27,569 INFO L273 TraceCheckUtils]: 17: Hoare triple {468#false} assume 0 == ~cond; {468#false} is VALID [2018-11-23 11:55:27,569 INFO L273 TraceCheckUtils]: 18: Hoare triple {468#false} assume !false; {468#false} is VALID [2018-11-23 11:55:27,571 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:27,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:27,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 11:55:27,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 11:55:27,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:27,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:55:27,686 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:27,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:55:27,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:55:27,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:55:27,687 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 6 states. [2018-11-23 11:55:27,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:27,930 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-23 11:55:27,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:55:27,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 11:55:27,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:27,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:55:27,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-11-23 11:55:27,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:55:27,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-11-23 11:55:27,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2018-11-23 11:55:28,065 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:28,067 INFO L225 Difference]: With dead ends: 40 [2018-11-23 11:55:28,067 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 11:55:28,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:55:28,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 11:55:28,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-23 11:55:28,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:28,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 27 states. [2018-11-23 11:55:28,091 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 27 states. [2018-11-23 11:55:28,091 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 27 states. [2018-11-23 11:55:28,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:28,093 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 11:55:28,093 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 11:55:28,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:28,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:28,094 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 29 states. [2018-11-23 11:55:28,095 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 29 states. [2018-11-23 11:55:28,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:28,097 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 11:55:28,097 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 11:55:28,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:28,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:28,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:28,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:28,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:55:28,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 11:55:28,101 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 19 [2018-11-23 11:55:28,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:28,101 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 11:55:28,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:55:28,102 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 11:55:28,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:55:28,102 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:28,103 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:28,103 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:28,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:28,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1337822499, now seen corresponding path program 3 times [2018-11-23 11:55:28,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:28,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:28,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:28,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:28,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:28,219 INFO L256 TraceCheckUtils]: 0: Hoare triple {679#true} call ULTIMATE.init(); {679#true} is VALID [2018-11-23 11:55:28,219 INFO L273 TraceCheckUtils]: 1: Hoare triple {679#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {679#true} is VALID [2018-11-23 11:55:28,220 INFO L273 TraceCheckUtils]: 2: Hoare triple {679#true} assume true; {679#true} is VALID [2018-11-23 11:55:28,220 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {679#true} {679#true} #55#return; {679#true} is VALID [2018-11-23 11:55:28,220 INFO L256 TraceCheckUtils]: 4: Hoare triple {679#true} call #t~ret4 := main(); {679#true} is VALID [2018-11-23 11:55:28,225 INFO L273 TraceCheckUtils]: 5: Hoare triple {679#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {681#(= main_~i~0 0)} is VALID [2018-11-23 11:55:28,225 INFO L273 TraceCheckUtils]: 6: Hoare triple {681#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {681#(= main_~i~0 0)} is VALID [2018-11-23 11:55:28,228 INFO L273 TraceCheckUtils]: 7: Hoare triple {681#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {681#(= main_~i~0 0)} is VALID [2018-11-23 11:55:28,228 INFO L273 TraceCheckUtils]: 8: Hoare triple {681#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {682#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:28,233 INFO L273 TraceCheckUtils]: 9: Hoare triple {682#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {682#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:28,234 INFO L273 TraceCheckUtils]: 10: Hoare triple {682#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {682#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:28,235 INFO L273 TraceCheckUtils]: 11: Hoare triple {682#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {683#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:28,235 INFO L273 TraceCheckUtils]: 12: Hoare triple {683#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {683#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:28,236 INFO L273 TraceCheckUtils]: 13: Hoare triple {683#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {683#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:28,237 INFO L273 TraceCheckUtils]: 14: Hoare triple {683#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {684#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:28,239 INFO L273 TraceCheckUtils]: 15: Hoare triple {684#(<= main_~i~0 3)} assume !(~i~0 < 100000); {680#false} is VALID [2018-11-23 11:55:28,239 INFO L273 TraceCheckUtils]: 16: Hoare triple {680#false} havoc ~x~0;~x~0 := 0; {680#false} is VALID [2018-11-23 11:55:28,240 INFO L273 TraceCheckUtils]: 17: Hoare triple {680#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {680#false} is VALID [2018-11-23 11:55:28,240 INFO L256 TraceCheckUtils]: 18: Hoare triple {680#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {680#false} is VALID [2018-11-23 11:55:28,241 INFO L273 TraceCheckUtils]: 19: Hoare triple {680#false} ~cond := #in~cond; {680#false} is VALID [2018-11-23 11:55:28,241 INFO L273 TraceCheckUtils]: 20: Hoare triple {680#false} assume 0 == ~cond; {680#false} is VALID [2018-11-23 11:55:28,241 INFO L273 TraceCheckUtils]: 21: Hoare triple {680#false} assume !false; {680#false} is VALID [2018-11-23 11:55:28,242 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:28,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:28,243 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:28,253 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:55:28,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 11:55:28,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:28,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:28,398 INFO L256 TraceCheckUtils]: 0: Hoare triple {679#true} call ULTIMATE.init(); {679#true} is VALID [2018-11-23 11:55:28,399 INFO L273 TraceCheckUtils]: 1: Hoare triple {679#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {679#true} is VALID [2018-11-23 11:55:28,399 INFO L273 TraceCheckUtils]: 2: Hoare triple {679#true} assume true; {679#true} is VALID [2018-11-23 11:55:28,400 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {679#true} {679#true} #55#return; {679#true} is VALID [2018-11-23 11:55:28,400 INFO L256 TraceCheckUtils]: 4: Hoare triple {679#true} call #t~ret4 := main(); {679#true} is VALID [2018-11-23 11:55:28,414 INFO L273 TraceCheckUtils]: 5: Hoare triple {679#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {703#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:28,416 INFO L273 TraceCheckUtils]: 6: Hoare triple {703#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {703#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:28,416 INFO L273 TraceCheckUtils]: 7: Hoare triple {703#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {703#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:28,417 INFO L273 TraceCheckUtils]: 8: Hoare triple {703#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {682#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:28,422 INFO L273 TraceCheckUtils]: 9: Hoare triple {682#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {682#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:28,426 INFO L273 TraceCheckUtils]: 10: Hoare triple {682#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {682#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:28,427 INFO L273 TraceCheckUtils]: 11: Hoare triple {682#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {683#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:28,427 INFO L273 TraceCheckUtils]: 12: Hoare triple {683#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {683#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:28,428 INFO L273 TraceCheckUtils]: 13: Hoare triple {683#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {683#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:28,429 INFO L273 TraceCheckUtils]: 14: Hoare triple {683#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {684#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:28,429 INFO L273 TraceCheckUtils]: 15: Hoare triple {684#(<= main_~i~0 3)} assume !(~i~0 < 100000); {680#false} is VALID [2018-11-23 11:55:28,429 INFO L273 TraceCheckUtils]: 16: Hoare triple {680#false} havoc ~x~0;~x~0 := 0; {680#false} is VALID [2018-11-23 11:55:28,430 INFO L273 TraceCheckUtils]: 17: Hoare triple {680#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {680#false} is VALID [2018-11-23 11:55:28,430 INFO L256 TraceCheckUtils]: 18: Hoare triple {680#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {680#false} is VALID [2018-11-23 11:55:28,430 INFO L273 TraceCheckUtils]: 19: Hoare triple {680#false} ~cond := #in~cond; {680#false} is VALID [2018-11-23 11:55:28,431 INFO L273 TraceCheckUtils]: 20: Hoare triple {680#false} assume 0 == ~cond; {680#false} is VALID [2018-11-23 11:55:28,431 INFO L273 TraceCheckUtils]: 21: Hoare triple {680#false} assume !false; {680#false} is VALID [2018-11-23 11:55:28,432 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:28,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:28,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 11:55:28,452 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-23 11:55:28,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:28,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:55:28,488 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:28,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:55:28,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:55:28,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:55:28,490 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 7 states. [2018-11-23 11:55:28,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:28,717 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-11-23 11:55:28,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:55:28,718 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-23 11:55:28,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:28,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:55:28,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2018-11-23 11:55:28,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:55:28,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2018-11-23 11:55:28,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 50 transitions. [2018-11-23 11:55:28,828 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:28,830 INFO L225 Difference]: With dead ends: 43 [2018-11-23 11:55:28,830 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 11:55:28,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:55:28,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 11:55:28,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-23 11:55:28,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:28,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 30 states. [2018-11-23 11:55:28,845 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 30 states. [2018-11-23 11:55:28,845 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 30 states. [2018-11-23 11:55:28,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:28,848 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-11-23 11:55:28,848 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 11:55:28,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:28,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:28,849 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 32 states. [2018-11-23 11:55:28,849 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 32 states. [2018-11-23 11:55:28,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:28,852 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-11-23 11:55:28,852 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 11:55:28,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:28,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:28,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:28,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:28,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:55:28,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-23 11:55:28,855 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 22 [2018-11-23 11:55:28,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:28,856 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 11:55:28,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:55:28,856 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 11:55:28,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:55:28,857 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:28,857 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:28,857 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:28,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:28,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1113893945, now seen corresponding path program 4 times [2018-11-23 11:55:28,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:28,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:28,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:28,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:28,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:28,995 INFO L256 TraceCheckUtils]: 0: Hoare triple {915#true} call ULTIMATE.init(); {915#true} is VALID [2018-11-23 11:55:28,996 INFO L273 TraceCheckUtils]: 1: Hoare triple {915#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {915#true} is VALID [2018-11-23 11:55:28,996 INFO L273 TraceCheckUtils]: 2: Hoare triple {915#true} assume true; {915#true} is VALID [2018-11-23 11:55:28,996 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {915#true} {915#true} #55#return; {915#true} is VALID [2018-11-23 11:55:28,997 INFO L256 TraceCheckUtils]: 4: Hoare triple {915#true} call #t~ret4 := main(); {915#true} is VALID [2018-11-23 11:55:28,997 INFO L273 TraceCheckUtils]: 5: Hoare triple {915#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {917#(= main_~i~0 0)} is VALID [2018-11-23 11:55:28,998 INFO L273 TraceCheckUtils]: 6: Hoare triple {917#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {917#(= main_~i~0 0)} is VALID [2018-11-23 11:55:28,999 INFO L273 TraceCheckUtils]: 7: Hoare triple {917#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {917#(= main_~i~0 0)} is VALID [2018-11-23 11:55:29,000 INFO L273 TraceCheckUtils]: 8: Hoare triple {917#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {918#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:29,001 INFO L273 TraceCheckUtils]: 9: Hoare triple {918#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {918#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:29,001 INFO L273 TraceCheckUtils]: 10: Hoare triple {918#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {918#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:29,002 INFO L273 TraceCheckUtils]: 11: Hoare triple {918#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {919#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:29,003 INFO L273 TraceCheckUtils]: 12: Hoare triple {919#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {919#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:29,003 INFO L273 TraceCheckUtils]: 13: Hoare triple {919#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {919#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:29,004 INFO L273 TraceCheckUtils]: 14: Hoare triple {919#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {920#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:29,005 INFO L273 TraceCheckUtils]: 15: Hoare triple {920#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {920#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:29,006 INFO L273 TraceCheckUtils]: 16: Hoare triple {920#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {920#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:29,007 INFO L273 TraceCheckUtils]: 17: Hoare triple {920#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {921#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:29,008 INFO L273 TraceCheckUtils]: 18: Hoare triple {921#(<= main_~i~0 4)} assume !(~i~0 < 100000); {916#false} is VALID [2018-11-23 11:55:29,008 INFO L273 TraceCheckUtils]: 19: Hoare triple {916#false} havoc ~x~0;~x~0 := 0; {916#false} is VALID [2018-11-23 11:55:29,008 INFO L273 TraceCheckUtils]: 20: Hoare triple {916#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {916#false} is VALID [2018-11-23 11:55:29,009 INFO L256 TraceCheckUtils]: 21: Hoare triple {916#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {916#false} is VALID [2018-11-23 11:55:29,009 INFO L273 TraceCheckUtils]: 22: Hoare triple {916#false} ~cond := #in~cond; {916#false} is VALID [2018-11-23 11:55:29,009 INFO L273 TraceCheckUtils]: 23: Hoare triple {916#false} assume 0 == ~cond; {916#false} is VALID [2018-11-23 11:55:29,010 INFO L273 TraceCheckUtils]: 24: Hoare triple {916#false} assume !false; {916#false} is VALID [2018-11-23 11:55:29,012 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 11:55:29,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:29,012 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:29,021 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:55:29,037 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:55:29,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:29,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:29,290 INFO L256 TraceCheckUtils]: 0: Hoare triple {915#true} call ULTIMATE.init(); {915#true} is VALID [2018-11-23 11:55:29,291 INFO L273 TraceCheckUtils]: 1: Hoare triple {915#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {915#true} is VALID [2018-11-23 11:55:29,291 INFO L273 TraceCheckUtils]: 2: Hoare triple {915#true} assume true; {915#true} is VALID [2018-11-23 11:55:29,291 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {915#true} {915#true} #55#return; {915#true} is VALID [2018-11-23 11:55:29,292 INFO L256 TraceCheckUtils]: 4: Hoare triple {915#true} call #t~ret4 := main(); {915#true} is VALID [2018-11-23 11:55:29,293 INFO L273 TraceCheckUtils]: 5: Hoare triple {915#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {940#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:29,293 INFO L273 TraceCheckUtils]: 6: Hoare triple {940#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {940#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:29,294 INFO L273 TraceCheckUtils]: 7: Hoare triple {940#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {940#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:29,295 INFO L273 TraceCheckUtils]: 8: Hoare triple {940#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {918#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:29,295 INFO L273 TraceCheckUtils]: 9: Hoare triple {918#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {918#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:29,296 INFO L273 TraceCheckUtils]: 10: Hoare triple {918#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {918#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:29,296 INFO L273 TraceCheckUtils]: 11: Hoare triple {918#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {919#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:29,297 INFO L273 TraceCheckUtils]: 12: Hoare triple {919#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {919#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:29,298 INFO L273 TraceCheckUtils]: 13: Hoare triple {919#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {919#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:29,299 INFO L273 TraceCheckUtils]: 14: Hoare triple {919#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {920#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:29,299 INFO L273 TraceCheckUtils]: 15: Hoare triple {920#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {920#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:29,300 INFO L273 TraceCheckUtils]: 16: Hoare triple {920#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {920#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:29,301 INFO L273 TraceCheckUtils]: 17: Hoare triple {920#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {921#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:29,302 INFO L273 TraceCheckUtils]: 18: Hoare triple {921#(<= main_~i~0 4)} assume !(~i~0 < 100000); {916#false} is VALID [2018-11-23 11:55:29,302 INFO L273 TraceCheckUtils]: 19: Hoare triple {916#false} havoc ~x~0;~x~0 := 0; {916#false} is VALID [2018-11-23 11:55:29,303 INFO L273 TraceCheckUtils]: 20: Hoare triple {916#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {916#false} is VALID [2018-11-23 11:55:29,303 INFO L256 TraceCheckUtils]: 21: Hoare triple {916#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {916#false} is VALID [2018-11-23 11:55:29,303 INFO L273 TraceCheckUtils]: 22: Hoare triple {916#false} ~cond := #in~cond; {916#false} is VALID [2018-11-23 11:55:29,304 INFO L273 TraceCheckUtils]: 23: Hoare triple {916#false} assume 0 == ~cond; {916#false} is VALID [2018-11-23 11:55:29,304 INFO L273 TraceCheckUtils]: 24: Hoare triple {916#false} assume !false; {916#false} is VALID [2018-11-23 11:55:29,306 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 11:55:29,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:29,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 11:55:29,330 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-23 11:55:29,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:29,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:55:29,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:29,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:55:29,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:55:29,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:55:29,436 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 8 states. [2018-11-23 11:55:29,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:29,625 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 11:55:29,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:55:29,625 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-23 11:55:29,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:29,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:55:29,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2018-11-23 11:55:29,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:55:29,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2018-11-23 11:55:29,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 54 transitions. [2018-11-23 11:55:29,700 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:29,702 INFO L225 Difference]: With dead ends: 46 [2018-11-23 11:55:29,702 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 11:55:29,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:55:29,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 11:55:29,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-23 11:55:29,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:29,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 33 states. [2018-11-23 11:55:29,715 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 33 states. [2018-11-23 11:55:29,715 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 33 states. [2018-11-23 11:55:29,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:29,717 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-23 11:55:29,717 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-23 11:55:29,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:29,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:29,718 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 35 states. [2018-11-23 11:55:29,718 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 35 states. [2018-11-23 11:55:29,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:29,720 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-23 11:55:29,721 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-23 11:55:29,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:29,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:29,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:29,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:29,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:55:29,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-23 11:55:29,724 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 25 [2018-11-23 11:55:29,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:29,724 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-23 11:55:29,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:55:29,725 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 11:55:29,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 11:55:29,726 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:29,726 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:29,726 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:29,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:29,727 INFO L82 PathProgramCache]: Analyzing trace with hash 142552419, now seen corresponding path program 5 times [2018-11-23 11:55:29,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:29,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:29,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:29,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:29,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:30,066 INFO L256 TraceCheckUtils]: 0: Hoare triple {1175#true} call ULTIMATE.init(); {1175#true} is VALID [2018-11-23 11:55:30,067 INFO L273 TraceCheckUtils]: 1: Hoare triple {1175#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1175#true} is VALID [2018-11-23 11:55:30,068 INFO L273 TraceCheckUtils]: 2: Hoare triple {1175#true} assume true; {1175#true} is VALID [2018-11-23 11:55:30,068 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1175#true} {1175#true} #55#return; {1175#true} is VALID [2018-11-23 11:55:30,069 INFO L256 TraceCheckUtils]: 4: Hoare triple {1175#true} call #t~ret4 := main(); {1175#true} is VALID [2018-11-23 11:55:30,069 INFO L273 TraceCheckUtils]: 5: Hoare triple {1175#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {1177#(= main_~i~0 0)} is VALID [2018-11-23 11:55:30,070 INFO L273 TraceCheckUtils]: 6: Hoare triple {1177#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1177#(= main_~i~0 0)} is VALID [2018-11-23 11:55:30,070 INFO L273 TraceCheckUtils]: 7: Hoare triple {1177#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1177#(= main_~i~0 0)} is VALID [2018-11-23 11:55:30,071 INFO L273 TraceCheckUtils]: 8: Hoare triple {1177#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1178#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:30,071 INFO L273 TraceCheckUtils]: 9: Hoare triple {1178#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1178#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:30,072 INFO L273 TraceCheckUtils]: 10: Hoare triple {1178#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1178#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:30,072 INFO L273 TraceCheckUtils]: 11: Hoare triple {1178#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1179#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:30,073 INFO L273 TraceCheckUtils]: 12: Hoare triple {1179#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1179#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:30,081 INFO L273 TraceCheckUtils]: 13: Hoare triple {1179#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1179#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:30,082 INFO L273 TraceCheckUtils]: 14: Hoare triple {1179#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1180#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:30,082 INFO L273 TraceCheckUtils]: 15: Hoare triple {1180#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1180#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:30,083 INFO L273 TraceCheckUtils]: 16: Hoare triple {1180#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1180#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:30,083 INFO L273 TraceCheckUtils]: 17: Hoare triple {1180#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1181#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:30,084 INFO L273 TraceCheckUtils]: 18: Hoare triple {1181#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1181#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:30,090 INFO L273 TraceCheckUtils]: 19: Hoare triple {1181#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1181#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:30,091 INFO L273 TraceCheckUtils]: 20: Hoare triple {1181#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {1182#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:30,091 INFO L273 TraceCheckUtils]: 21: Hoare triple {1182#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1176#false} is VALID [2018-11-23 11:55:30,091 INFO L273 TraceCheckUtils]: 22: Hoare triple {1176#false} havoc ~x~0;~x~0 := 0; {1176#false} is VALID [2018-11-23 11:55:30,092 INFO L273 TraceCheckUtils]: 23: Hoare triple {1176#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1176#false} is VALID [2018-11-23 11:55:30,092 INFO L256 TraceCheckUtils]: 24: Hoare triple {1176#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {1176#false} is VALID [2018-11-23 11:55:30,092 INFO L273 TraceCheckUtils]: 25: Hoare triple {1176#false} ~cond := #in~cond; {1176#false} is VALID [2018-11-23 11:55:30,092 INFO L273 TraceCheckUtils]: 26: Hoare triple {1176#false} assume 0 == ~cond; {1176#false} is VALID [2018-11-23 11:55:30,093 INFO L273 TraceCheckUtils]: 27: Hoare triple {1176#false} assume !false; {1176#false} is VALID [2018-11-23 11:55:30,095 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:30,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:30,095 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:30,106 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:55:30,164 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 11:55:30,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:30,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:30,318 INFO L256 TraceCheckUtils]: 0: Hoare triple {1175#true} call ULTIMATE.init(); {1175#true} is VALID [2018-11-23 11:55:30,319 INFO L273 TraceCheckUtils]: 1: Hoare triple {1175#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1175#true} is VALID [2018-11-23 11:55:30,319 INFO L273 TraceCheckUtils]: 2: Hoare triple {1175#true} assume true; {1175#true} is VALID [2018-11-23 11:55:30,319 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1175#true} {1175#true} #55#return; {1175#true} is VALID [2018-11-23 11:55:30,320 INFO L256 TraceCheckUtils]: 4: Hoare triple {1175#true} call #t~ret4 := main(); {1175#true} is VALID [2018-11-23 11:55:30,321 INFO L273 TraceCheckUtils]: 5: Hoare triple {1175#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {1201#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:30,322 INFO L273 TraceCheckUtils]: 6: Hoare triple {1201#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1201#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:30,326 INFO L273 TraceCheckUtils]: 7: Hoare triple {1201#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1201#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:30,327 INFO L273 TraceCheckUtils]: 8: Hoare triple {1201#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1178#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:30,327 INFO L273 TraceCheckUtils]: 9: Hoare triple {1178#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1178#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:30,328 INFO L273 TraceCheckUtils]: 10: Hoare triple {1178#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1178#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:30,328 INFO L273 TraceCheckUtils]: 11: Hoare triple {1178#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1179#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:30,329 INFO L273 TraceCheckUtils]: 12: Hoare triple {1179#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1179#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:30,330 INFO L273 TraceCheckUtils]: 13: Hoare triple {1179#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1179#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:30,330 INFO L273 TraceCheckUtils]: 14: Hoare triple {1179#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1180#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:30,331 INFO L273 TraceCheckUtils]: 15: Hoare triple {1180#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1180#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:30,332 INFO L273 TraceCheckUtils]: 16: Hoare triple {1180#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1180#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:30,333 INFO L273 TraceCheckUtils]: 17: Hoare triple {1180#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1181#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:30,334 INFO L273 TraceCheckUtils]: 18: Hoare triple {1181#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1181#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:30,335 INFO L273 TraceCheckUtils]: 19: Hoare triple {1181#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1181#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:30,336 INFO L273 TraceCheckUtils]: 20: Hoare triple {1181#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {1182#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:30,336 INFO L273 TraceCheckUtils]: 21: Hoare triple {1182#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1176#false} is VALID [2018-11-23 11:55:30,337 INFO L273 TraceCheckUtils]: 22: Hoare triple {1176#false} havoc ~x~0;~x~0 := 0; {1176#false} is VALID [2018-11-23 11:55:30,337 INFO L273 TraceCheckUtils]: 23: Hoare triple {1176#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1176#false} is VALID [2018-11-23 11:55:30,337 INFO L256 TraceCheckUtils]: 24: Hoare triple {1176#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {1176#false} is VALID [2018-11-23 11:55:30,338 INFO L273 TraceCheckUtils]: 25: Hoare triple {1176#false} ~cond := #in~cond; {1176#false} is VALID [2018-11-23 11:55:30,338 INFO L273 TraceCheckUtils]: 26: Hoare triple {1176#false} assume 0 == ~cond; {1176#false} is VALID [2018-11-23 11:55:30,338 INFO L273 TraceCheckUtils]: 27: Hoare triple {1176#false} assume !false; {1176#false} is VALID [2018-11-23 11:55:30,341 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:30,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:30,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 11:55:30,361 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-23 11:55:30,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:30,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:55:30,413 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:30,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:55:30,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:55:30,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:55:30,414 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 9 states. [2018-11-23 11:55:30,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:30,603 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 11:55:30,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:55:30,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-23 11:55:30,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:30,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:55:30,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2018-11-23 11:55:30,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:55:30,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2018-11-23 11:55:30,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 58 transitions. [2018-11-23 11:55:30,682 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:30,684 INFO L225 Difference]: With dead ends: 49 [2018-11-23 11:55:30,684 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 11:55:30,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:55:30,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 11:55:30,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-11-23 11:55:30,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:30,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 36 states. [2018-11-23 11:55:30,726 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 36 states. [2018-11-23 11:55:30,726 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 36 states. [2018-11-23 11:55:30,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:30,729 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2018-11-23 11:55:30,729 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-11-23 11:55:30,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:30,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:30,731 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 38 states. [2018-11-23 11:55:30,731 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 38 states. [2018-11-23 11:55:30,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:30,733 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2018-11-23 11:55:30,733 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-11-23 11:55:30,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:30,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:30,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:30,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:30,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:55:30,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-23 11:55:30,736 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 28 [2018-11-23 11:55:30,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:30,737 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-23 11:55:30,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:55:30,737 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-23 11:55:30,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:55:30,738 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:30,738 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:30,738 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:30,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:30,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1898175495, now seen corresponding path program 6 times [2018-11-23 11:55:30,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:30,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:30,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:30,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:30,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:30,917 INFO L256 TraceCheckUtils]: 0: Hoare triple {1459#true} call ULTIMATE.init(); {1459#true} is VALID [2018-11-23 11:55:30,917 INFO L273 TraceCheckUtils]: 1: Hoare triple {1459#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1459#true} is VALID [2018-11-23 11:55:30,918 INFO L273 TraceCheckUtils]: 2: Hoare triple {1459#true} assume true; {1459#true} is VALID [2018-11-23 11:55:30,918 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1459#true} {1459#true} #55#return; {1459#true} is VALID [2018-11-23 11:55:30,918 INFO L256 TraceCheckUtils]: 4: Hoare triple {1459#true} call #t~ret4 := main(); {1459#true} is VALID [2018-11-23 11:55:30,921 INFO L273 TraceCheckUtils]: 5: Hoare triple {1459#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {1461#(= main_~i~0 0)} is VALID [2018-11-23 11:55:30,921 INFO L273 TraceCheckUtils]: 6: Hoare triple {1461#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1461#(= main_~i~0 0)} is VALID [2018-11-23 11:55:30,922 INFO L273 TraceCheckUtils]: 7: Hoare triple {1461#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1461#(= main_~i~0 0)} is VALID [2018-11-23 11:55:30,926 INFO L273 TraceCheckUtils]: 8: Hoare triple {1461#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1462#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:30,929 INFO L273 TraceCheckUtils]: 9: Hoare triple {1462#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1462#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:30,930 INFO L273 TraceCheckUtils]: 10: Hoare triple {1462#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1462#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:30,931 INFO L273 TraceCheckUtils]: 11: Hoare triple {1462#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1463#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:30,932 INFO L273 TraceCheckUtils]: 12: Hoare triple {1463#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1463#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:30,935 INFO L273 TraceCheckUtils]: 13: Hoare triple {1463#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1463#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:30,935 INFO L273 TraceCheckUtils]: 14: Hoare triple {1463#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1464#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:30,936 INFO L273 TraceCheckUtils]: 15: Hoare triple {1464#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1464#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:30,936 INFO L273 TraceCheckUtils]: 16: Hoare triple {1464#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1464#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:30,937 INFO L273 TraceCheckUtils]: 17: Hoare triple {1464#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1465#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:30,937 INFO L273 TraceCheckUtils]: 18: Hoare triple {1465#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1465#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:30,937 INFO L273 TraceCheckUtils]: 19: Hoare triple {1465#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1465#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:30,938 INFO L273 TraceCheckUtils]: 20: Hoare triple {1465#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {1466#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:30,938 INFO L273 TraceCheckUtils]: 21: Hoare triple {1466#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1466#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:30,939 INFO L273 TraceCheckUtils]: 22: Hoare triple {1466#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1466#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:30,939 INFO L273 TraceCheckUtils]: 23: Hoare triple {1466#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {1467#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:30,940 INFO L273 TraceCheckUtils]: 24: Hoare triple {1467#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1460#false} is VALID [2018-11-23 11:55:30,940 INFO L273 TraceCheckUtils]: 25: Hoare triple {1460#false} havoc ~x~0;~x~0 := 0; {1460#false} is VALID [2018-11-23 11:55:30,941 INFO L273 TraceCheckUtils]: 26: Hoare triple {1460#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1460#false} is VALID [2018-11-23 11:55:30,941 INFO L256 TraceCheckUtils]: 27: Hoare triple {1460#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {1460#false} is VALID [2018-11-23 11:55:30,941 INFO L273 TraceCheckUtils]: 28: Hoare triple {1460#false} ~cond := #in~cond; {1460#false} is VALID [2018-11-23 11:55:30,942 INFO L273 TraceCheckUtils]: 29: Hoare triple {1460#false} assume 0 == ~cond; {1460#false} is VALID [2018-11-23 11:55:30,942 INFO L273 TraceCheckUtils]: 30: Hoare triple {1460#false} assume !false; {1460#false} is VALID [2018-11-23 11:55:30,943 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:30,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:30,944 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:30,962 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:55:31,002 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 11:55:31,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:31,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:31,159 INFO L256 TraceCheckUtils]: 0: Hoare triple {1459#true} call ULTIMATE.init(); {1459#true} is VALID [2018-11-23 11:55:31,160 INFO L273 TraceCheckUtils]: 1: Hoare triple {1459#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1459#true} is VALID [2018-11-23 11:55:31,160 INFO L273 TraceCheckUtils]: 2: Hoare triple {1459#true} assume true; {1459#true} is VALID [2018-11-23 11:55:31,160 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1459#true} {1459#true} #55#return; {1459#true} is VALID [2018-11-23 11:55:31,160 INFO L256 TraceCheckUtils]: 4: Hoare triple {1459#true} call #t~ret4 := main(); {1459#true} is VALID [2018-11-23 11:55:31,161 INFO L273 TraceCheckUtils]: 5: Hoare triple {1459#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {1486#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:31,162 INFO L273 TraceCheckUtils]: 6: Hoare triple {1486#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1486#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:31,162 INFO L273 TraceCheckUtils]: 7: Hoare triple {1486#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1486#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:31,163 INFO L273 TraceCheckUtils]: 8: Hoare triple {1486#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1462#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:31,164 INFO L273 TraceCheckUtils]: 9: Hoare triple {1462#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1462#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:31,165 INFO L273 TraceCheckUtils]: 10: Hoare triple {1462#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1462#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:31,166 INFO L273 TraceCheckUtils]: 11: Hoare triple {1462#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1463#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:31,167 INFO L273 TraceCheckUtils]: 12: Hoare triple {1463#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1463#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:31,167 INFO L273 TraceCheckUtils]: 13: Hoare triple {1463#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1463#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:31,168 INFO L273 TraceCheckUtils]: 14: Hoare triple {1463#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1464#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:31,169 INFO L273 TraceCheckUtils]: 15: Hoare triple {1464#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1464#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:31,170 INFO L273 TraceCheckUtils]: 16: Hoare triple {1464#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1464#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:31,171 INFO L273 TraceCheckUtils]: 17: Hoare triple {1464#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1465#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:31,171 INFO L273 TraceCheckUtils]: 18: Hoare triple {1465#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1465#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:31,172 INFO L273 TraceCheckUtils]: 19: Hoare triple {1465#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1465#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:31,173 INFO L273 TraceCheckUtils]: 20: Hoare triple {1465#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {1466#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:31,174 INFO L273 TraceCheckUtils]: 21: Hoare triple {1466#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1466#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:31,174 INFO L273 TraceCheckUtils]: 22: Hoare triple {1466#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1466#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:31,175 INFO L273 TraceCheckUtils]: 23: Hoare triple {1466#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {1467#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:31,176 INFO L273 TraceCheckUtils]: 24: Hoare triple {1467#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1460#false} is VALID [2018-11-23 11:55:31,177 INFO L273 TraceCheckUtils]: 25: Hoare triple {1460#false} havoc ~x~0;~x~0 := 0; {1460#false} is VALID [2018-11-23 11:55:31,177 INFO L273 TraceCheckUtils]: 26: Hoare triple {1460#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1460#false} is VALID [2018-11-23 11:55:31,177 INFO L256 TraceCheckUtils]: 27: Hoare triple {1460#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {1460#false} is VALID [2018-11-23 11:55:31,178 INFO L273 TraceCheckUtils]: 28: Hoare triple {1460#false} ~cond := #in~cond; {1460#false} is VALID [2018-11-23 11:55:31,178 INFO L273 TraceCheckUtils]: 29: Hoare triple {1460#false} assume 0 == ~cond; {1460#false} is VALID [2018-11-23 11:55:31,178 INFO L273 TraceCheckUtils]: 30: Hoare triple {1460#false} assume !false; {1460#false} is VALID [2018-11-23 11:55:31,181 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:31,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:31,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 11:55:31,201 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-11-23 11:55:31,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:31,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:55:31,293 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:31,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:55:31,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:55:31,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:55:31,294 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 10 states. [2018-11-23 11:55:31,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:31,746 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-11-23 11:55:31,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:55:31,747 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-11-23 11:55:31,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:31,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:55:31,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2018-11-23 11:55:31,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:55:31,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2018-11-23 11:55:31,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 62 transitions. [2018-11-23 11:55:31,843 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:31,845 INFO L225 Difference]: With dead ends: 52 [2018-11-23 11:55:31,845 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 11:55:31,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:55:31,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 11:55:31,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-11-23 11:55:31,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:31,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 39 states. [2018-11-23 11:55:31,866 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 39 states. [2018-11-23 11:55:31,866 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 39 states. [2018-11-23 11:55:31,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:31,868 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2018-11-23 11:55:31,868 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2018-11-23 11:55:31,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:31,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:31,869 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 41 states. [2018-11-23 11:55:31,869 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 41 states. [2018-11-23 11:55:31,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:31,871 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2018-11-23 11:55:31,871 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2018-11-23 11:55:31,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:31,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:31,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:31,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:31,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 11:55:31,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2018-11-23 11:55:31,874 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 31 [2018-11-23 11:55:31,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:31,875 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-11-23 11:55:31,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:55:31,875 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2018-11-23 11:55:31,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 11:55:31,876 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:31,876 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:31,876 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:31,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:31,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1961386589, now seen corresponding path program 7 times [2018-11-23 11:55:31,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:31,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:31,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:31,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:31,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:32,063 INFO L256 TraceCheckUtils]: 0: Hoare triple {1767#true} call ULTIMATE.init(); {1767#true} is VALID [2018-11-23 11:55:32,064 INFO L273 TraceCheckUtils]: 1: Hoare triple {1767#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1767#true} is VALID [2018-11-23 11:55:32,064 INFO L273 TraceCheckUtils]: 2: Hoare triple {1767#true} assume true; {1767#true} is VALID [2018-11-23 11:55:32,064 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1767#true} {1767#true} #55#return; {1767#true} is VALID [2018-11-23 11:55:32,065 INFO L256 TraceCheckUtils]: 4: Hoare triple {1767#true} call #t~ret4 := main(); {1767#true} is VALID [2018-11-23 11:55:32,065 INFO L273 TraceCheckUtils]: 5: Hoare triple {1767#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {1769#(= main_~i~0 0)} is VALID [2018-11-23 11:55:32,066 INFO L273 TraceCheckUtils]: 6: Hoare triple {1769#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1769#(= main_~i~0 0)} is VALID [2018-11-23 11:55:32,068 INFO L273 TraceCheckUtils]: 7: Hoare triple {1769#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1769#(= main_~i~0 0)} is VALID [2018-11-23 11:55:32,068 INFO L273 TraceCheckUtils]: 8: Hoare triple {1769#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1770#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:32,069 INFO L273 TraceCheckUtils]: 9: Hoare triple {1770#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1770#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:32,069 INFO L273 TraceCheckUtils]: 10: Hoare triple {1770#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1770#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:32,070 INFO L273 TraceCheckUtils]: 11: Hoare triple {1770#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1771#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:32,071 INFO L273 TraceCheckUtils]: 12: Hoare triple {1771#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1771#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:32,072 INFO L273 TraceCheckUtils]: 13: Hoare triple {1771#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1771#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:32,073 INFO L273 TraceCheckUtils]: 14: Hoare triple {1771#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1772#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:32,092 INFO L273 TraceCheckUtils]: 15: Hoare triple {1772#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1772#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:32,106 INFO L273 TraceCheckUtils]: 16: Hoare triple {1772#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1772#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:32,112 INFO L273 TraceCheckUtils]: 17: Hoare triple {1772#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1773#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:32,113 INFO L273 TraceCheckUtils]: 18: Hoare triple {1773#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1773#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:32,114 INFO L273 TraceCheckUtils]: 19: Hoare triple {1773#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1773#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:32,114 INFO L273 TraceCheckUtils]: 20: Hoare triple {1773#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {1774#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:32,115 INFO L273 TraceCheckUtils]: 21: Hoare triple {1774#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1774#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:32,115 INFO L273 TraceCheckUtils]: 22: Hoare triple {1774#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1774#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:32,116 INFO L273 TraceCheckUtils]: 23: Hoare triple {1774#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {1775#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:32,116 INFO L273 TraceCheckUtils]: 24: Hoare triple {1775#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1775#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:32,117 INFO L273 TraceCheckUtils]: 25: Hoare triple {1775#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1775#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:32,118 INFO L273 TraceCheckUtils]: 26: Hoare triple {1775#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {1776#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:32,119 INFO L273 TraceCheckUtils]: 27: Hoare triple {1776#(<= main_~i~0 7)} assume !(~i~0 < 100000); {1768#false} is VALID [2018-11-23 11:55:32,119 INFO L273 TraceCheckUtils]: 28: Hoare triple {1768#false} havoc ~x~0;~x~0 := 0; {1768#false} is VALID [2018-11-23 11:55:32,120 INFO L273 TraceCheckUtils]: 29: Hoare triple {1768#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1768#false} is VALID [2018-11-23 11:55:32,120 INFO L256 TraceCheckUtils]: 30: Hoare triple {1768#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {1768#false} is VALID [2018-11-23 11:55:32,120 INFO L273 TraceCheckUtils]: 31: Hoare triple {1768#false} ~cond := #in~cond; {1768#false} is VALID [2018-11-23 11:55:32,121 INFO L273 TraceCheckUtils]: 32: Hoare triple {1768#false} assume 0 == ~cond; {1768#false} is VALID [2018-11-23 11:55:32,121 INFO L273 TraceCheckUtils]: 33: Hoare triple {1768#false} assume !false; {1768#false} is VALID [2018-11-23 11:55:32,124 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:32,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:32,124 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:32,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:32,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:32,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:32,287 INFO L256 TraceCheckUtils]: 0: Hoare triple {1767#true} call ULTIMATE.init(); {1767#true} is VALID [2018-11-23 11:55:32,287 INFO L273 TraceCheckUtils]: 1: Hoare triple {1767#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1767#true} is VALID [2018-11-23 11:55:32,287 INFO L273 TraceCheckUtils]: 2: Hoare triple {1767#true} assume true; {1767#true} is VALID [2018-11-23 11:55:32,288 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1767#true} {1767#true} #55#return; {1767#true} is VALID [2018-11-23 11:55:32,288 INFO L256 TraceCheckUtils]: 4: Hoare triple {1767#true} call #t~ret4 := main(); {1767#true} is VALID [2018-11-23 11:55:32,292 INFO L273 TraceCheckUtils]: 5: Hoare triple {1767#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {1795#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:32,294 INFO L273 TraceCheckUtils]: 6: Hoare triple {1795#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1795#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:32,294 INFO L273 TraceCheckUtils]: 7: Hoare triple {1795#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1795#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:32,296 INFO L273 TraceCheckUtils]: 8: Hoare triple {1795#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {1770#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:32,296 INFO L273 TraceCheckUtils]: 9: Hoare triple {1770#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1770#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:32,299 INFO L273 TraceCheckUtils]: 10: Hoare triple {1770#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1770#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:32,299 INFO L273 TraceCheckUtils]: 11: Hoare triple {1770#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {1771#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:32,327 INFO L273 TraceCheckUtils]: 12: Hoare triple {1771#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1771#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:32,344 INFO L273 TraceCheckUtils]: 13: Hoare triple {1771#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1771#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:32,345 INFO L273 TraceCheckUtils]: 14: Hoare triple {1771#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {1772#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:32,345 INFO L273 TraceCheckUtils]: 15: Hoare triple {1772#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1772#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:32,348 INFO L273 TraceCheckUtils]: 16: Hoare triple {1772#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1772#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:32,349 INFO L273 TraceCheckUtils]: 17: Hoare triple {1772#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {1773#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:32,349 INFO L273 TraceCheckUtils]: 18: Hoare triple {1773#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1773#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:32,350 INFO L273 TraceCheckUtils]: 19: Hoare triple {1773#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1773#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:32,350 INFO L273 TraceCheckUtils]: 20: Hoare triple {1773#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {1774#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:32,352 INFO L273 TraceCheckUtils]: 21: Hoare triple {1774#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1774#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:32,353 INFO L273 TraceCheckUtils]: 22: Hoare triple {1774#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1774#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:32,353 INFO L273 TraceCheckUtils]: 23: Hoare triple {1774#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {1775#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:32,354 INFO L273 TraceCheckUtils]: 24: Hoare triple {1775#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1775#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:32,354 INFO L273 TraceCheckUtils]: 25: Hoare triple {1775#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {1775#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:32,355 INFO L273 TraceCheckUtils]: 26: Hoare triple {1775#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {1776#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:32,355 INFO L273 TraceCheckUtils]: 27: Hoare triple {1776#(<= main_~i~0 7)} assume !(~i~0 < 100000); {1768#false} is VALID [2018-11-23 11:55:32,355 INFO L273 TraceCheckUtils]: 28: Hoare triple {1768#false} havoc ~x~0;~x~0 := 0; {1768#false} is VALID [2018-11-23 11:55:32,355 INFO L273 TraceCheckUtils]: 29: Hoare triple {1768#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1768#false} is VALID [2018-11-23 11:55:32,356 INFO L256 TraceCheckUtils]: 30: Hoare triple {1768#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {1768#false} is VALID [2018-11-23 11:55:32,356 INFO L273 TraceCheckUtils]: 31: Hoare triple {1768#false} ~cond := #in~cond; {1768#false} is VALID [2018-11-23 11:55:32,356 INFO L273 TraceCheckUtils]: 32: Hoare triple {1768#false} assume 0 == ~cond; {1768#false} is VALID [2018-11-23 11:55:32,356 INFO L273 TraceCheckUtils]: 33: Hoare triple {1768#false} assume !false; {1768#false} is VALID [2018-11-23 11:55:32,357 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:32,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:32,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 11:55:32,378 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-11-23 11:55:32,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:32,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:55:32,421 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 11:55:32,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:55:32,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:55:32,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:55:32,422 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 11 states. [2018-11-23 11:55:32,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:32,640 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2018-11-23 11:55:32,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:55:32,641 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-11-23 11:55:32,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:32,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:55:32,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2018-11-23 11:55:32,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:55:32,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2018-11-23 11:55:32,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 66 transitions. [2018-11-23 11:55:32,760 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:32,761 INFO L225 Difference]: With dead ends: 55 [2018-11-23 11:55:32,761 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 11:55:32,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:55:32,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 11:55:32,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-11-23 11:55:32,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:32,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2018-11-23 11:55:32,924 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2018-11-23 11:55:32,924 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2018-11-23 11:55:32,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:32,926 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2018-11-23 11:55:32,926 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-23 11:55:32,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:32,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:32,927 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2018-11-23 11:55:32,927 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2018-11-23 11:55:32,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:32,929 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2018-11-23 11:55:32,929 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-23 11:55:32,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:32,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:32,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:32,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:32,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:55:32,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2018-11-23 11:55:32,931 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 34 [2018-11-23 11:55:32,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:32,932 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2018-11-23 11:55:32,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:55:32,932 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2018-11-23 11:55:32,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 11:55:32,933 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:32,933 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:32,933 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:32,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:32,934 INFO L82 PathProgramCache]: Analyzing trace with hash 407555001, now seen corresponding path program 8 times [2018-11-23 11:55:32,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:32,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:32,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:32,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:32,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:33,681 INFO L256 TraceCheckUtils]: 0: Hoare triple {2099#true} call ULTIMATE.init(); {2099#true} is VALID [2018-11-23 11:55:33,681 INFO L273 TraceCheckUtils]: 1: Hoare triple {2099#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2099#true} is VALID [2018-11-23 11:55:33,682 INFO L273 TraceCheckUtils]: 2: Hoare triple {2099#true} assume true; {2099#true} is VALID [2018-11-23 11:55:33,682 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2099#true} {2099#true} #55#return; {2099#true} is VALID [2018-11-23 11:55:33,683 INFO L256 TraceCheckUtils]: 4: Hoare triple {2099#true} call #t~ret4 := main(); {2099#true} is VALID [2018-11-23 11:55:33,687 INFO L273 TraceCheckUtils]: 5: Hoare triple {2099#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {2101#(= main_~i~0 0)} is VALID [2018-11-23 11:55:33,688 INFO L273 TraceCheckUtils]: 6: Hoare triple {2101#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2101#(= main_~i~0 0)} is VALID [2018-11-23 11:55:33,689 INFO L273 TraceCheckUtils]: 7: Hoare triple {2101#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2101#(= main_~i~0 0)} is VALID [2018-11-23 11:55:33,691 INFO L273 TraceCheckUtils]: 8: Hoare triple {2101#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {2102#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:33,692 INFO L273 TraceCheckUtils]: 9: Hoare triple {2102#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2102#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:33,692 INFO L273 TraceCheckUtils]: 10: Hoare triple {2102#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2102#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:33,692 INFO L273 TraceCheckUtils]: 11: Hoare triple {2102#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2103#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:33,693 INFO L273 TraceCheckUtils]: 12: Hoare triple {2103#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2103#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:33,693 INFO L273 TraceCheckUtils]: 13: Hoare triple {2103#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2103#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:33,694 INFO L273 TraceCheckUtils]: 14: Hoare triple {2103#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2104#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:33,694 INFO L273 TraceCheckUtils]: 15: Hoare triple {2104#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2104#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:33,694 INFO L273 TraceCheckUtils]: 16: Hoare triple {2104#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2104#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:33,695 INFO L273 TraceCheckUtils]: 17: Hoare triple {2104#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2105#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:33,696 INFO L273 TraceCheckUtils]: 18: Hoare triple {2105#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2105#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:33,696 INFO L273 TraceCheckUtils]: 19: Hoare triple {2105#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2105#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:33,697 INFO L273 TraceCheckUtils]: 20: Hoare triple {2105#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2106#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:33,698 INFO L273 TraceCheckUtils]: 21: Hoare triple {2106#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2106#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:33,705 INFO L273 TraceCheckUtils]: 22: Hoare triple {2106#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2106#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:33,706 INFO L273 TraceCheckUtils]: 23: Hoare triple {2106#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2107#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:33,706 INFO L273 TraceCheckUtils]: 24: Hoare triple {2107#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2107#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:33,707 INFO L273 TraceCheckUtils]: 25: Hoare triple {2107#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2107#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:33,707 INFO L273 TraceCheckUtils]: 26: Hoare triple {2107#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2108#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:33,708 INFO L273 TraceCheckUtils]: 27: Hoare triple {2108#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2108#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:33,709 INFO L273 TraceCheckUtils]: 28: Hoare triple {2108#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2108#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:33,709 INFO L273 TraceCheckUtils]: 29: Hoare triple {2108#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {2109#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:33,710 INFO L273 TraceCheckUtils]: 30: Hoare triple {2109#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2100#false} is VALID [2018-11-23 11:55:33,710 INFO L273 TraceCheckUtils]: 31: Hoare triple {2100#false} havoc ~x~0;~x~0 := 0; {2100#false} is VALID [2018-11-23 11:55:33,711 INFO L273 TraceCheckUtils]: 32: Hoare triple {2100#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2100#false} is VALID [2018-11-23 11:55:33,711 INFO L256 TraceCheckUtils]: 33: Hoare triple {2100#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {2100#false} is VALID [2018-11-23 11:55:33,711 INFO L273 TraceCheckUtils]: 34: Hoare triple {2100#false} ~cond := #in~cond; {2100#false} is VALID [2018-11-23 11:55:33,711 INFO L273 TraceCheckUtils]: 35: Hoare triple {2100#false} assume 0 == ~cond; {2100#false} is VALID [2018-11-23 11:55:33,712 INFO L273 TraceCheckUtils]: 36: Hoare triple {2100#false} assume !false; {2100#false} is VALID [2018-11-23 11:55:33,713 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:33,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:33,713 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:33,724 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:55:33,746 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:55:33,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:33,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:33,899 INFO L256 TraceCheckUtils]: 0: Hoare triple {2099#true} call ULTIMATE.init(); {2099#true} is VALID [2018-11-23 11:55:33,900 INFO L273 TraceCheckUtils]: 1: Hoare triple {2099#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2099#true} is VALID [2018-11-23 11:55:33,900 INFO L273 TraceCheckUtils]: 2: Hoare triple {2099#true} assume true; {2099#true} is VALID [2018-11-23 11:55:33,900 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2099#true} {2099#true} #55#return; {2099#true} is VALID [2018-11-23 11:55:33,900 INFO L256 TraceCheckUtils]: 4: Hoare triple {2099#true} call #t~ret4 := main(); {2099#true} is VALID [2018-11-23 11:55:33,901 INFO L273 TraceCheckUtils]: 5: Hoare triple {2099#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {2128#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:33,901 INFO L273 TraceCheckUtils]: 6: Hoare triple {2128#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2128#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:33,901 INFO L273 TraceCheckUtils]: 7: Hoare triple {2128#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2128#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:33,902 INFO L273 TraceCheckUtils]: 8: Hoare triple {2128#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {2102#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:33,902 INFO L273 TraceCheckUtils]: 9: Hoare triple {2102#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2102#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:33,902 INFO L273 TraceCheckUtils]: 10: Hoare triple {2102#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2102#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:33,903 INFO L273 TraceCheckUtils]: 11: Hoare triple {2102#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2103#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:33,903 INFO L273 TraceCheckUtils]: 12: Hoare triple {2103#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2103#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:33,904 INFO L273 TraceCheckUtils]: 13: Hoare triple {2103#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2103#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:33,905 INFO L273 TraceCheckUtils]: 14: Hoare triple {2103#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2104#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:33,905 INFO L273 TraceCheckUtils]: 15: Hoare triple {2104#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2104#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:33,906 INFO L273 TraceCheckUtils]: 16: Hoare triple {2104#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2104#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:33,907 INFO L273 TraceCheckUtils]: 17: Hoare triple {2104#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2105#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:33,907 INFO L273 TraceCheckUtils]: 18: Hoare triple {2105#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2105#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:33,908 INFO L273 TraceCheckUtils]: 19: Hoare triple {2105#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2105#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:33,909 INFO L273 TraceCheckUtils]: 20: Hoare triple {2105#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2106#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:33,909 INFO L273 TraceCheckUtils]: 21: Hoare triple {2106#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2106#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:33,910 INFO L273 TraceCheckUtils]: 22: Hoare triple {2106#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2106#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:33,911 INFO L273 TraceCheckUtils]: 23: Hoare triple {2106#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2107#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:33,911 INFO L273 TraceCheckUtils]: 24: Hoare triple {2107#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2107#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:33,912 INFO L273 TraceCheckUtils]: 25: Hoare triple {2107#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2107#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:33,913 INFO L273 TraceCheckUtils]: 26: Hoare triple {2107#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2108#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:33,913 INFO L273 TraceCheckUtils]: 27: Hoare triple {2108#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2108#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:33,914 INFO L273 TraceCheckUtils]: 28: Hoare triple {2108#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2108#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:33,914 INFO L273 TraceCheckUtils]: 29: Hoare triple {2108#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {2109#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:33,915 INFO L273 TraceCheckUtils]: 30: Hoare triple {2109#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2100#false} is VALID [2018-11-23 11:55:33,916 INFO L273 TraceCheckUtils]: 31: Hoare triple {2100#false} havoc ~x~0;~x~0 := 0; {2100#false} is VALID [2018-11-23 11:55:33,916 INFO L273 TraceCheckUtils]: 32: Hoare triple {2100#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2100#false} is VALID [2018-11-23 11:55:33,916 INFO L256 TraceCheckUtils]: 33: Hoare triple {2100#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {2100#false} is VALID [2018-11-23 11:55:33,916 INFO L273 TraceCheckUtils]: 34: Hoare triple {2100#false} ~cond := #in~cond; {2100#false} is VALID [2018-11-23 11:55:33,916 INFO L273 TraceCheckUtils]: 35: Hoare triple {2100#false} assume 0 == ~cond; {2100#false} is VALID [2018-11-23 11:55:33,917 INFO L273 TraceCheckUtils]: 36: Hoare triple {2100#false} assume !false; {2100#false} is VALID [2018-11-23 11:55:33,918 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:33,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:33,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 11:55:33,938 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-11-23 11:55:33,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:33,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:55:33,995 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:33,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:55:33,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:55:33,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:55:33,996 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 12 states. [2018-11-23 11:55:34,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:34,383 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2018-11-23 11:55:34,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:55:34,384 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-11-23 11:55:34,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:34,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:55:34,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 11:55:34,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:55:34,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 11:55:34,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 70 transitions. [2018-11-23 11:55:34,488 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:34,489 INFO L225 Difference]: With dead ends: 58 [2018-11-23 11:55:34,489 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 11:55:34,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:55:34,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 11:55:34,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-11-23 11:55:34,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:34,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 45 states. [2018-11-23 11:55:34,510 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 45 states. [2018-11-23 11:55:34,510 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 45 states. [2018-11-23 11:55:34,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:34,511 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2018-11-23 11:55:34,511 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2018-11-23 11:55:34,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:34,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:34,512 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 47 states. [2018-11-23 11:55:34,512 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 47 states. [2018-11-23 11:55:34,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:34,513 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2018-11-23 11:55:34,513 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2018-11-23 11:55:34,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:34,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:34,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:34,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:34,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 11:55:34,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2018-11-23 11:55:34,515 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 37 [2018-11-23 11:55:34,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:34,516 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2018-11-23 11:55:34,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:55:34,516 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2018-11-23 11:55:34,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 11:55:34,517 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:34,517 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:34,517 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:34,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:34,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1356145181, now seen corresponding path program 9 times [2018-11-23 11:55:34,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:34,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:34,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:34,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:34,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:34,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:34,753 INFO L256 TraceCheckUtils]: 0: Hoare triple {2455#true} call ULTIMATE.init(); {2455#true} is VALID [2018-11-23 11:55:34,753 INFO L273 TraceCheckUtils]: 1: Hoare triple {2455#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2455#true} is VALID [2018-11-23 11:55:34,753 INFO L273 TraceCheckUtils]: 2: Hoare triple {2455#true} assume true; {2455#true} is VALID [2018-11-23 11:55:34,754 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2455#true} {2455#true} #55#return; {2455#true} is VALID [2018-11-23 11:55:34,754 INFO L256 TraceCheckUtils]: 4: Hoare triple {2455#true} call #t~ret4 := main(); {2455#true} is VALID [2018-11-23 11:55:34,755 INFO L273 TraceCheckUtils]: 5: Hoare triple {2455#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {2457#(= main_~i~0 0)} is VALID [2018-11-23 11:55:34,755 INFO L273 TraceCheckUtils]: 6: Hoare triple {2457#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2457#(= main_~i~0 0)} is VALID [2018-11-23 11:55:34,756 INFO L273 TraceCheckUtils]: 7: Hoare triple {2457#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2457#(= main_~i~0 0)} is VALID [2018-11-23 11:55:34,757 INFO L273 TraceCheckUtils]: 8: Hoare triple {2457#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {2458#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:34,757 INFO L273 TraceCheckUtils]: 9: Hoare triple {2458#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2458#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:34,757 INFO L273 TraceCheckUtils]: 10: Hoare triple {2458#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2458#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:34,758 INFO L273 TraceCheckUtils]: 11: Hoare triple {2458#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2459#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:34,758 INFO L273 TraceCheckUtils]: 12: Hoare triple {2459#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2459#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:34,759 INFO L273 TraceCheckUtils]: 13: Hoare triple {2459#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2459#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:34,760 INFO L273 TraceCheckUtils]: 14: Hoare triple {2459#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2460#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:34,761 INFO L273 TraceCheckUtils]: 15: Hoare triple {2460#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2460#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:34,761 INFO L273 TraceCheckUtils]: 16: Hoare triple {2460#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2460#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:34,762 INFO L273 TraceCheckUtils]: 17: Hoare triple {2460#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2461#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:34,763 INFO L273 TraceCheckUtils]: 18: Hoare triple {2461#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2461#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:34,763 INFO L273 TraceCheckUtils]: 19: Hoare triple {2461#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2461#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:34,764 INFO L273 TraceCheckUtils]: 20: Hoare triple {2461#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2462#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:34,765 INFO L273 TraceCheckUtils]: 21: Hoare triple {2462#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2462#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:34,766 INFO L273 TraceCheckUtils]: 22: Hoare triple {2462#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2462#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:34,766 INFO L273 TraceCheckUtils]: 23: Hoare triple {2462#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2463#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:34,767 INFO L273 TraceCheckUtils]: 24: Hoare triple {2463#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2463#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:34,768 INFO L273 TraceCheckUtils]: 25: Hoare triple {2463#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2463#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:34,769 INFO L273 TraceCheckUtils]: 26: Hoare triple {2463#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2464#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:34,769 INFO L273 TraceCheckUtils]: 27: Hoare triple {2464#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2464#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:34,770 INFO L273 TraceCheckUtils]: 28: Hoare triple {2464#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2464#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:34,771 INFO L273 TraceCheckUtils]: 29: Hoare triple {2464#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {2465#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:34,771 INFO L273 TraceCheckUtils]: 30: Hoare triple {2465#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2465#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:34,772 INFO L273 TraceCheckUtils]: 31: Hoare triple {2465#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2465#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:34,773 INFO L273 TraceCheckUtils]: 32: Hoare triple {2465#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {2466#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:34,774 INFO L273 TraceCheckUtils]: 33: Hoare triple {2466#(<= main_~i~0 9)} assume !(~i~0 < 100000); {2456#false} is VALID [2018-11-23 11:55:34,774 INFO L273 TraceCheckUtils]: 34: Hoare triple {2456#false} havoc ~x~0;~x~0 := 0; {2456#false} is VALID [2018-11-23 11:55:34,774 INFO L273 TraceCheckUtils]: 35: Hoare triple {2456#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2456#false} is VALID [2018-11-23 11:55:34,775 INFO L256 TraceCheckUtils]: 36: Hoare triple {2456#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {2456#false} is VALID [2018-11-23 11:55:34,775 INFO L273 TraceCheckUtils]: 37: Hoare triple {2456#false} ~cond := #in~cond; {2456#false} is VALID [2018-11-23 11:55:34,775 INFO L273 TraceCheckUtils]: 38: Hoare triple {2456#false} assume 0 == ~cond; {2456#false} is VALID [2018-11-23 11:55:34,776 INFO L273 TraceCheckUtils]: 39: Hoare triple {2456#false} assume !false; {2456#false} is VALID [2018-11-23 11:55:34,779 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:34,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:34,779 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:34,788 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:55:34,819 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 11:55:34,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:34,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:34,954 INFO L256 TraceCheckUtils]: 0: Hoare triple {2455#true} call ULTIMATE.init(); {2455#true} is VALID [2018-11-23 11:55:34,955 INFO L273 TraceCheckUtils]: 1: Hoare triple {2455#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2455#true} is VALID [2018-11-23 11:55:34,955 INFO L273 TraceCheckUtils]: 2: Hoare triple {2455#true} assume true; {2455#true} is VALID [2018-11-23 11:55:34,955 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2455#true} {2455#true} #55#return; {2455#true} is VALID [2018-11-23 11:55:34,956 INFO L256 TraceCheckUtils]: 4: Hoare triple {2455#true} call #t~ret4 := main(); {2455#true} is VALID [2018-11-23 11:55:34,956 INFO L273 TraceCheckUtils]: 5: Hoare triple {2455#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {2485#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:34,957 INFO L273 TraceCheckUtils]: 6: Hoare triple {2485#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2485#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:34,957 INFO L273 TraceCheckUtils]: 7: Hoare triple {2485#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2485#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:34,958 INFO L273 TraceCheckUtils]: 8: Hoare triple {2485#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {2458#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:34,958 INFO L273 TraceCheckUtils]: 9: Hoare triple {2458#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2458#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:34,959 INFO L273 TraceCheckUtils]: 10: Hoare triple {2458#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2458#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:34,960 INFO L273 TraceCheckUtils]: 11: Hoare triple {2458#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2459#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:34,960 INFO L273 TraceCheckUtils]: 12: Hoare triple {2459#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2459#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:34,961 INFO L273 TraceCheckUtils]: 13: Hoare triple {2459#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2459#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:34,962 INFO L273 TraceCheckUtils]: 14: Hoare triple {2459#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2460#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:34,962 INFO L273 TraceCheckUtils]: 15: Hoare triple {2460#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2460#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:34,963 INFO L273 TraceCheckUtils]: 16: Hoare triple {2460#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2460#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:34,964 INFO L273 TraceCheckUtils]: 17: Hoare triple {2460#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2461#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:34,964 INFO L273 TraceCheckUtils]: 18: Hoare triple {2461#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2461#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:34,965 INFO L273 TraceCheckUtils]: 19: Hoare triple {2461#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2461#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:34,966 INFO L273 TraceCheckUtils]: 20: Hoare triple {2461#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2462#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:34,966 INFO L273 TraceCheckUtils]: 21: Hoare triple {2462#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2462#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:34,983 INFO L273 TraceCheckUtils]: 22: Hoare triple {2462#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2462#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:34,984 INFO L273 TraceCheckUtils]: 23: Hoare triple {2462#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2463#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:34,984 INFO L273 TraceCheckUtils]: 24: Hoare triple {2463#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2463#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:34,985 INFO L273 TraceCheckUtils]: 25: Hoare triple {2463#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2463#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:34,985 INFO L273 TraceCheckUtils]: 26: Hoare triple {2463#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2464#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:34,985 INFO L273 TraceCheckUtils]: 27: Hoare triple {2464#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2464#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:34,986 INFO L273 TraceCheckUtils]: 28: Hoare triple {2464#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2464#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:34,987 INFO L273 TraceCheckUtils]: 29: Hoare triple {2464#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {2465#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:34,987 INFO L273 TraceCheckUtils]: 30: Hoare triple {2465#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2465#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:34,988 INFO L273 TraceCheckUtils]: 31: Hoare triple {2465#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2465#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:34,988 INFO L273 TraceCheckUtils]: 32: Hoare triple {2465#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {2466#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:34,989 INFO L273 TraceCheckUtils]: 33: Hoare triple {2466#(<= main_~i~0 9)} assume !(~i~0 < 100000); {2456#false} is VALID [2018-11-23 11:55:34,989 INFO L273 TraceCheckUtils]: 34: Hoare triple {2456#false} havoc ~x~0;~x~0 := 0; {2456#false} is VALID [2018-11-23 11:55:34,990 INFO L273 TraceCheckUtils]: 35: Hoare triple {2456#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2456#false} is VALID [2018-11-23 11:55:34,990 INFO L256 TraceCheckUtils]: 36: Hoare triple {2456#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {2456#false} is VALID [2018-11-23 11:55:34,990 INFO L273 TraceCheckUtils]: 37: Hoare triple {2456#false} ~cond := #in~cond; {2456#false} is VALID [2018-11-23 11:55:34,990 INFO L273 TraceCheckUtils]: 38: Hoare triple {2456#false} assume 0 == ~cond; {2456#false} is VALID [2018-11-23 11:55:34,991 INFO L273 TraceCheckUtils]: 39: Hoare triple {2456#false} assume !false; {2456#false} is VALID [2018-11-23 11:55:34,993 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:35,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:35,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 11:55:35,013 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-11-23 11:55:35,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:35,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:55:35,056 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:35,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:55:35,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:55:35,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:55:35,057 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand 13 states. [2018-11-23 11:55:35,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:35,225 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2018-11-23 11:55:35,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:55:35,226 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-11-23 11:55:35,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:35,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:55:35,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 74 transitions. [2018-11-23 11:55:35,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:55:35,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 74 transitions. [2018-11-23 11:55:35,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 74 transitions. [2018-11-23 11:55:35,301 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:35,302 INFO L225 Difference]: With dead ends: 61 [2018-11-23 11:55:35,302 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 11:55:35,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:55:35,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 11:55:35,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-11-23 11:55:35,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:35,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 48 states. [2018-11-23 11:55:35,322 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 48 states. [2018-11-23 11:55:35,323 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 48 states. [2018-11-23 11:55:35,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:35,324 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2018-11-23 11:55:35,324 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2018-11-23 11:55:35,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:35,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:35,325 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 50 states. [2018-11-23 11:55:35,325 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 50 states. [2018-11-23 11:55:35,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:35,327 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2018-11-23 11:55:35,327 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2018-11-23 11:55:35,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:35,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:35,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:35,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:35,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:55:35,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2018-11-23 11:55:35,329 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 40 [2018-11-23 11:55:35,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:35,330 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2018-11-23 11:55:35,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:55:35,330 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2018-11-23 11:55:35,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 11:55:35,331 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:35,331 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:35,331 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:35,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:35,331 INFO L82 PathProgramCache]: Analyzing trace with hash 881632121, now seen corresponding path program 10 times [2018-11-23 11:55:35,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:35,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:35,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:35,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:35,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:35,717 INFO L256 TraceCheckUtils]: 0: Hoare triple {2835#true} call ULTIMATE.init(); {2835#true} is VALID [2018-11-23 11:55:35,717 INFO L273 TraceCheckUtils]: 1: Hoare triple {2835#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2835#true} is VALID [2018-11-23 11:55:35,718 INFO L273 TraceCheckUtils]: 2: Hoare triple {2835#true} assume true; {2835#true} is VALID [2018-11-23 11:55:35,718 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2835#true} {2835#true} #55#return; {2835#true} is VALID [2018-11-23 11:55:35,718 INFO L256 TraceCheckUtils]: 4: Hoare triple {2835#true} call #t~ret4 := main(); {2835#true} is VALID [2018-11-23 11:55:35,719 INFO L273 TraceCheckUtils]: 5: Hoare triple {2835#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {2837#(= main_~i~0 0)} is VALID [2018-11-23 11:55:35,719 INFO L273 TraceCheckUtils]: 6: Hoare triple {2837#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2837#(= main_~i~0 0)} is VALID [2018-11-23 11:55:35,719 INFO L273 TraceCheckUtils]: 7: Hoare triple {2837#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2837#(= main_~i~0 0)} is VALID [2018-11-23 11:55:35,720 INFO L273 TraceCheckUtils]: 8: Hoare triple {2837#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {2838#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:35,720 INFO L273 TraceCheckUtils]: 9: Hoare triple {2838#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2838#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:35,721 INFO L273 TraceCheckUtils]: 10: Hoare triple {2838#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2838#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:35,721 INFO L273 TraceCheckUtils]: 11: Hoare triple {2838#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2839#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:35,721 INFO L273 TraceCheckUtils]: 12: Hoare triple {2839#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2839#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:35,722 INFO L273 TraceCheckUtils]: 13: Hoare triple {2839#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2839#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:35,722 INFO L273 TraceCheckUtils]: 14: Hoare triple {2839#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2840#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:35,723 INFO L273 TraceCheckUtils]: 15: Hoare triple {2840#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2840#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:35,723 INFO L273 TraceCheckUtils]: 16: Hoare triple {2840#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2840#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:35,724 INFO L273 TraceCheckUtils]: 17: Hoare triple {2840#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2841#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:35,725 INFO L273 TraceCheckUtils]: 18: Hoare triple {2841#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2841#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:35,725 INFO L273 TraceCheckUtils]: 19: Hoare triple {2841#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2841#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:35,726 INFO L273 TraceCheckUtils]: 20: Hoare triple {2841#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2842#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:35,727 INFO L273 TraceCheckUtils]: 21: Hoare triple {2842#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2842#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:35,727 INFO L273 TraceCheckUtils]: 22: Hoare triple {2842#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2842#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:35,728 INFO L273 TraceCheckUtils]: 23: Hoare triple {2842#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2843#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:35,729 INFO L273 TraceCheckUtils]: 24: Hoare triple {2843#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2843#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:35,729 INFO L273 TraceCheckUtils]: 25: Hoare triple {2843#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2843#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:35,730 INFO L273 TraceCheckUtils]: 26: Hoare triple {2843#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2844#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:35,731 INFO L273 TraceCheckUtils]: 27: Hoare triple {2844#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2844#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:35,731 INFO L273 TraceCheckUtils]: 28: Hoare triple {2844#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2844#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:35,732 INFO L273 TraceCheckUtils]: 29: Hoare triple {2844#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {2845#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:35,732 INFO L273 TraceCheckUtils]: 30: Hoare triple {2845#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2845#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:35,733 INFO L273 TraceCheckUtils]: 31: Hoare triple {2845#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2845#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:35,734 INFO L273 TraceCheckUtils]: 32: Hoare triple {2845#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {2846#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:35,734 INFO L273 TraceCheckUtils]: 33: Hoare triple {2846#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2846#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:35,735 INFO L273 TraceCheckUtils]: 34: Hoare triple {2846#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2846#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:35,736 INFO L273 TraceCheckUtils]: 35: Hoare triple {2846#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {2847#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:35,736 INFO L273 TraceCheckUtils]: 36: Hoare triple {2847#(<= main_~i~0 10)} assume !(~i~0 < 100000); {2836#false} is VALID [2018-11-23 11:55:35,737 INFO L273 TraceCheckUtils]: 37: Hoare triple {2836#false} havoc ~x~0;~x~0 := 0; {2836#false} is VALID [2018-11-23 11:55:35,737 INFO L273 TraceCheckUtils]: 38: Hoare triple {2836#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2836#false} is VALID [2018-11-23 11:55:35,737 INFO L256 TraceCheckUtils]: 39: Hoare triple {2836#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {2836#false} is VALID [2018-11-23 11:55:35,737 INFO L273 TraceCheckUtils]: 40: Hoare triple {2836#false} ~cond := #in~cond; {2836#false} is VALID [2018-11-23 11:55:35,738 INFO L273 TraceCheckUtils]: 41: Hoare triple {2836#false} assume 0 == ~cond; {2836#false} is VALID [2018-11-23 11:55:35,738 INFO L273 TraceCheckUtils]: 42: Hoare triple {2836#false} assume !false; {2836#false} is VALID [2018-11-23 11:55:35,740 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 11:55:35,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:35,741 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:35,750 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:55:35,779 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:55:35,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:35,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:35,962 INFO L256 TraceCheckUtils]: 0: Hoare triple {2835#true} call ULTIMATE.init(); {2835#true} is VALID [2018-11-23 11:55:35,962 INFO L273 TraceCheckUtils]: 1: Hoare triple {2835#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2835#true} is VALID [2018-11-23 11:55:35,962 INFO L273 TraceCheckUtils]: 2: Hoare triple {2835#true} assume true; {2835#true} is VALID [2018-11-23 11:55:35,962 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2835#true} {2835#true} #55#return; {2835#true} is VALID [2018-11-23 11:55:35,963 INFO L256 TraceCheckUtils]: 4: Hoare triple {2835#true} call #t~ret4 := main(); {2835#true} is VALID [2018-11-23 11:55:35,963 INFO L273 TraceCheckUtils]: 5: Hoare triple {2835#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {2866#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:35,964 INFO L273 TraceCheckUtils]: 6: Hoare triple {2866#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2866#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:35,964 INFO L273 TraceCheckUtils]: 7: Hoare triple {2866#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2866#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:35,965 INFO L273 TraceCheckUtils]: 8: Hoare triple {2866#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {2838#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:35,965 INFO L273 TraceCheckUtils]: 9: Hoare triple {2838#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2838#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:35,965 INFO L273 TraceCheckUtils]: 10: Hoare triple {2838#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2838#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:35,966 INFO L273 TraceCheckUtils]: 11: Hoare triple {2838#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {2839#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:35,967 INFO L273 TraceCheckUtils]: 12: Hoare triple {2839#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2839#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:35,967 INFO L273 TraceCheckUtils]: 13: Hoare triple {2839#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2839#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:35,968 INFO L273 TraceCheckUtils]: 14: Hoare triple {2839#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {2840#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:35,969 INFO L273 TraceCheckUtils]: 15: Hoare triple {2840#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2840#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:35,969 INFO L273 TraceCheckUtils]: 16: Hoare triple {2840#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2840#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:35,970 INFO L273 TraceCheckUtils]: 17: Hoare triple {2840#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {2841#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:35,971 INFO L273 TraceCheckUtils]: 18: Hoare triple {2841#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2841#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:35,971 INFO L273 TraceCheckUtils]: 19: Hoare triple {2841#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2841#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:35,972 INFO L273 TraceCheckUtils]: 20: Hoare triple {2841#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {2842#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:35,973 INFO L273 TraceCheckUtils]: 21: Hoare triple {2842#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2842#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:35,973 INFO L273 TraceCheckUtils]: 22: Hoare triple {2842#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2842#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:35,974 INFO L273 TraceCheckUtils]: 23: Hoare triple {2842#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {2843#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:35,975 INFO L273 TraceCheckUtils]: 24: Hoare triple {2843#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2843#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:35,975 INFO L273 TraceCheckUtils]: 25: Hoare triple {2843#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2843#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:35,976 INFO L273 TraceCheckUtils]: 26: Hoare triple {2843#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {2844#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:35,976 INFO L273 TraceCheckUtils]: 27: Hoare triple {2844#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2844#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:35,977 INFO L273 TraceCheckUtils]: 28: Hoare triple {2844#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2844#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:35,978 INFO L273 TraceCheckUtils]: 29: Hoare triple {2844#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {2845#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:35,978 INFO L273 TraceCheckUtils]: 30: Hoare triple {2845#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2845#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:35,979 INFO L273 TraceCheckUtils]: 31: Hoare triple {2845#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2845#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:35,980 INFO L273 TraceCheckUtils]: 32: Hoare triple {2845#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {2846#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:35,980 INFO L273 TraceCheckUtils]: 33: Hoare triple {2846#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2846#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:35,981 INFO L273 TraceCheckUtils]: 34: Hoare triple {2846#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {2846#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:35,982 INFO L273 TraceCheckUtils]: 35: Hoare triple {2846#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {2847#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:35,982 INFO L273 TraceCheckUtils]: 36: Hoare triple {2847#(<= main_~i~0 10)} assume !(~i~0 < 100000); {2836#false} is VALID [2018-11-23 11:55:35,983 INFO L273 TraceCheckUtils]: 37: Hoare triple {2836#false} havoc ~x~0;~x~0 := 0; {2836#false} is VALID [2018-11-23 11:55:35,983 INFO L273 TraceCheckUtils]: 38: Hoare triple {2836#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2836#false} is VALID [2018-11-23 11:55:35,983 INFO L256 TraceCheckUtils]: 39: Hoare triple {2836#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {2836#false} is VALID [2018-11-23 11:55:35,983 INFO L273 TraceCheckUtils]: 40: Hoare triple {2836#false} ~cond := #in~cond; {2836#false} is VALID [2018-11-23 11:55:35,983 INFO L273 TraceCheckUtils]: 41: Hoare triple {2836#false} assume 0 == ~cond; {2836#false} is VALID [2018-11-23 11:55:35,984 INFO L273 TraceCheckUtils]: 42: Hoare triple {2836#false} assume !false; {2836#false} is VALID [2018-11-23 11:55:35,986 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 11:55:36,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:36,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 11:55:36,006 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-11-23 11:55:36,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:36,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:55:36,055 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:36,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:55:36,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:55:36,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:55:36,056 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand 14 states. [2018-11-23 11:55:36,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:36,300 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2018-11-23 11:55:36,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:55:36,300 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-11-23 11:55:36,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:36,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:55:36,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2018-11-23 11:55:36,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:55:36,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2018-11-23 11:55:36,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 78 transitions. [2018-11-23 11:55:36,404 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:36,406 INFO L225 Difference]: With dead ends: 64 [2018-11-23 11:55:36,406 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 11:55:36,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:55:36,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 11:55:36,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-11-23 11:55:36,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:36,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 51 states. [2018-11-23 11:55:36,427 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 51 states. [2018-11-23 11:55:36,427 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 51 states. [2018-11-23 11:55:36,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:36,429 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2018-11-23 11:55:36,429 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2018-11-23 11:55:36,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:36,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:36,429 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 53 states. [2018-11-23 11:55:36,429 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 53 states. [2018-11-23 11:55:36,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:36,431 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2018-11-23 11:55:36,431 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2018-11-23 11:55:36,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:36,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:36,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:36,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:36,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 11:55:36,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2018-11-23 11:55:36,433 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 43 [2018-11-23 11:55:36,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:36,433 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2018-11-23 11:55:36,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:55:36,434 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2018-11-23 11:55:36,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 11:55:36,434 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:36,434 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:36,434 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:36,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:36,435 INFO L82 PathProgramCache]: Analyzing trace with hash 22867491, now seen corresponding path program 11 times [2018-11-23 11:55:36,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:36,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:36,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:36,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:36,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:36,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:36,638 INFO L256 TraceCheckUtils]: 0: Hoare triple {3239#true} call ULTIMATE.init(); {3239#true} is VALID [2018-11-23 11:55:36,638 INFO L273 TraceCheckUtils]: 1: Hoare triple {3239#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3239#true} is VALID [2018-11-23 11:55:36,639 INFO L273 TraceCheckUtils]: 2: Hoare triple {3239#true} assume true; {3239#true} is VALID [2018-11-23 11:55:36,639 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3239#true} {3239#true} #55#return; {3239#true} is VALID [2018-11-23 11:55:36,639 INFO L256 TraceCheckUtils]: 4: Hoare triple {3239#true} call #t~ret4 := main(); {3239#true} is VALID [2018-11-23 11:55:36,640 INFO L273 TraceCheckUtils]: 5: Hoare triple {3239#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {3241#(= main_~i~0 0)} is VALID [2018-11-23 11:55:36,640 INFO L273 TraceCheckUtils]: 6: Hoare triple {3241#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3241#(= main_~i~0 0)} is VALID [2018-11-23 11:55:36,641 INFO L273 TraceCheckUtils]: 7: Hoare triple {3241#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3241#(= main_~i~0 0)} is VALID [2018-11-23 11:55:36,642 INFO L273 TraceCheckUtils]: 8: Hoare triple {3241#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {3242#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:36,642 INFO L273 TraceCheckUtils]: 9: Hoare triple {3242#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3242#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:36,643 INFO L273 TraceCheckUtils]: 10: Hoare triple {3242#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3242#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:36,644 INFO L273 TraceCheckUtils]: 11: Hoare triple {3242#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {3243#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:36,644 INFO L273 TraceCheckUtils]: 12: Hoare triple {3243#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3243#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:36,645 INFO L273 TraceCheckUtils]: 13: Hoare triple {3243#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3243#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:36,645 INFO L273 TraceCheckUtils]: 14: Hoare triple {3243#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {3244#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:36,646 INFO L273 TraceCheckUtils]: 15: Hoare triple {3244#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3244#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:36,647 INFO L273 TraceCheckUtils]: 16: Hoare triple {3244#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3244#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:36,647 INFO L273 TraceCheckUtils]: 17: Hoare triple {3244#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {3245#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:36,648 INFO L273 TraceCheckUtils]: 18: Hoare triple {3245#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3245#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:36,648 INFO L273 TraceCheckUtils]: 19: Hoare triple {3245#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3245#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:36,649 INFO L273 TraceCheckUtils]: 20: Hoare triple {3245#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {3246#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:36,650 INFO L273 TraceCheckUtils]: 21: Hoare triple {3246#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3246#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:36,650 INFO L273 TraceCheckUtils]: 22: Hoare triple {3246#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3246#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:36,651 INFO L273 TraceCheckUtils]: 23: Hoare triple {3246#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {3247#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:36,652 INFO L273 TraceCheckUtils]: 24: Hoare triple {3247#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3247#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:36,652 INFO L273 TraceCheckUtils]: 25: Hoare triple {3247#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3247#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:36,653 INFO L273 TraceCheckUtils]: 26: Hoare triple {3247#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {3248#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:36,653 INFO L273 TraceCheckUtils]: 27: Hoare triple {3248#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3248#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:36,654 INFO L273 TraceCheckUtils]: 28: Hoare triple {3248#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3248#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:36,655 INFO L273 TraceCheckUtils]: 29: Hoare triple {3248#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {3249#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:36,655 INFO L273 TraceCheckUtils]: 30: Hoare triple {3249#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3249#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:36,656 INFO L273 TraceCheckUtils]: 31: Hoare triple {3249#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3249#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:36,657 INFO L273 TraceCheckUtils]: 32: Hoare triple {3249#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {3250#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:36,657 INFO L273 TraceCheckUtils]: 33: Hoare triple {3250#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3250#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:36,658 INFO L273 TraceCheckUtils]: 34: Hoare triple {3250#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3250#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:36,658 INFO L273 TraceCheckUtils]: 35: Hoare triple {3250#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {3251#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:36,659 INFO L273 TraceCheckUtils]: 36: Hoare triple {3251#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3251#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:36,660 INFO L273 TraceCheckUtils]: 37: Hoare triple {3251#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3251#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:36,660 INFO L273 TraceCheckUtils]: 38: Hoare triple {3251#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {3252#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:36,661 INFO L273 TraceCheckUtils]: 39: Hoare triple {3252#(<= main_~i~0 11)} assume !(~i~0 < 100000); {3240#false} is VALID [2018-11-23 11:55:36,661 INFO L273 TraceCheckUtils]: 40: Hoare triple {3240#false} havoc ~x~0;~x~0 := 0; {3240#false} is VALID [2018-11-23 11:55:36,661 INFO L273 TraceCheckUtils]: 41: Hoare triple {3240#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3240#false} is VALID [2018-11-23 11:55:36,662 INFO L256 TraceCheckUtils]: 42: Hoare triple {3240#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {3240#false} is VALID [2018-11-23 11:55:36,662 INFO L273 TraceCheckUtils]: 43: Hoare triple {3240#false} ~cond := #in~cond; {3240#false} is VALID [2018-11-23 11:55:36,662 INFO L273 TraceCheckUtils]: 44: Hoare triple {3240#false} assume 0 == ~cond; {3240#false} is VALID [2018-11-23 11:55:36,663 INFO L273 TraceCheckUtils]: 45: Hoare triple {3240#false} assume !false; {3240#false} is VALID [2018-11-23 11:55:36,665 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:36,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:36,665 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:36,681 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:55:36,731 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 11:55:36,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:36,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:36,880 INFO L256 TraceCheckUtils]: 0: Hoare triple {3239#true} call ULTIMATE.init(); {3239#true} is VALID [2018-11-23 11:55:36,881 INFO L273 TraceCheckUtils]: 1: Hoare triple {3239#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3239#true} is VALID [2018-11-23 11:55:36,881 INFO L273 TraceCheckUtils]: 2: Hoare triple {3239#true} assume true; {3239#true} is VALID [2018-11-23 11:55:36,881 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3239#true} {3239#true} #55#return; {3239#true} is VALID [2018-11-23 11:55:36,882 INFO L256 TraceCheckUtils]: 4: Hoare triple {3239#true} call #t~ret4 := main(); {3239#true} is VALID [2018-11-23 11:55:36,885 INFO L273 TraceCheckUtils]: 5: Hoare triple {3239#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {3271#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:36,885 INFO L273 TraceCheckUtils]: 6: Hoare triple {3271#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3271#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:36,886 INFO L273 TraceCheckUtils]: 7: Hoare triple {3271#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3271#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:36,886 INFO L273 TraceCheckUtils]: 8: Hoare triple {3271#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {3242#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:36,887 INFO L273 TraceCheckUtils]: 9: Hoare triple {3242#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3242#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:36,887 INFO L273 TraceCheckUtils]: 10: Hoare triple {3242#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3242#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:36,887 INFO L273 TraceCheckUtils]: 11: Hoare triple {3242#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {3243#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:36,888 INFO L273 TraceCheckUtils]: 12: Hoare triple {3243#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3243#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:36,888 INFO L273 TraceCheckUtils]: 13: Hoare triple {3243#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3243#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:36,889 INFO L273 TraceCheckUtils]: 14: Hoare triple {3243#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {3244#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:36,889 INFO L273 TraceCheckUtils]: 15: Hoare triple {3244#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3244#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:36,890 INFO L273 TraceCheckUtils]: 16: Hoare triple {3244#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3244#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:36,890 INFO L273 TraceCheckUtils]: 17: Hoare triple {3244#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {3245#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:36,891 INFO L273 TraceCheckUtils]: 18: Hoare triple {3245#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3245#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:36,892 INFO L273 TraceCheckUtils]: 19: Hoare triple {3245#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3245#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:36,892 INFO L273 TraceCheckUtils]: 20: Hoare triple {3245#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {3246#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:36,893 INFO L273 TraceCheckUtils]: 21: Hoare triple {3246#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3246#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:36,893 INFO L273 TraceCheckUtils]: 22: Hoare triple {3246#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3246#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:36,894 INFO L273 TraceCheckUtils]: 23: Hoare triple {3246#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {3247#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:36,895 INFO L273 TraceCheckUtils]: 24: Hoare triple {3247#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3247#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:36,895 INFO L273 TraceCheckUtils]: 25: Hoare triple {3247#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3247#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:36,896 INFO L273 TraceCheckUtils]: 26: Hoare triple {3247#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {3248#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:36,897 INFO L273 TraceCheckUtils]: 27: Hoare triple {3248#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3248#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:36,897 INFO L273 TraceCheckUtils]: 28: Hoare triple {3248#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3248#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:36,898 INFO L273 TraceCheckUtils]: 29: Hoare triple {3248#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {3249#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:36,899 INFO L273 TraceCheckUtils]: 30: Hoare triple {3249#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3249#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:36,899 INFO L273 TraceCheckUtils]: 31: Hoare triple {3249#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3249#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:36,900 INFO L273 TraceCheckUtils]: 32: Hoare triple {3249#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {3250#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:36,900 INFO L273 TraceCheckUtils]: 33: Hoare triple {3250#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3250#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:36,901 INFO L273 TraceCheckUtils]: 34: Hoare triple {3250#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3250#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:36,902 INFO L273 TraceCheckUtils]: 35: Hoare triple {3250#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {3251#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:36,902 INFO L273 TraceCheckUtils]: 36: Hoare triple {3251#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3251#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:36,903 INFO L273 TraceCheckUtils]: 37: Hoare triple {3251#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3251#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:36,904 INFO L273 TraceCheckUtils]: 38: Hoare triple {3251#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {3252#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:36,904 INFO L273 TraceCheckUtils]: 39: Hoare triple {3252#(<= main_~i~0 11)} assume !(~i~0 < 100000); {3240#false} is VALID [2018-11-23 11:55:36,905 INFO L273 TraceCheckUtils]: 40: Hoare triple {3240#false} havoc ~x~0;~x~0 := 0; {3240#false} is VALID [2018-11-23 11:55:36,905 INFO L273 TraceCheckUtils]: 41: Hoare triple {3240#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3240#false} is VALID [2018-11-23 11:55:36,905 INFO L256 TraceCheckUtils]: 42: Hoare triple {3240#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {3240#false} is VALID [2018-11-23 11:55:36,905 INFO L273 TraceCheckUtils]: 43: Hoare triple {3240#false} ~cond := #in~cond; {3240#false} is VALID [2018-11-23 11:55:36,906 INFO L273 TraceCheckUtils]: 44: Hoare triple {3240#false} assume 0 == ~cond; {3240#false} is VALID [2018-11-23 11:55:36,906 INFO L273 TraceCheckUtils]: 45: Hoare triple {3240#false} assume !false; {3240#false} is VALID [2018-11-23 11:55:36,908 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:36,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:36,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 11:55:36,928 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-11-23 11:55:36,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:36,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:55:36,984 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:36,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:55:36,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:55:36,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:55:36,986 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand 15 states. [2018-11-23 11:55:37,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:37,317 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2018-11-23 11:55:37,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:55:37,318 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-11-23 11:55:37,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:37,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:55:37,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 82 transitions. [2018-11-23 11:55:37,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:55:37,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 82 transitions. [2018-11-23 11:55:37,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 82 transitions. [2018-11-23 11:55:37,445 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:37,446 INFO L225 Difference]: With dead ends: 67 [2018-11-23 11:55:37,446 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 11:55:37,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:55:37,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 11:55:37,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-11-23 11:55:37,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:37,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 54 states. [2018-11-23 11:55:37,484 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 54 states. [2018-11-23 11:55:37,484 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 54 states. [2018-11-23 11:55:37,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:37,486 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2018-11-23 11:55:37,486 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2018-11-23 11:55:37,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:37,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:37,486 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 56 states. [2018-11-23 11:55:37,487 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 56 states. [2018-11-23 11:55:37,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:37,488 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2018-11-23 11:55:37,488 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2018-11-23 11:55:37,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:37,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:37,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:37,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:37,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 11:55:37,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2018-11-23 11:55:37,489 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 46 [2018-11-23 11:55:37,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:37,490 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2018-11-23 11:55:37,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:55:37,490 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2018-11-23 11:55:37,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 11:55:37,490 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:37,490 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:37,491 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:37,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:37,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1685957433, now seen corresponding path program 12 times [2018-11-23 11:55:37,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:37,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:37,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:37,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:37,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:38,285 INFO L256 TraceCheckUtils]: 0: Hoare triple {3667#true} call ULTIMATE.init(); {3667#true} is VALID [2018-11-23 11:55:38,285 INFO L273 TraceCheckUtils]: 1: Hoare triple {3667#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3667#true} is VALID [2018-11-23 11:55:38,285 INFO L273 TraceCheckUtils]: 2: Hoare triple {3667#true} assume true; {3667#true} is VALID [2018-11-23 11:55:38,286 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3667#true} {3667#true} #55#return; {3667#true} is VALID [2018-11-23 11:55:38,286 INFO L256 TraceCheckUtils]: 4: Hoare triple {3667#true} call #t~ret4 := main(); {3667#true} is VALID [2018-11-23 11:55:38,290 INFO L273 TraceCheckUtils]: 5: Hoare triple {3667#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {3669#(= main_~i~0 0)} is VALID [2018-11-23 11:55:38,291 INFO L273 TraceCheckUtils]: 6: Hoare triple {3669#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3669#(= main_~i~0 0)} is VALID [2018-11-23 11:55:38,292 INFO L273 TraceCheckUtils]: 7: Hoare triple {3669#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3669#(= main_~i~0 0)} is VALID [2018-11-23 11:55:38,292 INFO L273 TraceCheckUtils]: 8: Hoare triple {3669#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {3670#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:38,294 INFO L273 TraceCheckUtils]: 9: Hoare triple {3670#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3670#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:38,294 INFO L273 TraceCheckUtils]: 10: Hoare triple {3670#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3670#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:38,296 INFO L273 TraceCheckUtils]: 11: Hoare triple {3670#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {3671#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:38,296 INFO L273 TraceCheckUtils]: 12: Hoare triple {3671#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3671#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:38,298 INFO L273 TraceCheckUtils]: 13: Hoare triple {3671#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3671#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:38,298 INFO L273 TraceCheckUtils]: 14: Hoare triple {3671#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {3672#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:38,300 INFO L273 TraceCheckUtils]: 15: Hoare triple {3672#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3672#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:38,300 INFO L273 TraceCheckUtils]: 16: Hoare triple {3672#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3672#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:38,303 INFO L273 TraceCheckUtils]: 17: Hoare triple {3672#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {3673#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:38,303 INFO L273 TraceCheckUtils]: 18: Hoare triple {3673#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3673#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:38,305 INFO L273 TraceCheckUtils]: 19: Hoare triple {3673#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3673#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:38,305 INFO L273 TraceCheckUtils]: 20: Hoare triple {3673#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {3674#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:38,308 INFO L273 TraceCheckUtils]: 21: Hoare triple {3674#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3674#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:38,308 INFO L273 TraceCheckUtils]: 22: Hoare triple {3674#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3674#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:38,310 INFO L273 TraceCheckUtils]: 23: Hoare triple {3674#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {3675#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:38,310 INFO L273 TraceCheckUtils]: 24: Hoare triple {3675#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3675#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:38,313 INFO L273 TraceCheckUtils]: 25: Hoare triple {3675#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3675#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:38,313 INFO L273 TraceCheckUtils]: 26: Hoare triple {3675#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {3676#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:38,315 INFO L273 TraceCheckUtils]: 27: Hoare triple {3676#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3676#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:38,315 INFO L273 TraceCheckUtils]: 28: Hoare triple {3676#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3676#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:38,316 INFO L273 TraceCheckUtils]: 29: Hoare triple {3676#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {3677#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:38,316 INFO L273 TraceCheckUtils]: 30: Hoare triple {3677#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3677#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:38,316 INFO L273 TraceCheckUtils]: 31: Hoare triple {3677#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3677#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:38,317 INFO L273 TraceCheckUtils]: 32: Hoare triple {3677#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {3678#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:38,317 INFO L273 TraceCheckUtils]: 33: Hoare triple {3678#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3678#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:38,318 INFO L273 TraceCheckUtils]: 34: Hoare triple {3678#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3678#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:38,318 INFO L273 TraceCheckUtils]: 35: Hoare triple {3678#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {3679#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:38,319 INFO L273 TraceCheckUtils]: 36: Hoare triple {3679#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3679#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:38,319 INFO L273 TraceCheckUtils]: 37: Hoare triple {3679#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3679#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:38,320 INFO L273 TraceCheckUtils]: 38: Hoare triple {3679#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {3680#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:38,321 INFO L273 TraceCheckUtils]: 39: Hoare triple {3680#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3680#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:38,322 INFO L273 TraceCheckUtils]: 40: Hoare triple {3680#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3680#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:38,322 INFO L273 TraceCheckUtils]: 41: Hoare triple {3680#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {3681#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:38,323 INFO L273 TraceCheckUtils]: 42: Hoare triple {3681#(<= main_~i~0 12)} assume !(~i~0 < 100000); {3668#false} is VALID [2018-11-23 11:55:38,323 INFO L273 TraceCheckUtils]: 43: Hoare triple {3668#false} havoc ~x~0;~x~0 := 0; {3668#false} is VALID [2018-11-23 11:55:38,324 INFO L273 TraceCheckUtils]: 44: Hoare triple {3668#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3668#false} is VALID [2018-11-23 11:55:38,324 INFO L256 TraceCheckUtils]: 45: Hoare triple {3668#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {3668#false} is VALID [2018-11-23 11:55:38,324 INFO L273 TraceCheckUtils]: 46: Hoare triple {3668#false} ~cond := #in~cond; {3668#false} is VALID [2018-11-23 11:55:38,325 INFO L273 TraceCheckUtils]: 47: Hoare triple {3668#false} assume 0 == ~cond; {3668#false} is VALID [2018-11-23 11:55:38,325 INFO L273 TraceCheckUtils]: 48: Hoare triple {3668#false} assume !false; {3668#false} is VALID [2018-11-23 11:55:38,330 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:38,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:38,330 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:38,341 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:55:38,370 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 11:55:38,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:38,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:38,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:38,531 INFO L256 TraceCheckUtils]: 0: Hoare triple {3667#true} call ULTIMATE.init(); {3667#true} is VALID [2018-11-23 11:55:38,532 INFO L273 TraceCheckUtils]: 1: Hoare triple {3667#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3667#true} is VALID [2018-11-23 11:55:38,532 INFO L273 TraceCheckUtils]: 2: Hoare triple {3667#true} assume true; {3667#true} is VALID [2018-11-23 11:55:38,532 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3667#true} {3667#true} #55#return; {3667#true} is VALID [2018-11-23 11:55:38,533 INFO L256 TraceCheckUtils]: 4: Hoare triple {3667#true} call #t~ret4 := main(); {3667#true} is VALID [2018-11-23 11:55:38,533 INFO L273 TraceCheckUtils]: 5: Hoare triple {3667#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {3700#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:38,534 INFO L273 TraceCheckUtils]: 6: Hoare triple {3700#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3700#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:38,535 INFO L273 TraceCheckUtils]: 7: Hoare triple {3700#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3700#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:38,535 INFO L273 TraceCheckUtils]: 8: Hoare triple {3700#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {3670#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:38,536 INFO L273 TraceCheckUtils]: 9: Hoare triple {3670#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3670#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:38,536 INFO L273 TraceCheckUtils]: 10: Hoare triple {3670#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3670#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:38,536 INFO L273 TraceCheckUtils]: 11: Hoare triple {3670#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {3671#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:38,537 INFO L273 TraceCheckUtils]: 12: Hoare triple {3671#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3671#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:38,538 INFO L273 TraceCheckUtils]: 13: Hoare triple {3671#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3671#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:38,539 INFO L273 TraceCheckUtils]: 14: Hoare triple {3671#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {3672#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:38,539 INFO L273 TraceCheckUtils]: 15: Hoare triple {3672#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3672#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:38,540 INFO L273 TraceCheckUtils]: 16: Hoare triple {3672#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3672#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:38,541 INFO L273 TraceCheckUtils]: 17: Hoare triple {3672#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {3673#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:38,541 INFO L273 TraceCheckUtils]: 18: Hoare triple {3673#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3673#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:38,542 INFO L273 TraceCheckUtils]: 19: Hoare triple {3673#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3673#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:38,562 INFO L273 TraceCheckUtils]: 20: Hoare triple {3673#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {3674#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:38,575 INFO L273 TraceCheckUtils]: 21: Hoare triple {3674#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3674#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:38,584 INFO L273 TraceCheckUtils]: 22: Hoare triple {3674#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3674#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:38,597 INFO L273 TraceCheckUtils]: 23: Hoare triple {3674#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {3675#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:38,606 INFO L273 TraceCheckUtils]: 24: Hoare triple {3675#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3675#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:38,615 INFO L273 TraceCheckUtils]: 25: Hoare triple {3675#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3675#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:38,634 INFO L273 TraceCheckUtils]: 26: Hoare triple {3675#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {3676#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:38,643 INFO L273 TraceCheckUtils]: 27: Hoare triple {3676#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3676#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:38,651 INFO L273 TraceCheckUtils]: 28: Hoare triple {3676#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3676#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:38,652 INFO L273 TraceCheckUtils]: 29: Hoare triple {3676#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {3677#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:38,653 INFO L273 TraceCheckUtils]: 30: Hoare triple {3677#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3677#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:38,655 INFO L273 TraceCheckUtils]: 31: Hoare triple {3677#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3677#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:38,655 INFO L273 TraceCheckUtils]: 32: Hoare triple {3677#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {3678#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:38,657 INFO L273 TraceCheckUtils]: 33: Hoare triple {3678#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3678#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:38,657 INFO L273 TraceCheckUtils]: 34: Hoare triple {3678#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3678#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:38,659 INFO L273 TraceCheckUtils]: 35: Hoare triple {3678#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {3679#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:38,659 INFO L273 TraceCheckUtils]: 36: Hoare triple {3679#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3679#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:38,659 INFO L273 TraceCheckUtils]: 37: Hoare triple {3679#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3679#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:38,660 INFO L273 TraceCheckUtils]: 38: Hoare triple {3679#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {3680#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:38,660 INFO L273 TraceCheckUtils]: 39: Hoare triple {3680#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3680#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:38,661 INFO L273 TraceCheckUtils]: 40: Hoare triple {3680#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {3680#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:38,661 INFO L273 TraceCheckUtils]: 41: Hoare triple {3680#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {3681#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:38,662 INFO L273 TraceCheckUtils]: 42: Hoare triple {3681#(<= main_~i~0 12)} assume !(~i~0 < 100000); {3668#false} is VALID [2018-11-23 11:55:38,662 INFO L273 TraceCheckUtils]: 43: Hoare triple {3668#false} havoc ~x~0;~x~0 := 0; {3668#false} is VALID [2018-11-23 11:55:38,662 INFO L273 TraceCheckUtils]: 44: Hoare triple {3668#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3668#false} is VALID [2018-11-23 11:55:38,662 INFO L256 TraceCheckUtils]: 45: Hoare triple {3668#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {3668#false} is VALID [2018-11-23 11:55:38,662 INFO L273 TraceCheckUtils]: 46: Hoare triple {3668#false} ~cond := #in~cond; {3668#false} is VALID [2018-11-23 11:55:38,663 INFO L273 TraceCheckUtils]: 47: Hoare triple {3668#false} assume 0 == ~cond; {3668#false} is VALID [2018-11-23 11:55:38,663 INFO L273 TraceCheckUtils]: 48: Hoare triple {3668#false} assume !false; {3668#false} is VALID [2018-11-23 11:55:38,667 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:38,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:38,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 11:55:38,688 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-11-23 11:55:38,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:38,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:55:38,753 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:38,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:55:38,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:55:38,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:55:38,755 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand 16 states. [2018-11-23 11:55:39,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:39,102 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2018-11-23 11:55:39,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 11:55:39,103 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-11-23 11:55:39,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:39,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:55:39,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 86 transitions. [2018-11-23 11:55:39,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:55:39,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 86 transitions. [2018-11-23 11:55:39,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 86 transitions. [2018-11-23 11:55:39,752 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:39,753 INFO L225 Difference]: With dead ends: 70 [2018-11-23 11:55:39,753 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 11:55:39,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:55:39,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 11:55:39,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-11-23 11:55:39,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:39,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 57 states. [2018-11-23 11:55:39,773 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 57 states. [2018-11-23 11:55:39,773 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 57 states. [2018-11-23 11:55:39,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:39,775 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2018-11-23 11:55:39,775 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2018-11-23 11:55:39,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:39,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:39,775 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 59 states. [2018-11-23 11:55:39,775 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 59 states. [2018-11-23 11:55:39,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:39,777 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2018-11-23 11:55:39,777 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2018-11-23 11:55:39,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:39,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:39,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:39,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:39,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 11:55:39,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2018-11-23 11:55:39,779 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 71 transitions. Word has length 49 [2018-11-23 11:55:39,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:39,779 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 71 transitions. [2018-11-23 11:55:39,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:55:39,780 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2018-11-23 11:55:39,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 11:55:39,780 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:39,781 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:39,781 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:39,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:39,781 INFO L82 PathProgramCache]: Analyzing trace with hash 55692899, now seen corresponding path program 13 times [2018-11-23 11:55:39,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:39,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:39,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:39,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:39,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:40,516 INFO L256 TraceCheckUtils]: 0: Hoare triple {4119#true} call ULTIMATE.init(); {4119#true} is VALID [2018-11-23 11:55:40,516 INFO L273 TraceCheckUtils]: 1: Hoare triple {4119#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4119#true} is VALID [2018-11-23 11:55:40,516 INFO L273 TraceCheckUtils]: 2: Hoare triple {4119#true} assume true; {4119#true} is VALID [2018-11-23 11:55:40,517 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4119#true} {4119#true} #55#return; {4119#true} is VALID [2018-11-23 11:55:40,517 INFO L256 TraceCheckUtils]: 4: Hoare triple {4119#true} call #t~ret4 := main(); {4119#true} is VALID [2018-11-23 11:55:40,517 INFO L273 TraceCheckUtils]: 5: Hoare triple {4119#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {4121#(= main_~i~0 0)} is VALID [2018-11-23 11:55:40,518 INFO L273 TraceCheckUtils]: 6: Hoare triple {4121#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4121#(= main_~i~0 0)} is VALID [2018-11-23 11:55:40,518 INFO L273 TraceCheckUtils]: 7: Hoare triple {4121#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4121#(= main_~i~0 0)} is VALID [2018-11-23 11:55:40,519 INFO L273 TraceCheckUtils]: 8: Hoare triple {4121#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {4122#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:40,519 INFO L273 TraceCheckUtils]: 9: Hoare triple {4122#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4122#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:40,519 INFO L273 TraceCheckUtils]: 10: Hoare triple {4122#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4122#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:40,520 INFO L273 TraceCheckUtils]: 11: Hoare triple {4122#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {4123#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:40,520 INFO L273 TraceCheckUtils]: 12: Hoare triple {4123#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4123#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:40,521 INFO L273 TraceCheckUtils]: 13: Hoare triple {4123#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4123#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:40,522 INFO L273 TraceCheckUtils]: 14: Hoare triple {4123#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {4124#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:40,522 INFO L273 TraceCheckUtils]: 15: Hoare triple {4124#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4124#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:40,523 INFO L273 TraceCheckUtils]: 16: Hoare triple {4124#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4124#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:40,524 INFO L273 TraceCheckUtils]: 17: Hoare triple {4124#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {4125#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:40,524 INFO L273 TraceCheckUtils]: 18: Hoare triple {4125#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4125#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:40,525 INFO L273 TraceCheckUtils]: 19: Hoare triple {4125#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4125#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:40,526 INFO L273 TraceCheckUtils]: 20: Hoare triple {4125#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {4126#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:40,526 INFO L273 TraceCheckUtils]: 21: Hoare triple {4126#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4126#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:40,527 INFO L273 TraceCheckUtils]: 22: Hoare triple {4126#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4126#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:40,528 INFO L273 TraceCheckUtils]: 23: Hoare triple {4126#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {4127#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:40,528 INFO L273 TraceCheckUtils]: 24: Hoare triple {4127#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4127#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:40,529 INFO L273 TraceCheckUtils]: 25: Hoare triple {4127#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4127#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:40,530 INFO L273 TraceCheckUtils]: 26: Hoare triple {4127#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {4128#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:40,530 INFO L273 TraceCheckUtils]: 27: Hoare triple {4128#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4128#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:40,531 INFO L273 TraceCheckUtils]: 28: Hoare triple {4128#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4128#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:40,532 INFO L273 TraceCheckUtils]: 29: Hoare triple {4128#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {4129#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:40,532 INFO L273 TraceCheckUtils]: 30: Hoare triple {4129#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4129#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:40,533 INFO L273 TraceCheckUtils]: 31: Hoare triple {4129#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4129#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:40,534 INFO L273 TraceCheckUtils]: 32: Hoare triple {4129#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {4130#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:40,534 INFO L273 TraceCheckUtils]: 33: Hoare triple {4130#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4130#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:40,535 INFO L273 TraceCheckUtils]: 34: Hoare triple {4130#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4130#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:40,536 INFO L273 TraceCheckUtils]: 35: Hoare triple {4130#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {4131#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:40,536 INFO L273 TraceCheckUtils]: 36: Hoare triple {4131#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4131#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:40,537 INFO L273 TraceCheckUtils]: 37: Hoare triple {4131#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4131#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:40,538 INFO L273 TraceCheckUtils]: 38: Hoare triple {4131#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {4132#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:40,538 INFO L273 TraceCheckUtils]: 39: Hoare triple {4132#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4132#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:40,539 INFO L273 TraceCheckUtils]: 40: Hoare triple {4132#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4132#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:40,540 INFO L273 TraceCheckUtils]: 41: Hoare triple {4132#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {4133#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:40,540 INFO L273 TraceCheckUtils]: 42: Hoare triple {4133#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4133#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:40,541 INFO L273 TraceCheckUtils]: 43: Hoare triple {4133#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4133#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:40,542 INFO L273 TraceCheckUtils]: 44: Hoare triple {4133#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {4134#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:40,543 INFO L273 TraceCheckUtils]: 45: Hoare triple {4134#(<= main_~i~0 13)} assume !(~i~0 < 100000); {4120#false} is VALID [2018-11-23 11:55:40,543 INFO L273 TraceCheckUtils]: 46: Hoare triple {4120#false} havoc ~x~0;~x~0 := 0; {4120#false} is VALID [2018-11-23 11:55:40,543 INFO L273 TraceCheckUtils]: 47: Hoare triple {4120#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4120#false} is VALID [2018-11-23 11:55:40,543 INFO L256 TraceCheckUtils]: 48: Hoare triple {4120#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {4120#false} is VALID [2018-11-23 11:55:40,544 INFO L273 TraceCheckUtils]: 49: Hoare triple {4120#false} ~cond := #in~cond; {4120#false} is VALID [2018-11-23 11:55:40,544 INFO L273 TraceCheckUtils]: 50: Hoare triple {4120#false} assume 0 == ~cond; {4120#false} is VALID [2018-11-23 11:55:40,544 INFO L273 TraceCheckUtils]: 51: Hoare triple {4120#false} assume !false; {4120#false} is VALID [2018-11-23 11:55:40,548 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:40,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:40,548 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:40,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:40,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:40,767 INFO L256 TraceCheckUtils]: 0: Hoare triple {4119#true} call ULTIMATE.init(); {4119#true} is VALID [2018-11-23 11:55:40,768 INFO L273 TraceCheckUtils]: 1: Hoare triple {4119#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4119#true} is VALID [2018-11-23 11:55:40,768 INFO L273 TraceCheckUtils]: 2: Hoare triple {4119#true} assume true; {4119#true} is VALID [2018-11-23 11:55:40,768 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4119#true} {4119#true} #55#return; {4119#true} is VALID [2018-11-23 11:55:40,768 INFO L256 TraceCheckUtils]: 4: Hoare triple {4119#true} call #t~ret4 := main(); {4119#true} is VALID [2018-11-23 11:55:40,769 INFO L273 TraceCheckUtils]: 5: Hoare triple {4119#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {4153#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:40,770 INFO L273 TraceCheckUtils]: 6: Hoare triple {4153#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4153#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:40,770 INFO L273 TraceCheckUtils]: 7: Hoare triple {4153#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4153#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:40,790 INFO L273 TraceCheckUtils]: 8: Hoare triple {4153#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {4122#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:40,793 INFO L273 TraceCheckUtils]: 9: Hoare triple {4122#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4122#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:40,793 INFO L273 TraceCheckUtils]: 10: Hoare triple {4122#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4122#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:40,796 INFO L273 TraceCheckUtils]: 11: Hoare triple {4122#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {4123#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:40,796 INFO L273 TraceCheckUtils]: 12: Hoare triple {4123#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4123#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:40,796 INFO L273 TraceCheckUtils]: 13: Hoare triple {4123#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4123#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:40,797 INFO L273 TraceCheckUtils]: 14: Hoare triple {4123#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {4124#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:40,797 INFO L273 TraceCheckUtils]: 15: Hoare triple {4124#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4124#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:40,798 INFO L273 TraceCheckUtils]: 16: Hoare triple {4124#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4124#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:40,798 INFO L273 TraceCheckUtils]: 17: Hoare triple {4124#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {4125#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:40,799 INFO L273 TraceCheckUtils]: 18: Hoare triple {4125#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4125#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:40,799 INFO L273 TraceCheckUtils]: 19: Hoare triple {4125#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4125#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:40,799 INFO L273 TraceCheckUtils]: 20: Hoare triple {4125#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {4126#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:40,800 INFO L273 TraceCheckUtils]: 21: Hoare triple {4126#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4126#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:40,800 INFO L273 TraceCheckUtils]: 22: Hoare triple {4126#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4126#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:40,801 INFO L273 TraceCheckUtils]: 23: Hoare triple {4126#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {4127#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:40,801 INFO L273 TraceCheckUtils]: 24: Hoare triple {4127#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4127#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:40,802 INFO L273 TraceCheckUtils]: 25: Hoare triple {4127#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4127#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:40,803 INFO L273 TraceCheckUtils]: 26: Hoare triple {4127#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {4128#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:40,803 INFO L273 TraceCheckUtils]: 27: Hoare triple {4128#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4128#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:40,804 INFO L273 TraceCheckUtils]: 28: Hoare triple {4128#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4128#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:40,804 INFO L273 TraceCheckUtils]: 29: Hoare triple {4128#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {4129#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:40,805 INFO L273 TraceCheckUtils]: 30: Hoare triple {4129#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4129#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:40,805 INFO L273 TraceCheckUtils]: 31: Hoare triple {4129#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4129#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:40,806 INFO L273 TraceCheckUtils]: 32: Hoare triple {4129#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {4130#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:40,807 INFO L273 TraceCheckUtils]: 33: Hoare triple {4130#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4130#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:40,807 INFO L273 TraceCheckUtils]: 34: Hoare triple {4130#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4130#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:40,808 INFO L273 TraceCheckUtils]: 35: Hoare triple {4130#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {4131#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:40,808 INFO L273 TraceCheckUtils]: 36: Hoare triple {4131#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4131#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:40,809 INFO L273 TraceCheckUtils]: 37: Hoare triple {4131#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4131#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:40,810 INFO L273 TraceCheckUtils]: 38: Hoare triple {4131#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {4132#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:40,810 INFO L273 TraceCheckUtils]: 39: Hoare triple {4132#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4132#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:40,811 INFO L273 TraceCheckUtils]: 40: Hoare triple {4132#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4132#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:40,812 INFO L273 TraceCheckUtils]: 41: Hoare triple {4132#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {4133#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:40,816 INFO L273 TraceCheckUtils]: 42: Hoare triple {4133#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4133#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:40,816 INFO L273 TraceCheckUtils]: 43: Hoare triple {4133#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4133#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:40,817 INFO L273 TraceCheckUtils]: 44: Hoare triple {4133#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {4134#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:40,817 INFO L273 TraceCheckUtils]: 45: Hoare triple {4134#(<= main_~i~0 13)} assume !(~i~0 < 100000); {4120#false} is VALID [2018-11-23 11:55:40,817 INFO L273 TraceCheckUtils]: 46: Hoare triple {4120#false} havoc ~x~0;~x~0 := 0; {4120#false} is VALID [2018-11-23 11:55:40,817 INFO L273 TraceCheckUtils]: 47: Hoare triple {4120#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4120#false} is VALID [2018-11-23 11:55:40,817 INFO L256 TraceCheckUtils]: 48: Hoare triple {4120#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {4120#false} is VALID [2018-11-23 11:55:40,818 INFO L273 TraceCheckUtils]: 49: Hoare triple {4120#false} ~cond := #in~cond; {4120#false} is VALID [2018-11-23 11:55:40,818 INFO L273 TraceCheckUtils]: 50: Hoare triple {4120#false} assume 0 == ~cond; {4120#false} is VALID [2018-11-23 11:55:40,818 INFO L273 TraceCheckUtils]: 51: Hoare triple {4120#false} assume !false; {4120#false} is VALID [2018-11-23 11:55:40,820 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:40,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:40,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 11:55:40,839 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-11-23 11:55:40,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:40,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:55:40,896 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:40,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:55:40,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:55:40,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:55:40,897 INFO L87 Difference]: Start difference. First operand 57 states and 71 transitions. Second operand 17 states. [2018-11-23 11:55:41,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:41,506 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2018-11-23 11:55:41,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:55:41,506 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-11-23 11:55:41,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:41,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:55:41,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 90 transitions. [2018-11-23 11:55:41,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:55:41,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 90 transitions. [2018-11-23 11:55:41,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 90 transitions. [2018-11-23 11:55:42,035 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:42,037 INFO L225 Difference]: With dead ends: 73 [2018-11-23 11:55:42,038 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 11:55:42,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:55:42,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 11:55:42,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-11-23 11:55:42,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:42,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 60 states. [2018-11-23 11:55:42,054 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 60 states. [2018-11-23 11:55:42,054 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 60 states. [2018-11-23 11:55:42,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:42,056 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2018-11-23 11:55:42,056 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2018-11-23 11:55:42,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:42,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:42,057 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 62 states. [2018-11-23 11:55:42,057 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 62 states. [2018-11-23 11:55:42,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:42,058 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2018-11-23 11:55:42,058 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2018-11-23 11:55:42,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:42,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:42,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:42,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:42,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 11:55:42,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2018-11-23 11:55:42,061 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 52 [2018-11-23 11:55:42,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:42,061 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2018-11-23 11:55:42,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:55:42,061 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2018-11-23 11:55:42,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 11:55:42,062 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:42,062 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:42,062 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:42,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:42,063 INFO L82 PathProgramCache]: Analyzing trace with hash 335143673, now seen corresponding path program 14 times [2018-11-23 11:55:42,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:42,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:42,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:42,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:42,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:43,350 INFO L256 TraceCheckUtils]: 0: Hoare triple {4595#true} call ULTIMATE.init(); {4595#true} is VALID [2018-11-23 11:55:43,350 INFO L273 TraceCheckUtils]: 1: Hoare triple {4595#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4595#true} is VALID [2018-11-23 11:55:43,350 INFO L273 TraceCheckUtils]: 2: Hoare triple {4595#true} assume true; {4595#true} is VALID [2018-11-23 11:55:43,350 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4595#true} {4595#true} #55#return; {4595#true} is VALID [2018-11-23 11:55:43,350 INFO L256 TraceCheckUtils]: 4: Hoare triple {4595#true} call #t~ret4 := main(); {4595#true} is VALID [2018-11-23 11:55:43,351 INFO L273 TraceCheckUtils]: 5: Hoare triple {4595#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {4597#(= main_~i~0 0)} is VALID [2018-11-23 11:55:43,352 INFO L273 TraceCheckUtils]: 6: Hoare triple {4597#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4597#(= main_~i~0 0)} is VALID [2018-11-23 11:55:43,352 INFO L273 TraceCheckUtils]: 7: Hoare triple {4597#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4597#(= main_~i~0 0)} is VALID [2018-11-23 11:55:43,355 INFO L273 TraceCheckUtils]: 8: Hoare triple {4597#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {4598#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:43,355 INFO L273 TraceCheckUtils]: 9: Hoare triple {4598#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4598#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:43,357 INFO L273 TraceCheckUtils]: 10: Hoare triple {4598#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4598#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:43,357 INFO L273 TraceCheckUtils]: 11: Hoare triple {4598#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {4599#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:43,360 INFO L273 TraceCheckUtils]: 12: Hoare triple {4599#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4599#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:43,360 INFO L273 TraceCheckUtils]: 13: Hoare triple {4599#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4599#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:43,362 INFO L273 TraceCheckUtils]: 14: Hoare triple {4599#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {4600#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:43,362 INFO L273 TraceCheckUtils]: 15: Hoare triple {4600#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4600#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:43,365 INFO L273 TraceCheckUtils]: 16: Hoare triple {4600#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4600#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:43,365 INFO L273 TraceCheckUtils]: 17: Hoare triple {4600#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {4601#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:43,367 INFO L273 TraceCheckUtils]: 18: Hoare triple {4601#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4601#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:43,367 INFO L273 TraceCheckUtils]: 19: Hoare triple {4601#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4601#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:43,369 INFO L273 TraceCheckUtils]: 20: Hoare triple {4601#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {4602#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:43,369 INFO L273 TraceCheckUtils]: 21: Hoare triple {4602#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4602#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:43,371 INFO L273 TraceCheckUtils]: 22: Hoare triple {4602#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4602#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:43,371 INFO L273 TraceCheckUtils]: 23: Hoare triple {4602#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {4603#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:43,374 INFO L273 TraceCheckUtils]: 24: Hoare triple {4603#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4603#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:43,374 INFO L273 TraceCheckUtils]: 25: Hoare triple {4603#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4603#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:43,376 INFO L273 TraceCheckUtils]: 26: Hoare triple {4603#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {4604#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:43,376 INFO L273 TraceCheckUtils]: 27: Hoare triple {4604#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4604#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:43,379 INFO L273 TraceCheckUtils]: 28: Hoare triple {4604#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4604#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:43,379 INFO L273 TraceCheckUtils]: 29: Hoare triple {4604#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {4605#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:43,381 INFO L273 TraceCheckUtils]: 30: Hoare triple {4605#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4605#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:43,381 INFO L273 TraceCheckUtils]: 31: Hoare triple {4605#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4605#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:43,383 INFO L273 TraceCheckUtils]: 32: Hoare triple {4605#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {4606#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:43,385 INFO L273 TraceCheckUtils]: 33: Hoare triple {4606#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4606#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:43,385 INFO L273 TraceCheckUtils]: 34: Hoare triple {4606#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4606#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:43,388 INFO L273 TraceCheckUtils]: 35: Hoare triple {4606#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {4607#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:43,388 INFO L273 TraceCheckUtils]: 36: Hoare triple {4607#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4607#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:43,391 INFO L273 TraceCheckUtils]: 37: Hoare triple {4607#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4607#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:43,391 INFO L273 TraceCheckUtils]: 38: Hoare triple {4607#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {4608#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:43,394 INFO L273 TraceCheckUtils]: 39: Hoare triple {4608#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4608#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:43,394 INFO L273 TraceCheckUtils]: 40: Hoare triple {4608#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4608#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:43,397 INFO L273 TraceCheckUtils]: 41: Hoare triple {4608#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {4609#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:43,397 INFO L273 TraceCheckUtils]: 42: Hoare triple {4609#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4609#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:43,400 INFO L273 TraceCheckUtils]: 43: Hoare triple {4609#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4609#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:43,400 INFO L273 TraceCheckUtils]: 44: Hoare triple {4609#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {4610#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:43,402 INFO L273 TraceCheckUtils]: 45: Hoare triple {4610#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4610#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:43,402 INFO L273 TraceCheckUtils]: 46: Hoare triple {4610#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4610#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:43,404 INFO L273 TraceCheckUtils]: 47: Hoare triple {4610#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {4611#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:43,404 INFO L273 TraceCheckUtils]: 48: Hoare triple {4611#(<= main_~i~0 14)} assume !(~i~0 < 100000); {4596#false} is VALID [2018-11-23 11:55:43,404 INFO L273 TraceCheckUtils]: 49: Hoare triple {4596#false} havoc ~x~0;~x~0 := 0; {4596#false} is VALID [2018-11-23 11:55:43,404 INFO L273 TraceCheckUtils]: 50: Hoare triple {4596#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4596#false} is VALID [2018-11-23 11:55:43,404 INFO L256 TraceCheckUtils]: 51: Hoare triple {4596#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {4596#false} is VALID [2018-11-23 11:55:43,405 INFO L273 TraceCheckUtils]: 52: Hoare triple {4596#false} ~cond := #in~cond; {4596#false} is VALID [2018-11-23 11:55:43,405 INFO L273 TraceCheckUtils]: 53: Hoare triple {4596#false} assume 0 == ~cond; {4596#false} is VALID [2018-11-23 11:55:43,405 INFO L273 TraceCheckUtils]: 54: Hoare triple {4596#false} assume !false; {4596#false} is VALID [2018-11-23 11:55:43,407 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:43,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:43,407 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:43,416 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:55:43,441 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:55:43,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:43,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:43,636 INFO L256 TraceCheckUtils]: 0: Hoare triple {4595#true} call ULTIMATE.init(); {4595#true} is VALID [2018-11-23 11:55:43,637 INFO L273 TraceCheckUtils]: 1: Hoare triple {4595#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4595#true} is VALID [2018-11-23 11:55:43,637 INFO L273 TraceCheckUtils]: 2: Hoare triple {4595#true} assume true; {4595#true} is VALID [2018-11-23 11:55:43,637 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4595#true} {4595#true} #55#return; {4595#true} is VALID [2018-11-23 11:55:43,637 INFO L256 TraceCheckUtils]: 4: Hoare triple {4595#true} call #t~ret4 := main(); {4595#true} is VALID [2018-11-23 11:55:43,638 INFO L273 TraceCheckUtils]: 5: Hoare triple {4595#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {4630#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:43,638 INFO L273 TraceCheckUtils]: 6: Hoare triple {4630#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4630#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:43,639 INFO L273 TraceCheckUtils]: 7: Hoare triple {4630#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4630#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:43,639 INFO L273 TraceCheckUtils]: 8: Hoare triple {4630#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {4598#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:43,640 INFO L273 TraceCheckUtils]: 9: Hoare triple {4598#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4598#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:43,640 INFO L273 TraceCheckUtils]: 10: Hoare triple {4598#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4598#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:43,640 INFO L273 TraceCheckUtils]: 11: Hoare triple {4598#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {4599#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:43,641 INFO L273 TraceCheckUtils]: 12: Hoare triple {4599#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4599#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:43,641 INFO L273 TraceCheckUtils]: 13: Hoare triple {4599#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4599#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:43,642 INFO L273 TraceCheckUtils]: 14: Hoare triple {4599#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {4600#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:43,643 INFO L273 TraceCheckUtils]: 15: Hoare triple {4600#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4600#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:43,643 INFO L273 TraceCheckUtils]: 16: Hoare triple {4600#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4600#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:43,644 INFO L273 TraceCheckUtils]: 17: Hoare triple {4600#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {4601#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:43,645 INFO L273 TraceCheckUtils]: 18: Hoare triple {4601#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4601#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:43,645 INFO L273 TraceCheckUtils]: 19: Hoare triple {4601#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4601#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:43,646 INFO L273 TraceCheckUtils]: 20: Hoare triple {4601#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {4602#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:43,646 INFO L273 TraceCheckUtils]: 21: Hoare triple {4602#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4602#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:43,647 INFO L273 TraceCheckUtils]: 22: Hoare triple {4602#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4602#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:43,648 INFO L273 TraceCheckUtils]: 23: Hoare triple {4602#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {4603#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:43,648 INFO L273 TraceCheckUtils]: 24: Hoare triple {4603#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4603#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:43,649 INFO L273 TraceCheckUtils]: 25: Hoare triple {4603#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4603#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:43,650 INFO L273 TraceCheckUtils]: 26: Hoare triple {4603#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {4604#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:43,650 INFO L273 TraceCheckUtils]: 27: Hoare triple {4604#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4604#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:43,651 INFO L273 TraceCheckUtils]: 28: Hoare triple {4604#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4604#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:43,651 INFO L273 TraceCheckUtils]: 29: Hoare triple {4604#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {4605#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:43,652 INFO L273 TraceCheckUtils]: 30: Hoare triple {4605#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4605#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:43,653 INFO L273 TraceCheckUtils]: 31: Hoare triple {4605#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4605#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:43,653 INFO L273 TraceCheckUtils]: 32: Hoare triple {4605#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {4606#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:43,654 INFO L273 TraceCheckUtils]: 33: Hoare triple {4606#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4606#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:43,654 INFO L273 TraceCheckUtils]: 34: Hoare triple {4606#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4606#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:43,655 INFO L273 TraceCheckUtils]: 35: Hoare triple {4606#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {4607#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:43,656 INFO L273 TraceCheckUtils]: 36: Hoare triple {4607#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4607#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:43,656 INFO L273 TraceCheckUtils]: 37: Hoare triple {4607#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4607#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:43,657 INFO L273 TraceCheckUtils]: 38: Hoare triple {4607#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {4608#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:43,657 INFO L273 TraceCheckUtils]: 39: Hoare triple {4608#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4608#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:43,658 INFO L273 TraceCheckUtils]: 40: Hoare triple {4608#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4608#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:43,659 INFO L273 TraceCheckUtils]: 41: Hoare triple {4608#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {4609#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:43,659 INFO L273 TraceCheckUtils]: 42: Hoare triple {4609#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4609#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:43,660 INFO L273 TraceCheckUtils]: 43: Hoare triple {4609#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4609#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:43,661 INFO L273 TraceCheckUtils]: 44: Hoare triple {4609#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {4610#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:43,661 INFO L273 TraceCheckUtils]: 45: Hoare triple {4610#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4610#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:43,662 INFO L273 TraceCheckUtils]: 46: Hoare triple {4610#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {4610#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:43,662 INFO L273 TraceCheckUtils]: 47: Hoare triple {4610#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {4611#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:43,663 INFO L273 TraceCheckUtils]: 48: Hoare triple {4611#(<= main_~i~0 14)} assume !(~i~0 < 100000); {4596#false} is VALID [2018-11-23 11:55:43,663 INFO L273 TraceCheckUtils]: 49: Hoare triple {4596#false} havoc ~x~0;~x~0 := 0; {4596#false} is VALID [2018-11-23 11:55:43,663 INFO L273 TraceCheckUtils]: 50: Hoare triple {4596#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4596#false} is VALID [2018-11-23 11:55:43,664 INFO L256 TraceCheckUtils]: 51: Hoare triple {4596#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {4596#false} is VALID [2018-11-23 11:55:43,664 INFO L273 TraceCheckUtils]: 52: Hoare triple {4596#false} ~cond := #in~cond; {4596#false} is VALID [2018-11-23 11:55:43,664 INFO L273 TraceCheckUtils]: 53: Hoare triple {4596#false} assume 0 == ~cond; {4596#false} is VALID [2018-11-23 11:55:43,664 INFO L273 TraceCheckUtils]: 54: Hoare triple {4596#false} assume !false; {4596#false} is VALID [2018-11-23 11:55:43,667 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:43,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:43,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 11:55:43,686 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2018-11-23 11:55:43,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:43,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:55:43,746 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:43,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:55:43,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:55:43,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:55:43,748 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand 18 states. [2018-11-23 11:55:43,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:43,965 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2018-11-23 11:55:43,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:55:43,965 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2018-11-23 11:55:43,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:43,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:55:43,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2018-11-23 11:55:43,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:55:43,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2018-11-23 11:55:43,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 94 transitions. [2018-11-23 11:55:44,519 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:44,520 INFO L225 Difference]: With dead ends: 76 [2018-11-23 11:55:44,521 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 11:55:44,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:55:44,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 11:55:44,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-11-23 11:55:44,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:44,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 63 states. [2018-11-23 11:55:44,545 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 63 states. [2018-11-23 11:55:44,545 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 63 states. [2018-11-23 11:55:44,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:44,547 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2018-11-23 11:55:44,547 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2018-11-23 11:55:44,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:44,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:44,548 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 65 states. [2018-11-23 11:55:44,548 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 65 states. [2018-11-23 11:55:44,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:44,549 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2018-11-23 11:55:44,549 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2018-11-23 11:55:44,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:44,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:44,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:44,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:44,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 11:55:44,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 79 transitions. [2018-11-23 11:55:44,552 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 79 transitions. Word has length 55 [2018-11-23 11:55:44,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:44,552 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 79 transitions. [2018-11-23 11:55:44,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:55:44,552 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 79 transitions. [2018-11-23 11:55:44,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 11:55:44,553 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:44,553 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:44,553 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:44,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:44,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1806532259, now seen corresponding path program 15 times [2018-11-23 11:55:44,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:44,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:44,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:44,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:44,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:45,523 INFO L256 TraceCheckUtils]: 0: Hoare triple {5095#true} call ULTIMATE.init(); {5095#true} is VALID [2018-11-23 11:55:45,523 INFO L273 TraceCheckUtils]: 1: Hoare triple {5095#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5095#true} is VALID [2018-11-23 11:55:45,524 INFO L273 TraceCheckUtils]: 2: Hoare triple {5095#true} assume true; {5095#true} is VALID [2018-11-23 11:55:45,524 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5095#true} {5095#true} #55#return; {5095#true} is VALID [2018-11-23 11:55:45,524 INFO L256 TraceCheckUtils]: 4: Hoare triple {5095#true} call #t~ret4 := main(); {5095#true} is VALID [2018-11-23 11:55:45,524 INFO L273 TraceCheckUtils]: 5: Hoare triple {5095#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {5097#(= main_~i~0 0)} is VALID [2018-11-23 11:55:45,524 INFO L273 TraceCheckUtils]: 6: Hoare triple {5097#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5097#(= main_~i~0 0)} is VALID [2018-11-23 11:55:45,525 INFO L273 TraceCheckUtils]: 7: Hoare triple {5097#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5097#(= main_~i~0 0)} is VALID [2018-11-23 11:55:45,525 INFO L273 TraceCheckUtils]: 8: Hoare triple {5097#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {5098#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:45,526 INFO L273 TraceCheckUtils]: 9: Hoare triple {5098#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5098#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:45,526 INFO L273 TraceCheckUtils]: 10: Hoare triple {5098#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5098#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:45,527 INFO L273 TraceCheckUtils]: 11: Hoare triple {5098#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {5099#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:45,527 INFO L273 TraceCheckUtils]: 12: Hoare triple {5099#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5099#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:45,528 INFO L273 TraceCheckUtils]: 13: Hoare triple {5099#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5099#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:45,529 INFO L273 TraceCheckUtils]: 14: Hoare triple {5099#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {5100#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:45,529 INFO L273 TraceCheckUtils]: 15: Hoare triple {5100#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5100#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:45,530 INFO L273 TraceCheckUtils]: 16: Hoare triple {5100#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5100#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:45,531 INFO L273 TraceCheckUtils]: 17: Hoare triple {5100#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {5101#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:45,531 INFO L273 TraceCheckUtils]: 18: Hoare triple {5101#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5101#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:45,532 INFO L273 TraceCheckUtils]: 19: Hoare triple {5101#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5101#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:45,532 INFO L273 TraceCheckUtils]: 20: Hoare triple {5101#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {5102#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:45,533 INFO L273 TraceCheckUtils]: 21: Hoare triple {5102#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5102#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:45,534 INFO L273 TraceCheckUtils]: 22: Hoare triple {5102#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5102#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:45,534 INFO L273 TraceCheckUtils]: 23: Hoare triple {5102#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {5103#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:45,535 INFO L273 TraceCheckUtils]: 24: Hoare triple {5103#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5103#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:45,535 INFO L273 TraceCheckUtils]: 25: Hoare triple {5103#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5103#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:45,536 INFO L273 TraceCheckUtils]: 26: Hoare triple {5103#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {5104#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:45,537 INFO L273 TraceCheckUtils]: 27: Hoare triple {5104#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5104#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:45,537 INFO L273 TraceCheckUtils]: 28: Hoare triple {5104#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5104#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:45,538 INFO L273 TraceCheckUtils]: 29: Hoare triple {5104#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {5105#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:45,538 INFO L273 TraceCheckUtils]: 30: Hoare triple {5105#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5105#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:45,539 INFO L273 TraceCheckUtils]: 31: Hoare triple {5105#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5105#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:45,540 INFO L273 TraceCheckUtils]: 32: Hoare triple {5105#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {5106#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:45,540 INFO L273 TraceCheckUtils]: 33: Hoare triple {5106#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5106#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:45,541 INFO L273 TraceCheckUtils]: 34: Hoare triple {5106#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5106#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:45,541 INFO L273 TraceCheckUtils]: 35: Hoare triple {5106#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {5107#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:45,542 INFO L273 TraceCheckUtils]: 36: Hoare triple {5107#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5107#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:45,542 INFO L273 TraceCheckUtils]: 37: Hoare triple {5107#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5107#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:45,543 INFO L273 TraceCheckUtils]: 38: Hoare triple {5107#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {5108#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:45,544 INFO L273 TraceCheckUtils]: 39: Hoare triple {5108#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5108#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:45,544 INFO L273 TraceCheckUtils]: 40: Hoare triple {5108#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5108#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:45,563 INFO L273 TraceCheckUtils]: 41: Hoare triple {5108#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {5109#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:45,566 INFO L273 TraceCheckUtils]: 42: Hoare triple {5109#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5109#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:45,566 INFO L273 TraceCheckUtils]: 43: Hoare triple {5109#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5109#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:45,567 INFO L273 TraceCheckUtils]: 44: Hoare triple {5109#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {5110#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:45,567 INFO L273 TraceCheckUtils]: 45: Hoare triple {5110#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5110#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:45,567 INFO L273 TraceCheckUtils]: 46: Hoare triple {5110#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5110#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:45,568 INFO L273 TraceCheckUtils]: 47: Hoare triple {5110#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {5111#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:45,568 INFO L273 TraceCheckUtils]: 48: Hoare triple {5111#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5111#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:45,568 INFO L273 TraceCheckUtils]: 49: Hoare triple {5111#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5111#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:45,569 INFO L273 TraceCheckUtils]: 50: Hoare triple {5111#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {5112#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:45,570 INFO L273 TraceCheckUtils]: 51: Hoare triple {5112#(<= main_~i~0 15)} assume !(~i~0 < 100000); {5096#false} is VALID [2018-11-23 11:55:45,570 INFO L273 TraceCheckUtils]: 52: Hoare triple {5096#false} havoc ~x~0;~x~0 := 0; {5096#false} is VALID [2018-11-23 11:55:45,570 INFO L273 TraceCheckUtils]: 53: Hoare triple {5096#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5096#false} is VALID [2018-11-23 11:55:45,570 INFO L256 TraceCheckUtils]: 54: Hoare triple {5096#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {5096#false} is VALID [2018-11-23 11:55:45,570 INFO L273 TraceCheckUtils]: 55: Hoare triple {5096#false} ~cond := #in~cond; {5096#false} is VALID [2018-11-23 11:55:45,571 INFO L273 TraceCheckUtils]: 56: Hoare triple {5096#false} assume 0 == ~cond; {5096#false} is VALID [2018-11-23 11:55:45,571 INFO L273 TraceCheckUtils]: 57: Hoare triple {5096#false} assume !false; {5096#false} is VALID [2018-11-23 11:55:45,574 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:45,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:45,574 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:45,583 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:55:45,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-23 11:55:45,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:45,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:45,778 INFO L256 TraceCheckUtils]: 0: Hoare triple {5095#true} call ULTIMATE.init(); {5095#true} is VALID [2018-11-23 11:55:45,778 INFO L273 TraceCheckUtils]: 1: Hoare triple {5095#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5095#true} is VALID [2018-11-23 11:55:45,779 INFO L273 TraceCheckUtils]: 2: Hoare triple {5095#true} assume true; {5095#true} is VALID [2018-11-23 11:55:45,779 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5095#true} {5095#true} #55#return; {5095#true} is VALID [2018-11-23 11:55:45,779 INFO L256 TraceCheckUtils]: 4: Hoare triple {5095#true} call #t~ret4 := main(); {5095#true} is VALID [2018-11-23 11:55:45,780 INFO L273 TraceCheckUtils]: 5: Hoare triple {5095#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {5131#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:45,780 INFO L273 TraceCheckUtils]: 6: Hoare triple {5131#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5131#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:45,781 INFO L273 TraceCheckUtils]: 7: Hoare triple {5131#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5131#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:45,781 INFO L273 TraceCheckUtils]: 8: Hoare triple {5131#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {5098#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:45,782 INFO L273 TraceCheckUtils]: 9: Hoare triple {5098#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5098#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:45,782 INFO L273 TraceCheckUtils]: 10: Hoare triple {5098#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5098#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:45,783 INFO L273 TraceCheckUtils]: 11: Hoare triple {5098#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {5099#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:45,784 INFO L273 TraceCheckUtils]: 12: Hoare triple {5099#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5099#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:45,784 INFO L273 TraceCheckUtils]: 13: Hoare triple {5099#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5099#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:45,785 INFO L273 TraceCheckUtils]: 14: Hoare triple {5099#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {5100#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:45,785 INFO L273 TraceCheckUtils]: 15: Hoare triple {5100#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5100#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:45,786 INFO L273 TraceCheckUtils]: 16: Hoare triple {5100#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5100#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:45,787 INFO L273 TraceCheckUtils]: 17: Hoare triple {5100#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {5101#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:45,787 INFO L273 TraceCheckUtils]: 18: Hoare triple {5101#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5101#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:45,788 INFO L273 TraceCheckUtils]: 19: Hoare triple {5101#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5101#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:45,788 INFO L273 TraceCheckUtils]: 20: Hoare triple {5101#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {5102#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:45,789 INFO L273 TraceCheckUtils]: 21: Hoare triple {5102#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5102#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:45,789 INFO L273 TraceCheckUtils]: 22: Hoare triple {5102#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5102#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:45,790 INFO L273 TraceCheckUtils]: 23: Hoare triple {5102#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {5103#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:45,791 INFO L273 TraceCheckUtils]: 24: Hoare triple {5103#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5103#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:45,791 INFO L273 TraceCheckUtils]: 25: Hoare triple {5103#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5103#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:45,792 INFO L273 TraceCheckUtils]: 26: Hoare triple {5103#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {5104#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:45,792 INFO L273 TraceCheckUtils]: 27: Hoare triple {5104#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5104#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:45,793 INFO L273 TraceCheckUtils]: 28: Hoare triple {5104#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5104#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:45,794 INFO L273 TraceCheckUtils]: 29: Hoare triple {5104#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {5105#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:45,794 INFO L273 TraceCheckUtils]: 30: Hoare triple {5105#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5105#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:45,795 INFO L273 TraceCheckUtils]: 31: Hoare triple {5105#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5105#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:45,796 INFO L273 TraceCheckUtils]: 32: Hoare triple {5105#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {5106#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:45,796 INFO L273 TraceCheckUtils]: 33: Hoare triple {5106#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5106#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:45,797 INFO L273 TraceCheckUtils]: 34: Hoare triple {5106#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5106#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:45,797 INFO L273 TraceCheckUtils]: 35: Hoare triple {5106#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {5107#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:45,798 INFO L273 TraceCheckUtils]: 36: Hoare triple {5107#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5107#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:45,798 INFO L273 TraceCheckUtils]: 37: Hoare triple {5107#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5107#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:45,799 INFO L273 TraceCheckUtils]: 38: Hoare triple {5107#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {5108#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:45,800 INFO L273 TraceCheckUtils]: 39: Hoare triple {5108#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5108#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:45,800 INFO L273 TraceCheckUtils]: 40: Hoare triple {5108#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5108#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:45,801 INFO L273 TraceCheckUtils]: 41: Hoare triple {5108#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {5109#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:45,802 INFO L273 TraceCheckUtils]: 42: Hoare triple {5109#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5109#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:45,802 INFO L273 TraceCheckUtils]: 43: Hoare triple {5109#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5109#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:45,803 INFO L273 TraceCheckUtils]: 44: Hoare triple {5109#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {5110#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:45,804 INFO L273 TraceCheckUtils]: 45: Hoare triple {5110#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5110#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:45,804 INFO L273 TraceCheckUtils]: 46: Hoare triple {5110#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5110#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:45,805 INFO L273 TraceCheckUtils]: 47: Hoare triple {5110#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {5111#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:45,805 INFO L273 TraceCheckUtils]: 48: Hoare triple {5111#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5111#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:45,806 INFO L273 TraceCheckUtils]: 49: Hoare triple {5111#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5111#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:45,807 INFO L273 TraceCheckUtils]: 50: Hoare triple {5111#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {5112#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:45,807 INFO L273 TraceCheckUtils]: 51: Hoare triple {5112#(<= main_~i~0 15)} assume !(~i~0 < 100000); {5096#false} is VALID [2018-11-23 11:55:45,808 INFO L273 TraceCheckUtils]: 52: Hoare triple {5096#false} havoc ~x~0;~x~0 := 0; {5096#false} is VALID [2018-11-23 11:55:45,808 INFO L273 TraceCheckUtils]: 53: Hoare triple {5096#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5096#false} is VALID [2018-11-23 11:55:45,808 INFO L256 TraceCheckUtils]: 54: Hoare triple {5096#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {5096#false} is VALID [2018-11-23 11:55:45,808 INFO L273 TraceCheckUtils]: 55: Hoare triple {5096#false} ~cond := #in~cond; {5096#false} is VALID [2018-11-23 11:55:45,809 INFO L273 TraceCheckUtils]: 56: Hoare triple {5096#false} assume 0 == ~cond; {5096#false} is VALID [2018-11-23 11:55:45,809 INFO L273 TraceCheckUtils]: 57: Hoare triple {5096#false} assume !false; {5096#false} is VALID [2018-11-23 11:55:45,812 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:45,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:45,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 11:55:45,831 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2018-11-23 11:55:45,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:45,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 11:55:45,889 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:45,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 11:55:45,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 11:55:45,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:55:45,890 INFO L87 Difference]: Start difference. First operand 63 states and 79 transitions. Second operand 19 states. [2018-11-23 11:55:46,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:46,243 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2018-11-23 11:55:46,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:55:46,244 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2018-11-23 11:55:46,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:46,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:55:46,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 98 transitions. [2018-11-23 11:55:46,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:55:46,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 98 transitions. [2018-11-23 11:55:46,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 98 transitions. [2018-11-23 11:55:46,806 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:46,808 INFO L225 Difference]: With dead ends: 79 [2018-11-23 11:55:46,808 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 11:55:46,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:55:46,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 11:55:46,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-11-23 11:55:46,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:46,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 66 states. [2018-11-23 11:55:46,844 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 66 states. [2018-11-23 11:55:46,844 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 66 states. [2018-11-23 11:55:46,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:46,846 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2018-11-23 11:55:46,846 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2018-11-23 11:55:46,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:46,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:46,846 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 68 states. [2018-11-23 11:55:46,846 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 68 states. [2018-11-23 11:55:46,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:46,848 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2018-11-23 11:55:46,848 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2018-11-23 11:55:46,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:46,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:46,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:46,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:46,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 11:55:46,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2018-11-23 11:55:46,851 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 58 [2018-11-23 11:55:46,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:46,851 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2018-11-23 11:55:46,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 11:55:46,851 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2018-11-23 11:55:46,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 11:55:46,852 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:46,852 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:46,852 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:46,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:46,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1507674809, now seen corresponding path program 16 times [2018-11-23 11:55:46,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:46,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:46,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:46,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:46,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:47,591 INFO L256 TraceCheckUtils]: 0: Hoare triple {5619#true} call ULTIMATE.init(); {5619#true} is VALID [2018-11-23 11:55:47,591 INFO L273 TraceCheckUtils]: 1: Hoare triple {5619#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5619#true} is VALID [2018-11-23 11:55:47,591 INFO L273 TraceCheckUtils]: 2: Hoare triple {5619#true} assume true; {5619#true} is VALID [2018-11-23 11:55:47,592 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5619#true} {5619#true} #55#return; {5619#true} is VALID [2018-11-23 11:55:47,592 INFO L256 TraceCheckUtils]: 4: Hoare triple {5619#true} call #t~ret4 := main(); {5619#true} is VALID [2018-11-23 11:55:47,592 INFO L273 TraceCheckUtils]: 5: Hoare triple {5619#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {5621#(= main_~i~0 0)} is VALID [2018-11-23 11:55:47,593 INFO L273 TraceCheckUtils]: 6: Hoare triple {5621#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5621#(= main_~i~0 0)} is VALID [2018-11-23 11:55:47,593 INFO L273 TraceCheckUtils]: 7: Hoare triple {5621#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5621#(= main_~i~0 0)} is VALID [2018-11-23 11:55:47,594 INFO L273 TraceCheckUtils]: 8: Hoare triple {5621#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {5622#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:47,594 INFO L273 TraceCheckUtils]: 9: Hoare triple {5622#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5622#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:47,594 INFO L273 TraceCheckUtils]: 10: Hoare triple {5622#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5622#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:47,595 INFO L273 TraceCheckUtils]: 11: Hoare triple {5622#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {5623#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:47,595 INFO L273 TraceCheckUtils]: 12: Hoare triple {5623#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5623#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:47,595 INFO L273 TraceCheckUtils]: 13: Hoare triple {5623#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5623#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:47,596 INFO L273 TraceCheckUtils]: 14: Hoare triple {5623#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {5624#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:47,596 INFO L273 TraceCheckUtils]: 15: Hoare triple {5624#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5624#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:47,597 INFO L273 TraceCheckUtils]: 16: Hoare triple {5624#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5624#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:47,598 INFO L273 TraceCheckUtils]: 17: Hoare triple {5624#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {5625#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:47,598 INFO L273 TraceCheckUtils]: 18: Hoare triple {5625#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5625#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:47,599 INFO L273 TraceCheckUtils]: 19: Hoare triple {5625#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5625#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:47,599 INFO L273 TraceCheckUtils]: 20: Hoare triple {5625#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {5626#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:47,600 INFO L273 TraceCheckUtils]: 21: Hoare triple {5626#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5626#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:47,600 INFO L273 TraceCheckUtils]: 22: Hoare triple {5626#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5626#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:47,601 INFO L273 TraceCheckUtils]: 23: Hoare triple {5626#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {5627#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:47,601 INFO L273 TraceCheckUtils]: 24: Hoare triple {5627#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5627#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:47,602 INFO L273 TraceCheckUtils]: 25: Hoare triple {5627#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5627#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:47,603 INFO L273 TraceCheckUtils]: 26: Hoare triple {5627#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {5628#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:47,603 INFO L273 TraceCheckUtils]: 27: Hoare triple {5628#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5628#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:47,604 INFO L273 TraceCheckUtils]: 28: Hoare triple {5628#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5628#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:47,605 INFO L273 TraceCheckUtils]: 29: Hoare triple {5628#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {5629#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:47,605 INFO L273 TraceCheckUtils]: 30: Hoare triple {5629#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5629#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:47,606 INFO L273 TraceCheckUtils]: 31: Hoare triple {5629#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5629#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:47,606 INFO L273 TraceCheckUtils]: 32: Hoare triple {5629#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {5630#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:47,607 INFO L273 TraceCheckUtils]: 33: Hoare triple {5630#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5630#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:47,607 INFO L273 TraceCheckUtils]: 34: Hoare triple {5630#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5630#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:47,608 INFO L273 TraceCheckUtils]: 35: Hoare triple {5630#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {5631#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:47,609 INFO L273 TraceCheckUtils]: 36: Hoare triple {5631#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5631#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:47,609 INFO L273 TraceCheckUtils]: 37: Hoare triple {5631#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5631#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:47,610 INFO L273 TraceCheckUtils]: 38: Hoare triple {5631#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {5632#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:47,610 INFO L273 TraceCheckUtils]: 39: Hoare triple {5632#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5632#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:47,611 INFO L273 TraceCheckUtils]: 40: Hoare triple {5632#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5632#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:47,612 INFO L273 TraceCheckUtils]: 41: Hoare triple {5632#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {5633#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:47,612 INFO L273 TraceCheckUtils]: 42: Hoare triple {5633#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5633#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:47,613 INFO L273 TraceCheckUtils]: 43: Hoare triple {5633#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5633#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:47,614 INFO L273 TraceCheckUtils]: 44: Hoare triple {5633#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {5634#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:47,614 INFO L273 TraceCheckUtils]: 45: Hoare triple {5634#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5634#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:47,615 INFO L273 TraceCheckUtils]: 46: Hoare triple {5634#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5634#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:47,615 INFO L273 TraceCheckUtils]: 47: Hoare triple {5634#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {5635#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:47,616 INFO L273 TraceCheckUtils]: 48: Hoare triple {5635#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5635#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:47,616 INFO L273 TraceCheckUtils]: 49: Hoare triple {5635#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5635#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:47,617 INFO L273 TraceCheckUtils]: 50: Hoare triple {5635#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {5636#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:47,618 INFO L273 TraceCheckUtils]: 51: Hoare triple {5636#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5636#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:47,618 INFO L273 TraceCheckUtils]: 52: Hoare triple {5636#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5636#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:47,619 INFO L273 TraceCheckUtils]: 53: Hoare triple {5636#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {5637#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:47,620 INFO L273 TraceCheckUtils]: 54: Hoare triple {5637#(<= main_~i~0 16)} assume !(~i~0 < 100000); {5620#false} is VALID [2018-11-23 11:55:47,620 INFO L273 TraceCheckUtils]: 55: Hoare triple {5620#false} havoc ~x~0;~x~0 := 0; {5620#false} is VALID [2018-11-23 11:55:47,620 INFO L273 TraceCheckUtils]: 56: Hoare triple {5620#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5620#false} is VALID [2018-11-23 11:55:47,620 INFO L256 TraceCheckUtils]: 57: Hoare triple {5620#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {5620#false} is VALID [2018-11-23 11:55:47,620 INFO L273 TraceCheckUtils]: 58: Hoare triple {5620#false} ~cond := #in~cond; {5620#false} is VALID [2018-11-23 11:55:47,621 INFO L273 TraceCheckUtils]: 59: Hoare triple {5620#false} assume 0 == ~cond; {5620#false} is VALID [2018-11-23 11:55:47,621 INFO L273 TraceCheckUtils]: 60: Hoare triple {5620#false} assume !false; {5620#false} is VALID [2018-11-23 11:55:47,625 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:47,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:47,625 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:47,635 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:55:47,661 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:55:47,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:47,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:47,855 INFO L256 TraceCheckUtils]: 0: Hoare triple {5619#true} call ULTIMATE.init(); {5619#true} is VALID [2018-11-23 11:55:47,855 INFO L273 TraceCheckUtils]: 1: Hoare triple {5619#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5619#true} is VALID [2018-11-23 11:55:47,855 INFO L273 TraceCheckUtils]: 2: Hoare triple {5619#true} assume true; {5619#true} is VALID [2018-11-23 11:55:47,855 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5619#true} {5619#true} #55#return; {5619#true} is VALID [2018-11-23 11:55:47,855 INFO L256 TraceCheckUtils]: 4: Hoare triple {5619#true} call #t~ret4 := main(); {5619#true} is VALID [2018-11-23 11:55:47,856 INFO L273 TraceCheckUtils]: 5: Hoare triple {5619#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {5656#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:47,856 INFO L273 TraceCheckUtils]: 6: Hoare triple {5656#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5656#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:47,856 INFO L273 TraceCheckUtils]: 7: Hoare triple {5656#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5656#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:47,857 INFO L273 TraceCheckUtils]: 8: Hoare triple {5656#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {5622#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:47,857 INFO L273 TraceCheckUtils]: 9: Hoare triple {5622#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5622#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:47,858 INFO L273 TraceCheckUtils]: 10: Hoare triple {5622#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5622#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:47,858 INFO L273 TraceCheckUtils]: 11: Hoare triple {5622#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {5623#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:47,858 INFO L273 TraceCheckUtils]: 12: Hoare triple {5623#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5623#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:47,859 INFO L273 TraceCheckUtils]: 13: Hoare triple {5623#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5623#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:47,859 INFO L273 TraceCheckUtils]: 14: Hoare triple {5623#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {5624#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:47,860 INFO L273 TraceCheckUtils]: 15: Hoare triple {5624#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5624#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:47,860 INFO L273 TraceCheckUtils]: 16: Hoare triple {5624#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5624#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:47,861 INFO L273 TraceCheckUtils]: 17: Hoare triple {5624#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {5625#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:47,861 INFO L273 TraceCheckUtils]: 18: Hoare triple {5625#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5625#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:47,862 INFO L273 TraceCheckUtils]: 19: Hoare triple {5625#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5625#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:47,863 INFO L273 TraceCheckUtils]: 20: Hoare triple {5625#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {5626#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:47,863 INFO L273 TraceCheckUtils]: 21: Hoare triple {5626#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5626#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:47,864 INFO L273 TraceCheckUtils]: 22: Hoare triple {5626#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5626#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:47,865 INFO L273 TraceCheckUtils]: 23: Hoare triple {5626#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {5627#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:47,865 INFO L273 TraceCheckUtils]: 24: Hoare triple {5627#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5627#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:47,866 INFO L273 TraceCheckUtils]: 25: Hoare triple {5627#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5627#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:47,866 INFO L273 TraceCheckUtils]: 26: Hoare triple {5627#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {5628#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:47,867 INFO L273 TraceCheckUtils]: 27: Hoare triple {5628#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5628#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:47,867 INFO L273 TraceCheckUtils]: 28: Hoare triple {5628#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5628#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:47,868 INFO L273 TraceCheckUtils]: 29: Hoare triple {5628#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {5629#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:47,869 INFO L273 TraceCheckUtils]: 30: Hoare triple {5629#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5629#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:47,869 INFO L273 TraceCheckUtils]: 31: Hoare triple {5629#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5629#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:47,870 INFO L273 TraceCheckUtils]: 32: Hoare triple {5629#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {5630#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:47,871 INFO L273 TraceCheckUtils]: 33: Hoare triple {5630#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5630#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:47,871 INFO L273 TraceCheckUtils]: 34: Hoare triple {5630#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5630#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:47,872 INFO L273 TraceCheckUtils]: 35: Hoare triple {5630#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {5631#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:47,872 INFO L273 TraceCheckUtils]: 36: Hoare triple {5631#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5631#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:47,873 INFO L273 TraceCheckUtils]: 37: Hoare triple {5631#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5631#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:47,874 INFO L273 TraceCheckUtils]: 38: Hoare triple {5631#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {5632#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:47,874 INFO L273 TraceCheckUtils]: 39: Hoare triple {5632#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5632#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:47,875 INFO L273 TraceCheckUtils]: 40: Hoare triple {5632#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5632#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:47,875 INFO L273 TraceCheckUtils]: 41: Hoare triple {5632#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {5633#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:47,876 INFO L273 TraceCheckUtils]: 42: Hoare triple {5633#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5633#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:47,876 INFO L273 TraceCheckUtils]: 43: Hoare triple {5633#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5633#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:47,877 INFO L273 TraceCheckUtils]: 44: Hoare triple {5633#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {5634#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:47,878 INFO L273 TraceCheckUtils]: 45: Hoare triple {5634#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5634#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:47,878 INFO L273 TraceCheckUtils]: 46: Hoare triple {5634#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5634#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:47,879 INFO L273 TraceCheckUtils]: 47: Hoare triple {5634#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {5635#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:47,880 INFO L273 TraceCheckUtils]: 48: Hoare triple {5635#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5635#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:47,880 INFO L273 TraceCheckUtils]: 49: Hoare triple {5635#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5635#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:47,881 INFO L273 TraceCheckUtils]: 50: Hoare triple {5635#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {5636#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:47,881 INFO L273 TraceCheckUtils]: 51: Hoare triple {5636#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5636#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:47,882 INFO L273 TraceCheckUtils]: 52: Hoare triple {5636#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {5636#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:47,883 INFO L273 TraceCheckUtils]: 53: Hoare triple {5636#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {5637#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:47,883 INFO L273 TraceCheckUtils]: 54: Hoare triple {5637#(<= main_~i~0 16)} assume !(~i~0 < 100000); {5620#false} is VALID [2018-11-23 11:55:47,883 INFO L273 TraceCheckUtils]: 55: Hoare triple {5620#false} havoc ~x~0;~x~0 := 0; {5620#false} is VALID [2018-11-23 11:55:47,884 INFO L273 TraceCheckUtils]: 56: Hoare triple {5620#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5620#false} is VALID [2018-11-23 11:55:47,884 INFO L256 TraceCheckUtils]: 57: Hoare triple {5620#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {5620#false} is VALID [2018-11-23 11:55:47,884 INFO L273 TraceCheckUtils]: 58: Hoare triple {5620#false} ~cond := #in~cond; {5620#false} is VALID [2018-11-23 11:55:47,884 INFO L273 TraceCheckUtils]: 59: Hoare triple {5620#false} assume 0 == ~cond; {5620#false} is VALID [2018-11-23 11:55:47,885 INFO L273 TraceCheckUtils]: 60: Hoare triple {5620#false} assume !false; {5620#false} is VALID [2018-11-23 11:55:47,888 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:47,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:47,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 11:55:47,907 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 61 [2018-11-23 11:55:47,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:47,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:55:47,967 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:47,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:55:47,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:55:47,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:55:47,968 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand 20 states. [2018-11-23 11:55:48,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:48,365 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2018-11-23 11:55:48,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:55:48,365 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 61 [2018-11-23 11:55:48,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:48,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:55:48,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 102 transitions. [2018-11-23 11:55:48,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:55:48,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 102 transitions. [2018-11-23 11:55:48,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 102 transitions. [2018-11-23 11:55:48,947 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:48,948 INFO L225 Difference]: With dead ends: 82 [2018-11-23 11:55:48,949 INFO L226 Difference]: Without dead ends: 71 [2018-11-23 11:55:48,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:55:48,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-23 11:55:48,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-11-23 11:55:48,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:48,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 69 states. [2018-11-23 11:55:48,966 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 69 states. [2018-11-23 11:55:48,966 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 69 states. [2018-11-23 11:55:48,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:48,968 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2018-11-23 11:55:48,968 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2018-11-23 11:55:48,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:48,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:48,969 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 71 states. [2018-11-23 11:55:48,969 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 71 states. [2018-11-23 11:55:48,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:48,970 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2018-11-23 11:55:48,970 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2018-11-23 11:55:48,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:48,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:48,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:48,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:48,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 11:55:48,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2018-11-23 11:55:48,973 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 61 [2018-11-23 11:55:48,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:48,973 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2018-11-23 11:55:48,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:55:48,973 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2018-11-23 11:55:48,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 11:55:48,974 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:48,974 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:48,974 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:48,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:48,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1712586467, now seen corresponding path program 17 times [2018-11-23 11:55:48,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:48,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:48,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:48,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:48,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:49,310 INFO L256 TraceCheckUtils]: 0: Hoare triple {6167#true} call ULTIMATE.init(); {6167#true} is VALID [2018-11-23 11:55:49,310 INFO L273 TraceCheckUtils]: 1: Hoare triple {6167#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6167#true} is VALID [2018-11-23 11:55:49,311 INFO L273 TraceCheckUtils]: 2: Hoare triple {6167#true} assume true; {6167#true} is VALID [2018-11-23 11:55:49,311 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6167#true} {6167#true} #55#return; {6167#true} is VALID [2018-11-23 11:55:49,311 INFO L256 TraceCheckUtils]: 4: Hoare triple {6167#true} call #t~ret4 := main(); {6167#true} is VALID [2018-11-23 11:55:49,312 INFO L273 TraceCheckUtils]: 5: Hoare triple {6167#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {6169#(= main_~i~0 0)} is VALID [2018-11-23 11:55:49,312 INFO L273 TraceCheckUtils]: 6: Hoare triple {6169#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6169#(= main_~i~0 0)} is VALID [2018-11-23 11:55:49,313 INFO L273 TraceCheckUtils]: 7: Hoare triple {6169#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6169#(= main_~i~0 0)} is VALID [2018-11-23 11:55:49,313 INFO L273 TraceCheckUtils]: 8: Hoare triple {6169#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {6170#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:49,314 INFO L273 TraceCheckUtils]: 9: Hoare triple {6170#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6170#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:49,314 INFO L273 TraceCheckUtils]: 10: Hoare triple {6170#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6170#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:49,314 INFO L273 TraceCheckUtils]: 11: Hoare triple {6170#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {6171#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:49,315 INFO L273 TraceCheckUtils]: 12: Hoare triple {6171#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6171#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:49,315 INFO L273 TraceCheckUtils]: 13: Hoare triple {6171#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6171#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:49,316 INFO L273 TraceCheckUtils]: 14: Hoare triple {6171#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {6172#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:49,317 INFO L273 TraceCheckUtils]: 15: Hoare triple {6172#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6172#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:49,317 INFO L273 TraceCheckUtils]: 16: Hoare triple {6172#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6172#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:49,318 INFO L273 TraceCheckUtils]: 17: Hoare triple {6172#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {6173#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:49,318 INFO L273 TraceCheckUtils]: 18: Hoare triple {6173#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6173#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:49,319 INFO L273 TraceCheckUtils]: 19: Hoare triple {6173#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6173#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:49,320 INFO L273 TraceCheckUtils]: 20: Hoare triple {6173#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {6174#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:49,320 INFO L273 TraceCheckUtils]: 21: Hoare triple {6174#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6174#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:49,321 INFO L273 TraceCheckUtils]: 22: Hoare triple {6174#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6174#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:49,322 INFO L273 TraceCheckUtils]: 23: Hoare triple {6174#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {6175#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:49,322 INFO L273 TraceCheckUtils]: 24: Hoare triple {6175#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6175#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:49,323 INFO L273 TraceCheckUtils]: 25: Hoare triple {6175#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6175#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:49,324 INFO L273 TraceCheckUtils]: 26: Hoare triple {6175#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {6176#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:49,324 INFO L273 TraceCheckUtils]: 27: Hoare triple {6176#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6176#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:49,325 INFO L273 TraceCheckUtils]: 28: Hoare triple {6176#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6176#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:49,325 INFO L273 TraceCheckUtils]: 29: Hoare triple {6176#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {6177#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:49,326 INFO L273 TraceCheckUtils]: 30: Hoare triple {6177#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6177#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:49,348 INFO L273 TraceCheckUtils]: 31: Hoare triple {6177#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6177#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:49,365 INFO L273 TraceCheckUtils]: 32: Hoare triple {6177#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {6178#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:49,370 INFO L273 TraceCheckUtils]: 33: Hoare triple {6178#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6178#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:49,370 INFO L273 TraceCheckUtils]: 34: Hoare triple {6178#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6178#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:49,371 INFO L273 TraceCheckUtils]: 35: Hoare triple {6178#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {6179#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:49,371 INFO L273 TraceCheckUtils]: 36: Hoare triple {6179#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6179#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:49,371 INFO L273 TraceCheckUtils]: 37: Hoare triple {6179#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6179#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:49,372 INFO L273 TraceCheckUtils]: 38: Hoare triple {6179#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {6180#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:49,372 INFO L273 TraceCheckUtils]: 39: Hoare triple {6180#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6180#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:49,372 INFO L273 TraceCheckUtils]: 40: Hoare triple {6180#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6180#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:49,373 INFO L273 TraceCheckUtils]: 41: Hoare triple {6180#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {6181#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:49,373 INFO L273 TraceCheckUtils]: 42: Hoare triple {6181#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6181#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:49,374 INFO L273 TraceCheckUtils]: 43: Hoare triple {6181#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6181#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:49,375 INFO L273 TraceCheckUtils]: 44: Hoare triple {6181#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {6182#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:49,375 INFO L273 TraceCheckUtils]: 45: Hoare triple {6182#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6182#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:49,376 INFO L273 TraceCheckUtils]: 46: Hoare triple {6182#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6182#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:49,376 INFO L273 TraceCheckUtils]: 47: Hoare triple {6182#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {6183#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:49,377 INFO L273 TraceCheckUtils]: 48: Hoare triple {6183#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6183#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:49,378 INFO L273 TraceCheckUtils]: 49: Hoare triple {6183#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6183#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:49,378 INFO L273 TraceCheckUtils]: 50: Hoare triple {6183#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {6184#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:49,379 INFO L273 TraceCheckUtils]: 51: Hoare triple {6184#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6184#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:49,379 INFO L273 TraceCheckUtils]: 52: Hoare triple {6184#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6184#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:49,380 INFO L273 TraceCheckUtils]: 53: Hoare triple {6184#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {6185#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:49,381 INFO L273 TraceCheckUtils]: 54: Hoare triple {6185#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6185#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:49,381 INFO L273 TraceCheckUtils]: 55: Hoare triple {6185#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6185#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:49,382 INFO L273 TraceCheckUtils]: 56: Hoare triple {6185#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {6186#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:49,383 INFO L273 TraceCheckUtils]: 57: Hoare triple {6186#(<= main_~i~0 17)} assume !(~i~0 < 100000); {6168#false} is VALID [2018-11-23 11:55:49,383 INFO L273 TraceCheckUtils]: 58: Hoare triple {6168#false} havoc ~x~0;~x~0 := 0; {6168#false} is VALID [2018-11-23 11:55:49,383 INFO L273 TraceCheckUtils]: 59: Hoare triple {6168#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6168#false} is VALID [2018-11-23 11:55:49,383 INFO L256 TraceCheckUtils]: 60: Hoare triple {6168#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {6168#false} is VALID [2018-11-23 11:55:49,383 INFO L273 TraceCheckUtils]: 61: Hoare triple {6168#false} ~cond := #in~cond; {6168#false} is VALID [2018-11-23 11:55:49,384 INFO L273 TraceCheckUtils]: 62: Hoare triple {6168#false} assume 0 == ~cond; {6168#false} is VALID [2018-11-23 11:55:49,384 INFO L273 TraceCheckUtils]: 63: Hoare triple {6168#false} assume !false; {6168#false} is VALID [2018-11-23 11:55:49,388 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:49,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:49,388 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:49,396 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:55:49,434 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-23 11:55:49,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:49,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:49,800 INFO L256 TraceCheckUtils]: 0: Hoare triple {6167#true} call ULTIMATE.init(); {6167#true} is VALID [2018-11-23 11:55:49,801 INFO L273 TraceCheckUtils]: 1: Hoare triple {6167#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6167#true} is VALID [2018-11-23 11:55:49,801 INFO L273 TraceCheckUtils]: 2: Hoare triple {6167#true} assume true; {6167#true} is VALID [2018-11-23 11:55:49,801 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6167#true} {6167#true} #55#return; {6167#true} is VALID [2018-11-23 11:55:49,801 INFO L256 TraceCheckUtils]: 4: Hoare triple {6167#true} call #t~ret4 := main(); {6167#true} is VALID [2018-11-23 11:55:49,802 INFO L273 TraceCheckUtils]: 5: Hoare triple {6167#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {6205#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:49,803 INFO L273 TraceCheckUtils]: 6: Hoare triple {6205#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6205#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:49,803 INFO L273 TraceCheckUtils]: 7: Hoare triple {6205#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6205#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:49,804 INFO L273 TraceCheckUtils]: 8: Hoare triple {6205#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {6170#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:49,804 INFO L273 TraceCheckUtils]: 9: Hoare triple {6170#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6170#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:49,804 INFO L273 TraceCheckUtils]: 10: Hoare triple {6170#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6170#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:49,805 INFO L273 TraceCheckUtils]: 11: Hoare triple {6170#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {6171#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:49,805 INFO L273 TraceCheckUtils]: 12: Hoare triple {6171#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6171#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:49,805 INFO L273 TraceCheckUtils]: 13: Hoare triple {6171#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6171#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:49,806 INFO L273 TraceCheckUtils]: 14: Hoare triple {6171#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {6172#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:49,806 INFO L273 TraceCheckUtils]: 15: Hoare triple {6172#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6172#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:49,807 INFO L273 TraceCheckUtils]: 16: Hoare triple {6172#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6172#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:49,808 INFO L273 TraceCheckUtils]: 17: Hoare triple {6172#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {6173#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:49,808 INFO L273 TraceCheckUtils]: 18: Hoare triple {6173#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6173#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:49,809 INFO L273 TraceCheckUtils]: 19: Hoare triple {6173#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6173#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:49,828 INFO L273 TraceCheckUtils]: 20: Hoare triple {6173#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {6174#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:49,828 INFO L273 TraceCheckUtils]: 21: Hoare triple {6174#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6174#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:49,829 INFO L273 TraceCheckUtils]: 22: Hoare triple {6174#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6174#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:49,829 INFO L273 TraceCheckUtils]: 23: Hoare triple {6174#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {6175#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:49,830 INFO L273 TraceCheckUtils]: 24: Hoare triple {6175#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6175#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:49,830 INFO L273 TraceCheckUtils]: 25: Hoare triple {6175#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6175#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:49,830 INFO L273 TraceCheckUtils]: 26: Hoare triple {6175#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {6176#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:49,831 INFO L273 TraceCheckUtils]: 27: Hoare triple {6176#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6176#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:49,831 INFO L273 TraceCheckUtils]: 28: Hoare triple {6176#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6176#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:49,832 INFO L273 TraceCheckUtils]: 29: Hoare triple {6176#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {6177#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:49,832 INFO L273 TraceCheckUtils]: 30: Hoare triple {6177#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6177#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:49,833 INFO L273 TraceCheckUtils]: 31: Hoare triple {6177#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6177#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:49,834 INFO L273 TraceCheckUtils]: 32: Hoare triple {6177#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {6178#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:49,834 INFO L273 TraceCheckUtils]: 33: Hoare triple {6178#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6178#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:49,835 INFO L273 TraceCheckUtils]: 34: Hoare triple {6178#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6178#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:49,836 INFO L273 TraceCheckUtils]: 35: Hoare triple {6178#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {6179#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:49,836 INFO L273 TraceCheckUtils]: 36: Hoare triple {6179#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6179#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:49,837 INFO L273 TraceCheckUtils]: 37: Hoare triple {6179#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6179#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:49,837 INFO L273 TraceCheckUtils]: 38: Hoare triple {6179#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {6180#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:49,838 INFO L273 TraceCheckUtils]: 39: Hoare triple {6180#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6180#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:49,838 INFO L273 TraceCheckUtils]: 40: Hoare triple {6180#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6180#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:49,839 INFO L273 TraceCheckUtils]: 41: Hoare triple {6180#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {6181#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:49,840 INFO L273 TraceCheckUtils]: 42: Hoare triple {6181#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6181#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:49,840 INFO L273 TraceCheckUtils]: 43: Hoare triple {6181#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6181#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:49,841 INFO L273 TraceCheckUtils]: 44: Hoare triple {6181#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {6182#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:49,841 INFO L273 TraceCheckUtils]: 45: Hoare triple {6182#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6182#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:49,842 INFO L273 TraceCheckUtils]: 46: Hoare triple {6182#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6182#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:49,843 INFO L273 TraceCheckUtils]: 47: Hoare triple {6182#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {6183#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:49,843 INFO L273 TraceCheckUtils]: 48: Hoare triple {6183#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6183#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:49,844 INFO L273 TraceCheckUtils]: 49: Hoare triple {6183#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6183#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:49,845 INFO L273 TraceCheckUtils]: 50: Hoare triple {6183#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {6184#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:49,845 INFO L273 TraceCheckUtils]: 51: Hoare triple {6184#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6184#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:49,846 INFO L273 TraceCheckUtils]: 52: Hoare triple {6184#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6184#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:49,846 INFO L273 TraceCheckUtils]: 53: Hoare triple {6184#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {6185#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:49,847 INFO L273 TraceCheckUtils]: 54: Hoare triple {6185#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6185#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:49,847 INFO L273 TraceCheckUtils]: 55: Hoare triple {6185#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6185#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:49,848 INFO L273 TraceCheckUtils]: 56: Hoare triple {6185#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {6186#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:49,849 INFO L273 TraceCheckUtils]: 57: Hoare triple {6186#(<= main_~i~0 17)} assume !(~i~0 < 100000); {6168#false} is VALID [2018-11-23 11:55:49,849 INFO L273 TraceCheckUtils]: 58: Hoare triple {6168#false} havoc ~x~0;~x~0 := 0; {6168#false} is VALID [2018-11-23 11:55:49,849 INFO L273 TraceCheckUtils]: 59: Hoare triple {6168#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6168#false} is VALID [2018-11-23 11:55:49,849 INFO L256 TraceCheckUtils]: 60: Hoare triple {6168#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {6168#false} is VALID [2018-11-23 11:55:49,850 INFO L273 TraceCheckUtils]: 61: Hoare triple {6168#false} ~cond := #in~cond; {6168#false} is VALID [2018-11-23 11:55:49,850 INFO L273 TraceCheckUtils]: 62: Hoare triple {6168#false} assume 0 == ~cond; {6168#false} is VALID [2018-11-23 11:55:49,850 INFO L273 TraceCheckUtils]: 63: Hoare triple {6168#false} assume !false; {6168#false} is VALID [2018-11-23 11:55:49,855 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:49,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:49,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 11:55:49,874 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-11-23 11:55:49,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:49,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 11:55:49,951 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:49,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 11:55:49,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 11:55:49,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:55:49,953 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand 21 states. [2018-11-23 11:55:50,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:50,304 INFO L93 Difference]: Finished difference Result 85 states and 106 transitions. [2018-11-23 11:55:50,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:55:50,304 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-11-23 11:55:50,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:50,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:55:50,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 106 transitions. [2018-11-23 11:55:50,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:55:50,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 106 transitions. [2018-11-23 11:55:50,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 106 transitions. [2018-11-23 11:55:50,457 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:50,459 INFO L225 Difference]: With dead ends: 85 [2018-11-23 11:55:50,459 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 11:55:50,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:55:50,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 11:55:50,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-11-23 11:55:50,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:50,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 72 states. [2018-11-23 11:55:50,489 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 72 states. [2018-11-23 11:55:50,489 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 72 states. [2018-11-23 11:55:50,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:50,491 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2018-11-23 11:55:50,491 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2018-11-23 11:55:50,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:50,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:50,492 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 74 states. [2018-11-23 11:55:50,492 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 74 states. [2018-11-23 11:55:50,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:50,493 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2018-11-23 11:55:50,493 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2018-11-23 11:55:50,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:50,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:50,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:50,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:50,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 11:55:50,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2018-11-23 11:55:50,496 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 64 [2018-11-23 11:55:50,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:50,496 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2018-11-23 11:55:50,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 11:55:50,496 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2018-11-23 11:55:50,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 11:55:50,497 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:50,497 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:50,497 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:50,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:50,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1207704967, now seen corresponding path program 18 times [2018-11-23 11:55:50,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:50,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:50,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:50,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:50,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:50,939 INFO L256 TraceCheckUtils]: 0: Hoare triple {6739#true} call ULTIMATE.init(); {6739#true} is VALID [2018-11-23 11:55:50,939 INFO L273 TraceCheckUtils]: 1: Hoare triple {6739#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6739#true} is VALID [2018-11-23 11:55:50,939 INFO L273 TraceCheckUtils]: 2: Hoare triple {6739#true} assume true; {6739#true} is VALID [2018-11-23 11:55:50,940 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6739#true} {6739#true} #55#return; {6739#true} is VALID [2018-11-23 11:55:50,940 INFO L256 TraceCheckUtils]: 4: Hoare triple {6739#true} call #t~ret4 := main(); {6739#true} is VALID [2018-11-23 11:55:50,940 INFO L273 TraceCheckUtils]: 5: Hoare triple {6739#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {6741#(= main_~i~0 0)} is VALID [2018-11-23 11:55:50,941 INFO L273 TraceCheckUtils]: 6: Hoare triple {6741#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6741#(= main_~i~0 0)} is VALID [2018-11-23 11:55:50,941 INFO L273 TraceCheckUtils]: 7: Hoare triple {6741#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6741#(= main_~i~0 0)} is VALID [2018-11-23 11:55:50,942 INFO L273 TraceCheckUtils]: 8: Hoare triple {6741#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {6742#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:50,942 INFO L273 TraceCheckUtils]: 9: Hoare triple {6742#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6742#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:50,942 INFO L273 TraceCheckUtils]: 10: Hoare triple {6742#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6742#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:50,943 INFO L273 TraceCheckUtils]: 11: Hoare triple {6742#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {6743#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:50,943 INFO L273 TraceCheckUtils]: 12: Hoare triple {6743#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6743#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:50,944 INFO L273 TraceCheckUtils]: 13: Hoare triple {6743#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6743#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:50,944 INFO L273 TraceCheckUtils]: 14: Hoare triple {6743#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {6744#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:50,945 INFO L273 TraceCheckUtils]: 15: Hoare triple {6744#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6744#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:50,945 INFO L273 TraceCheckUtils]: 16: Hoare triple {6744#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6744#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:50,946 INFO L273 TraceCheckUtils]: 17: Hoare triple {6744#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {6745#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:50,946 INFO L273 TraceCheckUtils]: 18: Hoare triple {6745#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6745#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:50,947 INFO L273 TraceCheckUtils]: 19: Hoare triple {6745#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6745#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:50,948 INFO L273 TraceCheckUtils]: 20: Hoare triple {6745#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {6746#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:50,948 INFO L273 TraceCheckUtils]: 21: Hoare triple {6746#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6746#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:50,949 INFO L273 TraceCheckUtils]: 22: Hoare triple {6746#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6746#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:50,950 INFO L273 TraceCheckUtils]: 23: Hoare triple {6746#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {6747#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:50,950 INFO L273 TraceCheckUtils]: 24: Hoare triple {6747#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6747#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:50,951 INFO L273 TraceCheckUtils]: 25: Hoare triple {6747#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6747#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:50,951 INFO L273 TraceCheckUtils]: 26: Hoare triple {6747#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {6748#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:50,952 INFO L273 TraceCheckUtils]: 27: Hoare triple {6748#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6748#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:50,952 INFO L273 TraceCheckUtils]: 28: Hoare triple {6748#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6748#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:50,953 INFO L273 TraceCheckUtils]: 29: Hoare triple {6748#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {6749#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:50,954 INFO L273 TraceCheckUtils]: 30: Hoare triple {6749#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6749#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:50,954 INFO L273 TraceCheckUtils]: 31: Hoare triple {6749#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6749#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:50,955 INFO L273 TraceCheckUtils]: 32: Hoare triple {6749#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {6750#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:50,955 INFO L273 TraceCheckUtils]: 33: Hoare triple {6750#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6750#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:50,956 INFO L273 TraceCheckUtils]: 34: Hoare triple {6750#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6750#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:50,956 INFO L273 TraceCheckUtils]: 35: Hoare triple {6750#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {6751#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:50,957 INFO L273 TraceCheckUtils]: 36: Hoare triple {6751#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6751#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:50,957 INFO L273 TraceCheckUtils]: 37: Hoare triple {6751#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6751#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:50,958 INFO L273 TraceCheckUtils]: 38: Hoare triple {6751#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {6752#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:50,959 INFO L273 TraceCheckUtils]: 39: Hoare triple {6752#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6752#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:50,959 INFO L273 TraceCheckUtils]: 40: Hoare triple {6752#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6752#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:50,960 INFO L273 TraceCheckUtils]: 41: Hoare triple {6752#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {6753#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:50,960 INFO L273 TraceCheckUtils]: 42: Hoare triple {6753#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6753#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:50,961 INFO L273 TraceCheckUtils]: 43: Hoare triple {6753#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6753#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:50,962 INFO L273 TraceCheckUtils]: 44: Hoare triple {6753#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {6754#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:50,962 INFO L273 TraceCheckUtils]: 45: Hoare triple {6754#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6754#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:50,963 INFO L273 TraceCheckUtils]: 46: Hoare triple {6754#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6754#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:50,963 INFO L273 TraceCheckUtils]: 47: Hoare triple {6754#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {6755#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:50,964 INFO L273 TraceCheckUtils]: 48: Hoare triple {6755#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6755#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:50,964 INFO L273 TraceCheckUtils]: 49: Hoare triple {6755#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6755#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:50,965 INFO L273 TraceCheckUtils]: 50: Hoare triple {6755#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {6756#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:50,966 INFO L273 TraceCheckUtils]: 51: Hoare triple {6756#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6756#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:50,966 INFO L273 TraceCheckUtils]: 52: Hoare triple {6756#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6756#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:50,967 INFO L273 TraceCheckUtils]: 53: Hoare triple {6756#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {6757#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:50,967 INFO L273 TraceCheckUtils]: 54: Hoare triple {6757#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6757#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:50,968 INFO L273 TraceCheckUtils]: 55: Hoare triple {6757#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6757#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:50,968 INFO L273 TraceCheckUtils]: 56: Hoare triple {6757#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {6758#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:50,969 INFO L273 TraceCheckUtils]: 57: Hoare triple {6758#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6758#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:50,969 INFO L273 TraceCheckUtils]: 58: Hoare triple {6758#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6758#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:50,970 INFO L273 TraceCheckUtils]: 59: Hoare triple {6758#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {6759#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:50,971 INFO L273 TraceCheckUtils]: 60: Hoare triple {6759#(<= main_~i~0 18)} assume !(~i~0 < 100000); {6740#false} is VALID [2018-11-23 11:55:50,971 INFO L273 TraceCheckUtils]: 61: Hoare triple {6740#false} havoc ~x~0;~x~0 := 0; {6740#false} is VALID [2018-11-23 11:55:50,971 INFO L273 TraceCheckUtils]: 62: Hoare triple {6740#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6740#false} is VALID [2018-11-23 11:55:50,971 INFO L256 TraceCheckUtils]: 63: Hoare triple {6740#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {6740#false} is VALID [2018-11-23 11:55:50,972 INFO L273 TraceCheckUtils]: 64: Hoare triple {6740#false} ~cond := #in~cond; {6740#false} is VALID [2018-11-23 11:55:50,972 INFO L273 TraceCheckUtils]: 65: Hoare triple {6740#false} assume 0 == ~cond; {6740#false} is VALID [2018-11-23 11:55:50,972 INFO L273 TraceCheckUtils]: 66: Hoare triple {6740#false} assume !false; {6740#false} is VALID [2018-11-23 11:55:50,976 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:50,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:50,976 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:50,987 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:55:51,028 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 11:55:51,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:51,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:51,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:51,234 INFO L256 TraceCheckUtils]: 0: Hoare triple {6739#true} call ULTIMATE.init(); {6739#true} is VALID [2018-11-23 11:55:51,235 INFO L273 TraceCheckUtils]: 1: Hoare triple {6739#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6739#true} is VALID [2018-11-23 11:55:51,235 INFO L273 TraceCheckUtils]: 2: Hoare triple {6739#true} assume true; {6739#true} is VALID [2018-11-23 11:55:51,235 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6739#true} {6739#true} #55#return; {6739#true} is VALID [2018-11-23 11:55:51,235 INFO L256 TraceCheckUtils]: 4: Hoare triple {6739#true} call #t~ret4 := main(); {6739#true} is VALID [2018-11-23 11:55:51,236 INFO L273 TraceCheckUtils]: 5: Hoare triple {6739#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {6778#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:51,237 INFO L273 TraceCheckUtils]: 6: Hoare triple {6778#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6778#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:51,237 INFO L273 TraceCheckUtils]: 7: Hoare triple {6778#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6778#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:51,237 INFO L273 TraceCheckUtils]: 8: Hoare triple {6778#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {6742#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:51,238 INFO L273 TraceCheckUtils]: 9: Hoare triple {6742#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6742#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:51,238 INFO L273 TraceCheckUtils]: 10: Hoare triple {6742#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6742#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:51,238 INFO L273 TraceCheckUtils]: 11: Hoare triple {6742#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {6743#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:51,239 INFO L273 TraceCheckUtils]: 12: Hoare triple {6743#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6743#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:51,239 INFO L273 TraceCheckUtils]: 13: Hoare triple {6743#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6743#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:51,240 INFO L273 TraceCheckUtils]: 14: Hoare triple {6743#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {6744#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:51,241 INFO L273 TraceCheckUtils]: 15: Hoare triple {6744#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6744#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:51,241 INFO L273 TraceCheckUtils]: 16: Hoare triple {6744#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6744#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:51,242 INFO L273 TraceCheckUtils]: 17: Hoare triple {6744#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {6745#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:51,243 INFO L273 TraceCheckUtils]: 18: Hoare triple {6745#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6745#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:51,243 INFO L273 TraceCheckUtils]: 19: Hoare triple {6745#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6745#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:51,244 INFO L273 TraceCheckUtils]: 20: Hoare triple {6745#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {6746#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:51,244 INFO L273 TraceCheckUtils]: 21: Hoare triple {6746#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6746#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:51,245 INFO L273 TraceCheckUtils]: 22: Hoare triple {6746#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6746#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:51,246 INFO L273 TraceCheckUtils]: 23: Hoare triple {6746#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {6747#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:51,246 INFO L273 TraceCheckUtils]: 24: Hoare triple {6747#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6747#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:51,247 INFO L273 TraceCheckUtils]: 25: Hoare triple {6747#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6747#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:51,247 INFO L273 TraceCheckUtils]: 26: Hoare triple {6747#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {6748#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:51,248 INFO L273 TraceCheckUtils]: 27: Hoare triple {6748#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6748#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:51,248 INFO L273 TraceCheckUtils]: 28: Hoare triple {6748#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6748#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:51,249 INFO L273 TraceCheckUtils]: 29: Hoare triple {6748#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {6749#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:51,250 INFO L273 TraceCheckUtils]: 30: Hoare triple {6749#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6749#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:51,250 INFO L273 TraceCheckUtils]: 31: Hoare triple {6749#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6749#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:51,251 INFO L273 TraceCheckUtils]: 32: Hoare triple {6749#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {6750#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:51,251 INFO L273 TraceCheckUtils]: 33: Hoare triple {6750#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6750#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:51,252 INFO L273 TraceCheckUtils]: 34: Hoare triple {6750#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6750#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:51,253 INFO L273 TraceCheckUtils]: 35: Hoare triple {6750#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {6751#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:51,253 INFO L273 TraceCheckUtils]: 36: Hoare triple {6751#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6751#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:51,254 INFO L273 TraceCheckUtils]: 37: Hoare triple {6751#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6751#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:51,255 INFO L273 TraceCheckUtils]: 38: Hoare triple {6751#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {6752#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:51,255 INFO L273 TraceCheckUtils]: 39: Hoare triple {6752#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6752#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:51,256 INFO L273 TraceCheckUtils]: 40: Hoare triple {6752#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6752#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:51,256 INFO L273 TraceCheckUtils]: 41: Hoare triple {6752#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {6753#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:51,257 INFO L273 TraceCheckUtils]: 42: Hoare triple {6753#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6753#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:51,257 INFO L273 TraceCheckUtils]: 43: Hoare triple {6753#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6753#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:51,258 INFO L273 TraceCheckUtils]: 44: Hoare triple {6753#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {6754#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:51,259 INFO L273 TraceCheckUtils]: 45: Hoare triple {6754#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6754#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:51,259 INFO L273 TraceCheckUtils]: 46: Hoare triple {6754#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6754#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:51,260 INFO L273 TraceCheckUtils]: 47: Hoare triple {6754#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {6755#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:51,260 INFO L273 TraceCheckUtils]: 48: Hoare triple {6755#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6755#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:51,261 INFO L273 TraceCheckUtils]: 49: Hoare triple {6755#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6755#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:51,262 INFO L273 TraceCheckUtils]: 50: Hoare triple {6755#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {6756#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:51,262 INFO L273 TraceCheckUtils]: 51: Hoare triple {6756#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6756#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:51,263 INFO L273 TraceCheckUtils]: 52: Hoare triple {6756#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6756#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:51,263 INFO L273 TraceCheckUtils]: 53: Hoare triple {6756#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {6757#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:51,264 INFO L273 TraceCheckUtils]: 54: Hoare triple {6757#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6757#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:51,265 INFO L273 TraceCheckUtils]: 55: Hoare triple {6757#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6757#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:51,265 INFO L273 TraceCheckUtils]: 56: Hoare triple {6757#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {6758#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:51,266 INFO L273 TraceCheckUtils]: 57: Hoare triple {6758#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6758#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:51,266 INFO L273 TraceCheckUtils]: 58: Hoare triple {6758#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {6758#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:51,267 INFO L273 TraceCheckUtils]: 59: Hoare triple {6758#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {6759#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:51,268 INFO L273 TraceCheckUtils]: 60: Hoare triple {6759#(<= main_~i~0 18)} assume !(~i~0 < 100000); {6740#false} is VALID [2018-11-23 11:55:51,268 INFO L273 TraceCheckUtils]: 61: Hoare triple {6740#false} havoc ~x~0;~x~0 := 0; {6740#false} is VALID [2018-11-23 11:55:51,268 INFO L273 TraceCheckUtils]: 62: Hoare triple {6740#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6740#false} is VALID [2018-11-23 11:55:51,268 INFO L256 TraceCheckUtils]: 63: Hoare triple {6740#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {6740#false} is VALID [2018-11-23 11:55:51,269 INFO L273 TraceCheckUtils]: 64: Hoare triple {6740#false} ~cond := #in~cond; {6740#false} is VALID [2018-11-23 11:55:51,269 INFO L273 TraceCheckUtils]: 65: Hoare triple {6740#false} assume 0 == ~cond; {6740#false} is VALID [2018-11-23 11:55:51,269 INFO L273 TraceCheckUtils]: 66: Hoare triple {6740#false} assume !false; {6740#false} is VALID [2018-11-23 11:55:51,274 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:51,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:51,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 11:55:51,293 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2018-11-23 11:55:51,293 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:51,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:55:51,360 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:51,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:55:51,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:55:51,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:55:51,361 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand 22 states. [2018-11-23 11:55:52,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:52,081 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2018-11-23 11:55:52,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 11:55:52,081 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2018-11-23 11:55:52,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:52,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:55:52,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 110 transitions. [2018-11-23 11:55:52,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:55:52,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 110 transitions. [2018-11-23 11:55:52,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 110 transitions. [2018-11-23 11:55:52,182 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:52,184 INFO L225 Difference]: With dead ends: 88 [2018-11-23 11:55:52,184 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 11:55:52,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:55:52,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 11:55:52,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-11-23 11:55:52,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:52,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 75 states. [2018-11-23 11:55:52,217 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 75 states. [2018-11-23 11:55:52,217 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 75 states. [2018-11-23 11:55:52,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:52,219 INFO L93 Difference]: Finished difference Result 77 states and 98 transitions. [2018-11-23 11:55:52,219 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2018-11-23 11:55:52,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:52,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:52,220 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 77 states. [2018-11-23 11:55:52,220 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 77 states. [2018-11-23 11:55:52,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:52,221 INFO L93 Difference]: Finished difference Result 77 states and 98 transitions. [2018-11-23 11:55:52,222 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2018-11-23 11:55:52,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:52,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:52,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:52,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:52,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 11:55:52,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 95 transitions. [2018-11-23 11:55:52,224 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 95 transitions. Word has length 67 [2018-11-23 11:55:52,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:52,224 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 95 transitions. [2018-11-23 11:55:52,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:55:52,224 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2018-11-23 11:55:52,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 11:55:52,225 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:52,225 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:52,225 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:52,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:52,226 INFO L82 PathProgramCache]: Analyzing trace with hash -752267485, now seen corresponding path program 19 times [2018-11-23 11:55:52,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:52,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:52,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:52,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:52,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:52,585 INFO L256 TraceCheckUtils]: 0: Hoare triple {7335#true} call ULTIMATE.init(); {7335#true} is VALID [2018-11-23 11:55:52,585 INFO L273 TraceCheckUtils]: 1: Hoare triple {7335#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7335#true} is VALID [2018-11-23 11:55:52,585 INFO L273 TraceCheckUtils]: 2: Hoare triple {7335#true} assume true; {7335#true} is VALID [2018-11-23 11:55:52,585 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7335#true} {7335#true} #55#return; {7335#true} is VALID [2018-11-23 11:55:52,586 INFO L256 TraceCheckUtils]: 4: Hoare triple {7335#true} call #t~ret4 := main(); {7335#true} is VALID [2018-11-23 11:55:52,586 INFO L273 TraceCheckUtils]: 5: Hoare triple {7335#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {7337#(= main_~i~0 0)} is VALID [2018-11-23 11:55:52,587 INFO L273 TraceCheckUtils]: 6: Hoare triple {7337#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7337#(= main_~i~0 0)} is VALID [2018-11-23 11:55:52,587 INFO L273 TraceCheckUtils]: 7: Hoare triple {7337#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7337#(= main_~i~0 0)} is VALID [2018-11-23 11:55:52,588 INFO L273 TraceCheckUtils]: 8: Hoare triple {7337#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {7338#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:52,588 INFO L273 TraceCheckUtils]: 9: Hoare triple {7338#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7338#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:52,588 INFO L273 TraceCheckUtils]: 10: Hoare triple {7338#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7338#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:52,589 INFO L273 TraceCheckUtils]: 11: Hoare triple {7338#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {7339#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:52,589 INFO L273 TraceCheckUtils]: 12: Hoare triple {7339#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7339#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:52,589 INFO L273 TraceCheckUtils]: 13: Hoare triple {7339#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7339#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:52,590 INFO L273 TraceCheckUtils]: 14: Hoare triple {7339#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {7340#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:52,591 INFO L273 TraceCheckUtils]: 15: Hoare triple {7340#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7340#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:52,591 INFO L273 TraceCheckUtils]: 16: Hoare triple {7340#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7340#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:52,592 INFO L273 TraceCheckUtils]: 17: Hoare triple {7340#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {7341#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:52,592 INFO L273 TraceCheckUtils]: 18: Hoare triple {7341#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7341#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:52,593 INFO L273 TraceCheckUtils]: 19: Hoare triple {7341#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7341#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:52,593 INFO L273 TraceCheckUtils]: 20: Hoare triple {7341#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {7342#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:52,594 INFO L273 TraceCheckUtils]: 21: Hoare triple {7342#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7342#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:52,594 INFO L273 TraceCheckUtils]: 22: Hoare triple {7342#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7342#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:52,595 INFO L273 TraceCheckUtils]: 23: Hoare triple {7342#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {7343#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:52,596 INFO L273 TraceCheckUtils]: 24: Hoare triple {7343#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7343#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:52,596 INFO L273 TraceCheckUtils]: 25: Hoare triple {7343#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7343#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:52,597 INFO L273 TraceCheckUtils]: 26: Hoare triple {7343#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {7344#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:52,597 INFO L273 TraceCheckUtils]: 27: Hoare triple {7344#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7344#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:52,598 INFO L273 TraceCheckUtils]: 28: Hoare triple {7344#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7344#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:52,598 INFO L273 TraceCheckUtils]: 29: Hoare triple {7344#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {7345#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:52,599 INFO L273 TraceCheckUtils]: 30: Hoare triple {7345#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7345#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:52,599 INFO L273 TraceCheckUtils]: 31: Hoare triple {7345#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7345#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:52,600 INFO L273 TraceCheckUtils]: 32: Hoare triple {7345#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {7346#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:52,601 INFO L273 TraceCheckUtils]: 33: Hoare triple {7346#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7346#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:52,601 INFO L273 TraceCheckUtils]: 34: Hoare triple {7346#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7346#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:52,602 INFO L273 TraceCheckUtils]: 35: Hoare triple {7346#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {7347#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:52,602 INFO L273 TraceCheckUtils]: 36: Hoare triple {7347#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7347#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:52,603 INFO L273 TraceCheckUtils]: 37: Hoare triple {7347#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7347#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:52,603 INFO L273 TraceCheckUtils]: 38: Hoare triple {7347#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {7348#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:52,604 INFO L273 TraceCheckUtils]: 39: Hoare triple {7348#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7348#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:52,604 INFO L273 TraceCheckUtils]: 40: Hoare triple {7348#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7348#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:52,605 INFO L273 TraceCheckUtils]: 41: Hoare triple {7348#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {7349#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:52,606 INFO L273 TraceCheckUtils]: 42: Hoare triple {7349#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7349#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:52,606 INFO L273 TraceCheckUtils]: 43: Hoare triple {7349#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7349#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:52,607 INFO L273 TraceCheckUtils]: 44: Hoare triple {7349#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {7350#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:52,607 INFO L273 TraceCheckUtils]: 45: Hoare triple {7350#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7350#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:52,608 INFO L273 TraceCheckUtils]: 46: Hoare triple {7350#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7350#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:52,608 INFO L273 TraceCheckUtils]: 47: Hoare triple {7350#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {7351#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:52,609 INFO L273 TraceCheckUtils]: 48: Hoare triple {7351#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7351#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:52,609 INFO L273 TraceCheckUtils]: 49: Hoare triple {7351#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7351#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:52,610 INFO L273 TraceCheckUtils]: 50: Hoare triple {7351#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {7352#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:52,611 INFO L273 TraceCheckUtils]: 51: Hoare triple {7352#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7352#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:52,611 INFO L273 TraceCheckUtils]: 52: Hoare triple {7352#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7352#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:52,612 INFO L273 TraceCheckUtils]: 53: Hoare triple {7352#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {7353#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:52,612 INFO L273 TraceCheckUtils]: 54: Hoare triple {7353#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7353#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:52,613 INFO L273 TraceCheckUtils]: 55: Hoare triple {7353#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7353#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:52,613 INFO L273 TraceCheckUtils]: 56: Hoare triple {7353#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {7354#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:52,614 INFO L273 TraceCheckUtils]: 57: Hoare triple {7354#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7354#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:52,614 INFO L273 TraceCheckUtils]: 58: Hoare triple {7354#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7354#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:52,615 INFO L273 TraceCheckUtils]: 59: Hoare triple {7354#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {7355#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:52,616 INFO L273 TraceCheckUtils]: 60: Hoare triple {7355#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7355#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:52,616 INFO L273 TraceCheckUtils]: 61: Hoare triple {7355#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7355#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:52,617 INFO L273 TraceCheckUtils]: 62: Hoare triple {7355#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {7356#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:52,618 INFO L273 TraceCheckUtils]: 63: Hoare triple {7356#(<= main_~i~0 19)} assume !(~i~0 < 100000); {7336#false} is VALID [2018-11-23 11:55:52,618 INFO L273 TraceCheckUtils]: 64: Hoare triple {7336#false} havoc ~x~0;~x~0 := 0; {7336#false} is VALID [2018-11-23 11:55:52,618 INFO L273 TraceCheckUtils]: 65: Hoare triple {7336#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7336#false} is VALID [2018-11-23 11:55:52,618 INFO L256 TraceCheckUtils]: 66: Hoare triple {7336#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {7336#false} is VALID [2018-11-23 11:55:52,619 INFO L273 TraceCheckUtils]: 67: Hoare triple {7336#false} ~cond := #in~cond; {7336#false} is VALID [2018-11-23 11:55:52,619 INFO L273 TraceCheckUtils]: 68: Hoare triple {7336#false} assume 0 == ~cond; {7336#false} is VALID [2018-11-23 11:55:52,619 INFO L273 TraceCheckUtils]: 69: Hoare triple {7336#false} assume !false; {7336#false} is VALID [2018-11-23 11:55:52,623 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:52,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:52,623 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:52,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:52,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:52,931 INFO L256 TraceCheckUtils]: 0: Hoare triple {7335#true} call ULTIMATE.init(); {7335#true} is VALID [2018-11-23 11:55:52,931 INFO L273 TraceCheckUtils]: 1: Hoare triple {7335#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7335#true} is VALID [2018-11-23 11:55:52,931 INFO L273 TraceCheckUtils]: 2: Hoare triple {7335#true} assume true; {7335#true} is VALID [2018-11-23 11:55:52,932 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7335#true} {7335#true} #55#return; {7335#true} is VALID [2018-11-23 11:55:52,932 INFO L256 TraceCheckUtils]: 4: Hoare triple {7335#true} call #t~ret4 := main(); {7335#true} is VALID [2018-11-23 11:55:52,933 INFO L273 TraceCheckUtils]: 5: Hoare triple {7335#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {7375#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:52,933 INFO L273 TraceCheckUtils]: 6: Hoare triple {7375#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7375#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:52,934 INFO L273 TraceCheckUtils]: 7: Hoare triple {7375#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7375#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:52,934 INFO L273 TraceCheckUtils]: 8: Hoare triple {7375#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {7338#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:52,934 INFO L273 TraceCheckUtils]: 9: Hoare triple {7338#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7338#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:52,935 INFO L273 TraceCheckUtils]: 10: Hoare triple {7338#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7338#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:52,935 INFO L273 TraceCheckUtils]: 11: Hoare triple {7338#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {7339#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:52,935 INFO L273 TraceCheckUtils]: 12: Hoare triple {7339#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7339#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:52,936 INFO L273 TraceCheckUtils]: 13: Hoare triple {7339#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7339#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:52,937 INFO L273 TraceCheckUtils]: 14: Hoare triple {7339#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {7340#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:52,937 INFO L273 TraceCheckUtils]: 15: Hoare triple {7340#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7340#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:52,938 INFO L273 TraceCheckUtils]: 16: Hoare triple {7340#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7340#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:52,938 INFO L273 TraceCheckUtils]: 17: Hoare triple {7340#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {7341#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:52,939 INFO L273 TraceCheckUtils]: 18: Hoare triple {7341#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7341#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:52,939 INFO L273 TraceCheckUtils]: 19: Hoare triple {7341#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7341#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:52,940 INFO L273 TraceCheckUtils]: 20: Hoare triple {7341#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {7342#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:52,940 INFO L273 TraceCheckUtils]: 21: Hoare triple {7342#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7342#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:52,941 INFO L273 TraceCheckUtils]: 22: Hoare triple {7342#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7342#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:52,942 INFO L273 TraceCheckUtils]: 23: Hoare triple {7342#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {7343#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:52,942 INFO L273 TraceCheckUtils]: 24: Hoare triple {7343#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7343#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:52,943 INFO L273 TraceCheckUtils]: 25: Hoare triple {7343#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7343#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:52,943 INFO L273 TraceCheckUtils]: 26: Hoare triple {7343#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {7344#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:52,944 INFO L273 TraceCheckUtils]: 27: Hoare triple {7344#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7344#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:52,944 INFO L273 TraceCheckUtils]: 28: Hoare triple {7344#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7344#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:52,945 INFO L273 TraceCheckUtils]: 29: Hoare triple {7344#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {7345#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:52,946 INFO L273 TraceCheckUtils]: 30: Hoare triple {7345#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7345#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:52,946 INFO L273 TraceCheckUtils]: 31: Hoare triple {7345#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7345#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:52,947 INFO L273 TraceCheckUtils]: 32: Hoare triple {7345#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {7346#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:52,948 INFO L273 TraceCheckUtils]: 33: Hoare triple {7346#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7346#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:52,948 INFO L273 TraceCheckUtils]: 34: Hoare triple {7346#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7346#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:52,949 INFO L273 TraceCheckUtils]: 35: Hoare triple {7346#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {7347#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:52,950 INFO L273 TraceCheckUtils]: 36: Hoare triple {7347#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7347#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:52,950 INFO L273 TraceCheckUtils]: 37: Hoare triple {7347#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7347#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:52,951 INFO L273 TraceCheckUtils]: 38: Hoare triple {7347#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {7348#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:52,952 INFO L273 TraceCheckUtils]: 39: Hoare triple {7348#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7348#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:52,952 INFO L273 TraceCheckUtils]: 40: Hoare triple {7348#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7348#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:52,953 INFO L273 TraceCheckUtils]: 41: Hoare triple {7348#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {7349#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:52,954 INFO L273 TraceCheckUtils]: 42: Hoare triple {7349#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7349#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:52,954 INFO L273 TraceCheckUtils]: 43: Hoare triple {7349#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7349#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:52,955 INFO L273 TraceCheckUtils]: 44: Hoare triple {7349#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {7350#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:52,956 INFO L273 TraceCheckUtils]: 45: Hoare triple {7350#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7350#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:52,956 INFO L273 TraceCheckUtils]: 46: Hoare triple {7350#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7350#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:52,957 INFO L273 TraceCheckUtils]: 47: Hoare triple {7350#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {7351#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:52,958 INFO L273 TraceCheckUtils]: 48: Hoare triple {7351#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7351#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:52,958 INFO L273 TraceCheckUtils]: 49: Hoare triple {7351#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7351#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:52,959 INFO L273 TraceCheckUtils]: 50: Hoare triple {7351#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {7352#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:52,960 INFO L273 TraceCheckUtils]: 51: Hoare triple {7352#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7352#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:52,960 INFO L273 TraceCheckUtils]: 52: Hoare triple {7352#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7352#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:52,961 INFO L273 TraceCheckUtils]: 53: Hoare triple {7352#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {7353#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:52,961 INFO L273 TraceCheckUtils]: 54: Hoare triple {7353#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7353#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:52,962 INFO L273 TraceCheckUtils]: 55: Hoare triple {7353#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7353#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:52,962 INFO L273 TraceCheckUtils]: 56: Hoare triple {7353#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {7354#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:52,963 INFO L273 TraceCheckUtils]: 57: Hoare triple {7354#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7354#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:52,963 INFO L273 TraceCheckUtils]: 58: Hoare triple {7354#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7354#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:52,964 INFO L273 TraceCheckUtils]: 59: Hoare triple {7354#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {7355#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:52,965 INFO L273 TraceCheckUtils]: 60: Hoare triple {7355#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7355#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:52,965 INFO L273 TraceCheckUtils]: 61: Hoare triple {7355#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7355#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:52,966 INFO L273 TraceCheckUtils]: 62: Hoare triple {7355#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {7356#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:52,967 INFO L273 TraceCheckUtils]: 63: Hoare triple {7356#(<= main_~i~0 19)} assume !(~i~0 < 100000); {7336#false} is VALID [2018-11-23 11:55:52,967 INFO L273 TraceCheckUtils]: 64: Hoare triple {7336#false} havoc ~x~0;~x~0 := 0; {7336#false} is VALID [2018-11-23 11:55:52,967 INFO L273 TraceCheckUtils]: 65: Hoare triple {7336#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7336#false} is VALID [2018-11-23 11:55:52,967 INFO L256 TraceCheckUtils]: 66: Hoare triple {7336#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {7336#false} is VALID [2018-11-23 11:55:52,968 INFO L273 TraceCheckUtils]: 67: Hoare triple {7336#false} ~cond := #in~cond; {7336#false} is VALID [2018-11-23 11:55:52,968 INFO L273 TraceCheckUtils]: 68: Hoare triple {7336#false} assume 0 == ~cond; {7336#false} is VALID [2018-11-23 11:55:52,968 INFO L273 TraceCheckUtils]: 69: Hoare triple {7336#false} assume !false; {7336#false} is VALID [2018-11-23 11:55:52,972 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:52,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:52,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 11:55:52,991 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 70 [2018-11-23 11:55:52,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:52,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 11:55:53,062 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:53,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 11:55:53,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 11:55:53,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:55:53,063 INFO L87 Difference]: Start difference. First operand 75 states and 95 transitions. Second operand 23 states. [2018-11-23 11:55:53,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:53,668 INFO L93 Difference]: Finished difference Result 91 states and 114 transitions. [2018-11-23 11:55:53,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 11:55:53,668 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 70 [2018-11-23 11:55:53,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:53,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:55:53,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 114 transitions. [2018-11-23 11:55:53,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:55:53,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 114 transitions. [2018-11-23 11:55:53,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 114 transitions. [2018-11-23 11:55:53,806 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:53,807 INFO L225 Difference]: With dead ends: 91 [2018-11-23 11:55:53,807 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 11:55:53,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:55:53,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 11:55:53,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-11-23 11:55:53,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:53,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 78 states. [2018-11-23 11:55:53,826 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 78 states. [2018-11-23 11:55:53,826 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 78 states. [2018-11-23 11:55:53,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:53,828 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2018-11-23 11:55:53,828 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2018-11-23 11:55:53,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:53,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:53,829 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 80 states. [2018-11-23 11:55:53,829 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 80 states. [2018-11-23 11:55:53,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:53,831 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2018-11-23 11:55:53,831 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2018-11-23 11:55:53,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:53,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:53,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:53,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:53,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 11:55:53,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2018-11-23 11:55:53,833 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 70 [2018-11-23 11:55:53,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:53,833 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2018-11-23 11:55:53,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 11:55:53,834 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2018-11-23 11:55:53,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 11:55:53,834 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:53,835 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:53,835 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:53,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:53,835 INFO L82 PathProgramCache]: Analyzing trace with hash -615929287, now seen corresponding path program 20 times [2018-11-23 11:55:53,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:53,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:53,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:53,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:53,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:54,219 INFO L256 TraceCheckUtils]: 0: Hoare triple {7955#true} call ULTIMATE.init(); {7955#true} is VALID [2018-11-23 11:55:54,220 INFO L273 TraceCheckUtils]: 1: Hoare triple {7955#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7955#true} is VALID [2018-11-23 11:55:54,220 INFO L273 TraceCheckUtils]: 2: Hoare triple {7955#true} assume true; {7955#true} is VALID [2018-11-23 11:55:54,220 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7955#true} {7955#true} #55#return; {7955#true} is VALID [2018-11-23 11:55:54,220 INFO L256 TraceCheckUtils]: 4: Hoare triple {7955#true} call #t~ret4 := main(); {7955#true} is VALID [2018-11-23 11:55:54,221 INFO L273 TraceCheckUtils]: 5: Hoare triple {7955#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {7957#(= main_~i~0 0)} is VALID [2018-11-23 11:55:54,221 INFO L273 TraceCheckUtils]: 6: Hoare triple {7957#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7957#(= main_~i~0 0)} is VALID [2018-11-23 11:55:54,222 INFO L273 TraceCheckUtils]: 7: Hoare triple {7957#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7957#(= main_~i~0 0)} is VALID [2018-11-23 11:55:54,233 INFO L273 TraceCheckUtils]: 8: Hoare triple {7957#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {7958#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:54,233 INFO L273 TraceCheckUtils]: 9: Hoare triple {7958#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7958#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:54,234 INFO L273 TraceCheckUtils]: 10: Hoare triple {7958#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7958#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:54,234 INFO L273 TraceCheckUtils]: 11: Hoare triple {7958#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {7959#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:54,234 INFO L273 TraceCheckUtils]: 12: Hoare triple {7959#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7959#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:54,235 INFO L273 TraceCheckUtils]: 13: Hoare triple {7959#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7959#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:54,235 INFO L273 TraceCheckUtils]: 14: Hoare triple {7959#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {7960#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:54,235 INFO L273 TraceCheckUtils]: 15: Hoare triple {7960#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7960#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:54,236 INFO L273 TraceCheckUtils]: 16: Hoare triple {7960#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7960#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:54,236 INFO L273 TraceCheckUtils]: 17: Hoare triple {7960#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {7961#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:54,237 INFO L273 TraceCheckUtils]: 18: Hoare triple {7961#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7961#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:54,237 INFO L273 TraceCheckUtils]: 19: Hoare triple {7961#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7961#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:54,238 INFO L273 TraceCheckUtils]: 20: Hoare triple {7961#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {7962#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:54,238 INFO L273 TraceCheckUtils]: 21: Hoare triple {7962#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7962#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:54,239 INFO L273 TraceCheckUtils]: 22: Hoare triple {7962#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7962#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:54,240 INFO L273 TraceCheckUtils]: 23: Hoare triple {7962#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {7963#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:54,240 INFO L273 TraceCheckUtils]: 24: Hoare triple {7963#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7963#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:54,241 INFO L273 TraceCheckUtils]: 25: Hoare triple {7963#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7963#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:54,241 INFO L273 TraceCheckUtils]: 26: Hoare triple {7963#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {7964#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:54,242 INFO L273 TraceCheckUtils]: 27: Hoare triple {7964#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7964#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:54,242 INFO L273 TraceCheckUtils]: 28: Hoare triple {7964#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7964#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:54,243 INFO L273 TraceCheckUtils]: 29: Hoare triple {7964#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {7965#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:54,243 INFO L273 TraceCheckUtils]: 30: Hoare triple {7965#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7965#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:54,244 INFO L273 TraceCheckUtils]: 31: Hoare triple {7965#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7965#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:54,245 INFO L273 TraceCheckUtils]: 32: Hoare triple {7965#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {7966#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:54,245 INFO L273 TraceCheckUtils]: 33: Hoare triple {7966#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7966#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:54,246 INFO L273 TraceCheckUtils]: 34: Hoare triple {7966#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7966#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:54,246 INFO L273 TraceCheckUtils]: 35: Hoare triple {7966#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {7967#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:54,247 INFO L273 TraceCheckUtils]: 36: Hoare triple {7967#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7967#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:54,247 INFO L273 TraceCheckUtils]: 37: Hoare triple {7967#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7967#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:54,248 INFO L273 TraceCheckUtils]: 38: Hoare triple {7967#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {7968#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:54,248 INFO L273 TraceCheckUtils]: 39: Hoare triple {7968#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7968#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:54,249 INFO L273 TraceCheckUtils]: 40: Hoare triple {7968#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7968#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:54,250 INFO L273 TraceCheckUtils]: 41: Hoare triple {7968#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {7969#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:54,250 INFO L273 TraceCheckUtils]: 42: Hoare triple {7969#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7969#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:54,251 INFO L273 TraceCheckUtils]: 43: Hoare triple {7969#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7969#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:54,251 INFO L273 TraceCheckUtils]: 44: Hoare triple {7969#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {7970#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:54,252 INFO L273 TraceCheckUtils]: 45: Hoare triple {7970#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7970#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:54,252 INFO L273 TraceCheckUtils]: 46: Hoare triple {7970#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7970#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:54,253 INFO L273 TraceCheckUtils]: 47: Hoare triple {7970#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {7971#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:54,253 INFO L273 TraceCheckUtils]: 48: Hoare triple {7971#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7971#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:54,254 INFO L273 TraceCheckUtils]: 49: Hoare triple {7971#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7971#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:54,255 INFO L273 TraceCheckUtils]: 50: Hoare triple {7971#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {7972#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:54,255 INFO L273 TraceCheckUtils]: 51: Hoare triple {7972#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7972#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:54,256 INFO L273 TraceCheckUtils]: 52: Hoare triple {7972#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7972#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:54,256 INFO L273 TraceCheckUtils]: 53: Hoare triple {7972#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {7973#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:54,257 INFO L273 TraceCheckUtils]: 54: Hoare triple {7973#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7973#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:54,257 INFO L273 TraceCheckUtils]: 55: Hoare triple {7973#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7973#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:54,258 INFO L273 TraceCheckUtils]: 56: Hoare triple {7973#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {7974#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:54,259 INFO L273 TraceCheckUtils]: 57: Hoare triple {7974#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7974#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:54,259 INFO L273 TraceCheckUtils]: 58: Hoare triple {7974#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7974#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:54,260 INFO L273 TraceCheckUtils]: 59: Hoare triple {7974#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {7975#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:54,260 INFO L273 TraceCheckUtils]: 60: Hoare triple {7975#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7975#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:54,261 INFO L273 TraceCheckUtils]: 61: Hoare triple {7975#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7975#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:54,262 INFO L273 TraceCheckUtils]: 62: Hoare triple {7975#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {7976#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:54,262 INFO L273 TraceCheckUtils]: 63: Hoare triple {7976#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7976#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:54,263 INFO L273 TraceCheckUtils]: 64: Hoare triple {7976#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7976#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:54,263 INFO L273 TraceCheckUtils]: 65: Hoare triple {7976#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {7977#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:54,264 INFO L273 TraceCheckUtils]: 66: Hoare triple {7977#(<= main_~i~0 20)} assume !(~i~0 < 100000); {7956#false} is VALID [2018-11-23 11:55:54,264 INFO L273 TraceCheckUtils]: 67: Hoare triple {7956#false} havoc ~x~0;~x~0 := 0; {7956#false} is VALID [2018-11-23 11:55:54,264 INFO L273 TraceCheckUtils]: 68: Hoare triple {7956#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7956#false} is VALID [2018-11-23 11:55:54,265 INFO L256 TraceCheckUtils]: 69: Hoare triple {7956#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {7956#false} is VALID [2018-11-23 11:55:54,265 INFO L273 TraceCheckUtils]: 70: Hoare triple {7956#false} ~cond := #in~cond; {7956#false} is VALID [2018-11-23 11:55:54,265 INFO L273 TraceCheckUtils]: 71: Hoare triple {7956#false} assume 0 == ~cond; {7956#false} is VALID [2018-11-23 11:55:54,265 INFO L273 TraceCheckUtils]: 72: Hoare triple {7956#false} assume !false; {7956#false} is VALID [2018-11-23 11:55:54,269 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:54,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:54,269 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:54,278 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:55:54,309 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:55:54,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:54,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:54,515 INFO L256 TraceCheckUtils]: 0: Hoare triple {7955#true} call ULTIMATE.init(); {7955#true} is VALID [2018-11-23 11:55:54,515 INFO L273 TraceCheckUtils]: 1: Hoare triple {7955#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7955#true} is VALID [2018-11-23 11:55:54,515 INFO L273 TraceCheckUtils]: 2: Hoare triple {7955#true} assume true; {7955#true} is VALID [2018-11-23 11:55:54,515 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7955#true} {7955#true} #55#return; {7955#true} is VALID [2018-11-23 11:55:54,516 INFO L256 TraceCheckUtils]: 4: Hoare triple {7955#true} call #t~ret4 := main(); {7955#true} is VALID [2018-11-23 11:55:54,516 INFO L273 TraceCheckUtils]: 5: Hoare triple {7955#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {7996#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:54,517 INFO L273 TraceCheckUtils]: 6: Hoare triple {7996#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7996#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:54,517 INFO L273 TraceCheckUtils]: 7: Hoare triple {7996#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7996#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:54,517 INFO L273 TraceCheckUtils]: 8: Hoare triple {7996#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {7958#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:54,518 INFO L273 TraceCheckUtils]: 9: Hoare triple {7958#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7958#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:54,518 INFO L273 TraceCheckUtils]: 10: Hoare triple {7958#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7958#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:54,518 INFO L273 TraceCheckUtils]: 11: Hoare triple {7958#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {7959#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:54,519 INFO L273 TraceCheckUtils]: 12: Hoare triple {7959#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7959#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:54,519 INFO L273 TraceCheckUtils]: 13: Hoare triple {7959#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7959#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:54,520 INFO L273 TraceCheckUtils]: 14: Hoare triple {7959#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {7960#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:54,521 INFO L273 TraceCheckUtils]: 15: Hoare triple {7960#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7960#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:54,521 INFO L273 TraceCheckUtils]: 16: Hoare triple {7960#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7960#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:54,522 INFO L273 TraceCheckUtils]: 17: Hoare triple {7960#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {7961#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:54,522 INFO L273 TraceCheckUtils]: 18: Hoare triple {7961#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7961#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:54,523 INFO L273 TraceCheckUtils]: 19: Hoare triple {7961#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7961#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:54,523 INFO L273 TraceCheckUtils]: 20: Hoare triple {7961#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {7962#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:54,524 INFO L273 TraceCheckUtils]: 21: Hoare triple {7962#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7962#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:54,524 INFO L273 TraceCheckUtils]: 22: Hoare triple {7962#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7962#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:54,525 INFO L273 TraceCheckUtils]: 23: Hoare triple {7962#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {7963#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:54,526 INFO L273 TraceCheckUtils]: 24: Hoare triple {7963#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7963#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:54,526 INFO L273 TraceCheckUtils]: 25: Hoare triple {7963#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7963#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:54,527 INFO L273 TraceCheckUtils]: 26: Hoare triple {7963#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {7964#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:54,527 INFO L273 TraceCheckUtils]: 27: Hoare triple {7964#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7964#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:54,528 INFO L273 TraceCheckUtils]: 28: Hoare triple {7964#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7964#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:54,528 INFO L273 TraceCheckUtils]: 29: Hoare triple {7964#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {7965#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:54,529 INFO L273 TraceCheckUtils]: 30: Hoare triple {7965#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7965#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:54,529 INFO L273 TraceCheckUtils]: 31: Hoare triple {7965#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7965#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:54,530 INFO L273 TraceCheckUtils]: 32: Hoare triple {7965#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {7966#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:54,531 INFO L273 TraceCheckUtils]: 33: Hoare triple {7966#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7966#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:54,531 INFO L273 TraceCheckUtils]: 34: Hoare triple {7966#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7966#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:54,532 INFO L273 TraceCheckUtils]: 35: Hoare triple {7966#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {7967#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:54,532 INFO L273 TraceCheckUtils]: 36: Hoare triple {7967#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7967#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:54,533 INFO L273 TraceCheckUtils]: 37: Hoare triple {7967#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7967#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:54,533 INFO L273 TraceCheckUtils]: 38: Hoare triple {7967#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {7968#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:54,534 INFO L273 TraceCheckUtils]: 39: Hoare triple {7968#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7968#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:54,534 INFO L273 TraceCheckUtils]: 40: Hoare triple {7968#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7968#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:54,535 INFO L273 TraceCheckUtils]: 41: Hoare triple {7968#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {7969#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:54,536 INFO L273 TraceCheckUtils]: 42: Hoare triple {7969#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7969#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:54,536 INFO L273 TraceCheckUtils]: 43: Hoare triple {7969#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7969#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:54,537 INFO L273 TraceCheckUtils]: 44: Hoare triple {7969#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {7970#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:54,537 INFO L273 TraceCheckUtils]: 45: Hoare triple {7970#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7970#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:54,538 INFO L273 TraceCheckUtils]: 46: Hoare triple {7970#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7970#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:54,538 INFO L273 TraceCheckUtils]: 47: Hoare triple {7970#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {7971#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:54,539 INFO L273 TraceCheckUtils]: 48: Hoare triple {7971#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7971#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:54,539 INFO L273 TraceCheckUtils]: 49: Hoare triple {7971#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7971#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:54,540 INFO L273 TraceCheckUtils]: 50: Hoare triple {7971#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {7972#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:54,540 INFO L273 TraceCheckUtils]: 51: Hoare triple {7972#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7972#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:54,541 INFO L273 TraceCheckUtils]: 52: Hoare triple {7972#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7972#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:54,542 INFO L273 TraceCheckUtils]: 53: Hoare triple {7972#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {7973#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:54,542 INFO L273 TraceCheckUtils]: 54: Hoare triple {7973#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7973#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:54,543 INFO L273 TraceCheckUtils]: 55: Hoare triple {7973#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7973#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:54,543 INFO L273 TraceCheckUtils]: 56: Hoare triple {7973#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {7974#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:54,544 INFO L273 TraceCheckUtils]: 57: Hoare triple {7974#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7974#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:54,544 INFO L273 TraceCheckUtils]: 58: Hoare triple {7974#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7974#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:54,545 INFO L273 TraceCheckUtils]: 59: Hoare triple {7974#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {7975#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:54,545 INFO L273 TraceCheckUtils]: 60: Hoare triple {7975#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7975#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:54,546 INFO L273 TraceCheckUtils]: 61: Hoare triple {7975#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7975#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:54,547 INFO L273 TraceCheckUtils]: 62: Hoare triple {7975#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {7976#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:54,547 INFO L273 TraceCheckUtils]: 63: Hoare triple {7976#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7976#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:54,548 INFO L273 TraceCheckUtils]: 64: Hoare triple {7976#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {7976#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:54,548 INFO L273 TraceCheckUtils]: 65: Hoare triple {7976#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {7977#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:54,549 INFO L273 TraceCheckUtils]: 66: Hoare triple {7977#(<= main_~i~0 20)} assume !(~i~0 < 100000); {7956#false} is VALID [2018-11-23 11:55:54,549 INFO L273 TraceCheckUtils]: 67: Hoare triple {7956#false} havoc ~x~0;~x~0 := 0; {7956#false} is VALID [2018-11-23 11:55:54,549 INFO L273 TraceCheckUtils]: 68: Hoare triple {7956#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7956#false} is VALID [2018-11-23 11:55:54,549 INFO L256 TraceCheckUtils]: 69: Hoare triple {7956#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {7956#false} is VALID [2018-11-23 11:55:54,550 INFO L273 TraceCheckUtils]: 70: Hoare triple {7956#false} ~cond := #in~cond; {7956#false} is VALID [2018-11-23 11:55:54,550 INFO L273 TraceCheckUtils]: 71: Hoare triple {7956#false} assume 0 == ~cond; {7956#false} is VALID [2018-11-23 11:55:54,550 INFO L273 TraceCheckUtils]: 72: Hoare triple {7956#false} assume !false; {7956#false} is VALID [2018-11-23 11:55:54,555 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:54,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:54,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 11:55:54,574 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 73 [2018-11-23 11:55:54,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:54,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 11:55:54,644 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:54,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 11:55:54,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 11:55:54,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:55:54,645 INFO L87 Difference]: Start difference. First operand 78 states and 99 transitions. Second operand 24 states. [2018-11-23 11:55:54,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:54,984 INFO L93 Difference]: Finished difference Result 94 states and 118 transitions. [2018-11-23 11:55:54,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 11:55:54,984 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 73 [2018-11-23 11:55:54,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:54,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:55:54,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 118 transitions. [2018-11-23 11:55:54,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:55:54,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 118 transitions. [2018-11-23 11:55:54,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 118 transitions. [2018-11-23 11:55:55,089 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:55,091 INFO L225 Difference]: With dead ends: 94 [2018-11-23 11:55:55,091 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 11:55:55,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:55:55,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 11:55:55,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-11-23 11:55:55,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:55,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 81 states. [2018-11-23 11:55:55,135 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 81 states. [2018-11-23 11:55:55,135 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 81 states. [2018-11-23 11:55:55,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:55,136 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2018-11-23 11:55:55,136 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 106 transitions. [2018-11-23 11:55:55,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:55,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:55,137 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 83 states. [2018-11-23 11:55:55,137 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 83 states. [2018-11-23 11:55:55,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:55,138 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2018-11-23 11:55:55,138 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 106 transitions. [2018-11-23 11:55:55,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:55,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:55,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:55,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:55,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 11:55:55,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 103 transitions. [2018-11-23 11:55:55,140 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 103 transitions. Word has length 73 [2018-11-23 11:55:55,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:55,140 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 103 transitions. [2018-11-23 11:55:55,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 11:55:55,141 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions. [2018-11-23 11:55:55,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 11:55:55,141 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:55,141 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:55,141 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:55,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:55,142 INFO L82 PathProgramCache]: Analyzing trace with hash -2003734685, now seen corresponding path program 21 times [2018-11-23 11:55:55,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:55,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:55,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:55,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:55,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:55,714 INFO L256 TraceCheckUtils]: 0: Hoare triple {8599#true} call ULTIMATE.init(); {8599#true} is VALID [2018-11-23 11:55:55,714 INFO L273 TraceCheckUtils]: 1: Hoare triple {8599#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8599#true} is VALID [2018-11-23 11:55:55,714 INFO L273 TraceCheckUtils]: 2: Hoare triple {8599#true} assume true; {8599#true} is VALID [2018-11-23 11:55:55,715 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8599#true} {8599#true} #55#return; {8599#true} is VALID [2018-11-23 11:55:55,715 INFO L256 TraceCheckUtils]: 4: Hoare triple {8599#true} call #t~ret4 := main(); {8599#true} is VALID [2018-11-23 11:55:55,715 INFO L273 TraceCheckUtils]: 5: Hoare triple {8599#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {8601#(= main_~i~0 0)} is VALID [2018-11-23 11:55:55,716 INFO L273 TraceCheckUtils]: 6: Hoare triple {8601#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8601#(= main_~i~0 0)} is VALID [2018-11-23 11:55:55,716 INFO L273 TraceCheckUtils]: 7: Hoare triple {8601#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8601#(= main_~i~0 0)} is VALID [2018-11-23 11:55:55,717 INFO L273 TraceCheckUtils]: 8: Hoare triple {8601#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {8602#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:55,718 INFO L273 TraceCheckUtils]: 9: Hoare triple {8602#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8602#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:55,718 INFO L273 TraceCheckUtils]: 10: Hoare triple {8602#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8602#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:55,719 INFO L273 TraceCheckUtils]: 11: Hoare triple {8602#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {8603#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:55,720 INFO L273 TraceCheckUtils]: 12: Hoare triple {8603#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8603#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:55,720 INFO L273 TraceCheckUtils]: 13: Hoare triple {8603#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8603#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:55,721 INFO L273 TraceCheckUtils]: 14: Hoare triple {8603#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {8604#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:55,721 INFO L273 TraceCheckUtils]: 15: Hoare triple {8604#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8604#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:55,722 INFO L273 TraceCheckUtils]: 16: Hoare triple {8604#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8604#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:55,723 INFO L273 TraceCheckUtils]: 17: Hoare triple {8604#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {8605#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:55,723 INFO L273 TraceCheckUtils]: 18: Hoare triple {8605#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8605#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:55,724 INFO L273 TraceCheckUtils]: 19: Hoare triple {8605#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8605#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:55,724 INFO L273 TraceCheckUtils]: 20: Hoare triple {8605#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {8606#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:55,725 INFO L273 TraceCheckUtils]: 21: Hoare triple {8606#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8606#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:55,726 INFO L273 TraceCheckUtils]: 22: Hoare triple {8606#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8606#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:55,726 INFO L273 TraceCheckUtils]: 23: Hoare triple {8606#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {8607#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:55,727 INFO L273 TraceCheckUtils]: 24: Hoare triple {8607#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8607#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:55,727 INFO L273 TraceCheckUtils]: 25: Hoare triple {8607#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8607#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:55,728 INFO L273 TraceCheckUtils]: 26: Hoare triple {8607#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {8608#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:55,729 INFO L273 TraceCheckUtils]: 27: Hoare triple {8608#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8608#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:55,729 INFO L273 TraceCheckUtils]: 28: Hoare triple {8608#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8608#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:55,730 INFO L273 TraceCheckUtils]: 29: Hoare triple {8608#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {8609#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:55,730 INFO L273 TraceCheckUtils]: 30: Hoare triple {8609#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8609#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:55,731 INFO L273 TraceCheckUtils]: 31: Hoare triple {8609#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8609#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:55,732 INFO L273 TraceCheckUtils]: 32: Hoare triple {8609#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {8610#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:55,732 INFO L273 TraceCheckUtils]: 33: Hoare triple {8610#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8610#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:55,733 INFO L273 TraceCheckUtils]: 34: Hoare triple {8610#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8610#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:55,733 INFO L273 TraceCheckUtils]: 35: Hoare triple {8610#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {8611#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:55,734 INFO L273 TraceCheckUtils]: 36: Hoare triple {8611#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8611#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:55,734 INFO L273 TraceCheckUtils]: 37: Hoare triple {8611#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8611#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:55,735 INFO L273 TraceCheckUtils]: 38: Hoare triple {8611#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {8612#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:55,736 INFO L273 TraceCheckUtils]: 39: Hoare triple {8612#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8612#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:55,736 INFO L273 TraceCheckUtils]: 40: Hoare triple {8612#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8612#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:55,737 INFO L273 TraceCheckUtils]: 41: Hoare triple {8612#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {8613#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:55,737 INFO L273 TraceCheckUtils]: 42: Hoare triple {8613#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8613#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:55,738 INFO L273 TraceCheckUtils]: 43: Hoare triple {8613#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8613#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:55,739 INFO L273 TraceCheckUtils]: 44: Hoare triple {8613#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {8614#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:55,739 INFO L273 TraceCheckUtils]: 45: Hoare triple {8614#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8614#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:55,740 INFO L273 TraceCheckUtils]: 46: Hoare triple {8614#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8614#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:55,740 INFO L273 TraceCheckUtils]: 47: Hoare triple {8614#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {8615#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:55,741 INFO L273 TraceCheckUtils]: 48: Hoare triple {8615#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8615#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:55,741 INFO L273 TraceCheckUtils]: 49: Hoare triple {8615#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8615#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:55,742 INFO L273 TraceCheckUtils]: 50: Hoare triple {8615#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {8616#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:55,743 INFO L273 TraceCheckUtils]: 51: Hoare triple {8616#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8616#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:55,743 INFO L273 TraceCheckUtils]: 52: Hoare triple {8616#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8616#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:55,744 INFO L273 TraceCheckUtils]: 53: Hoare triple {8616#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {8617#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:55,745 INFO L273 TraceCheckUtils]: 54: Hoare triple {8617#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8617#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:55,745 INFO L273 TraceCheckUtils]: 55: Hoare triple {8617#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8617#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:55,746 INFO L273 TraceCheckUtils]: 56: Hoare triple {8617#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {8618#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:55,746 INFO L273 TraceCheckUtils]: 57: Hoare triple {8618#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8618#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:55,747 INFO L273 TraceCheckUtils]: 58: Hoare triple {8618#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8618#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:55,747 INFO L273 TraceCheckUtils]: 59: Hoare triple {8618#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {8619#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:55,748 INFO L273 TraceCheckUtils]: 60: Hoare triple {8619#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8619#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:55,748 INFO L273 TraceCheckUtils]: 61: Hoare triple {8619#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8619#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:55,749 INFO L273 TraceCheckUtils]: 62: Hoare triple {8619#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {8620#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:55,750 INFO L273 TraceCheckUtils]: 63: Hoare triple {8620#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8620#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:55,750 INFO L273 TraceCheckUtils]: 64: Hoare triple {8620#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8620#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:55,751 INFO L273 TraceCheckUtils]: 65: Hoare triple {8620#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {8621#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:55,751 INFO L273 TraceCheckUtils]: 66: Hoare triple {8621#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8621#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:55,752 INFO L273 TraceCheckUtils]: 67: Hoare triple {8621#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8621#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:55,752 INFO L273 TraceCheckUtils]: 68: Hoare triple {8621#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {8622#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:55,753 INFO L273 TraceCheckUtils]: 69: Hoare triple {8622#(<= main_~i~0 21)} assume !(~i~0 < 100000); {8600#false} is VALID [2018-11-23 11:55:55,753 INFO L273 TraceCheckUtils]: 70: Hoare triple {8600#false} havoc ~x~0;~x~0 := 0; {8600#false} is VALID [2018-11-23 11:55:55,753 INFO L273 TraceCheckUtils]: 71: Hoare triple {8600#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8600#false} is VALID [2018-11-23 11:55:55,754 INFO L256 TraceCheckUtils]: 72: Hoare triple {8600#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {8600#false} is VALID [2018-11-23 11:55:55,754 INFO L273 TraceCheckUtils]: 73: Hoare triple {8600#false} ~cond := #in~cond; {8600#false} is VALID [2018-11-23 11:55:55,754 INFO L273 TraceCheckUtils]: 74: Hoare triple {8600#false} assume 0 == ~cond; {8600#false} is VALID [2018-11-23 11:55:55,754 INFO L273 TraceCheckUtils]: 75: Hoare triple {8600#false} assume !false; {8600#false} is VALID [2018-11-23 11:55:55,759 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:55,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:55,759 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:55,768 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:55:55,815 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-23 11:55:55,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:55,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:56,042 INFO L256 TraceCheckUtils]: 0: Hoare triple {8599#true} call ULTIMATE.init(); {8599#true} is VALID [2018-11-23 11:55:56,042 INFO L273 TraceCheckUtils]: 1: Hoare triple {8599#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8599#true} is VALID [2018-11-23 11:55:56,043 INFO L273 TraceCheckUtils]: 2: Hoare triple {8599#true} assume true; {8599#true} is VALID [2018-11-23 11:55:56,043 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8599#true} {8599#true} #55#return; {8599#true} is VALID [2018-11-23 11:55:56,043 INFO L256 TraceCheckUtils]: 4: Hoare triple {8599#true} call #t~ret4 := main(); {8599#true} is VALID [2018-11-23 11:55:56,044 INFO L273 TraceCheckUtils]: 5: Hoare triple {8599#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {8641#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:56,044 INFO L273 TraceCheckUtils]: 6: Hoare triple {8641#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8641#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:56,044 INFO L273 TraceCheckUtils]: 7: Hoare triple {8641#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8641#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:56,045 INFO L273 TraceCheckUtils]: 8: Hoare triple {8641#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {8602#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:56,045 INFO L273 TraceCheckUtils]: 9: Hoare triple {8602#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8602#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:56,045 INFO L273 TraceCheckUtils]: 10: Hoare triple {8602#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8602#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:56,046 INFO L273 TraceCheckUtils]: 11: Hoare triple {8602#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {8603#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:56,047 INFO L273 TraceCheckUtils]: 12: Hoare triple {8603#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8603#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:56,047 INFO L273 TraceCheckUtils]: 13: Hoare triple {8603#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8603#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:56,048 INFO L273 TraceCheckUtils]: 14: Hoare triple {8603#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {8604#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:56,048 INFO L273 TraceCheckUtils]: 15: Hoare triple {8604#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8604#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:56,049 INFO L273 TraceCheckUtils]: 16: Hoare triple {8604#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8604#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:56,050 INFO L273 TraceCheckUtils]: 17: Hoare triple {8604#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {8605#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:56,050 INFO L273 TraceCheckUtils]: 18: Hoare triple {8605#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8605#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:56,051 INFO L273 TraceCheckUtils]: 19: Hoare triple {8605#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8605#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:56,051 INFO L273 TraceCheckUtils]: 20: Hoare triple {8605#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {8606#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:56,052 INFO L273 TraceCheckUtils]: 21: Hoare triple {8606#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8606#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:56,052 INFO L273 TraceCheckUtils]: 22: Hoare triple {8606#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8606#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:56,053 INFO L273 TraceCheckUtils]: 23: Hoare triple {8606#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {8607#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:56,054 INFO L273 TraceCheckUtils]: 24: Hoare triple {8607#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8607#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:56,054 INFO L273 TraceCheckUtils]: 25: Hoare triple {8607#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8607#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:56,055 INFO L273 TraceCheckUtils]: 26: Hoare triple {8607#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {8608#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:56,055 INFO L273 TraceCheckUtils]: 27: Hoare triple {8608#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8608#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:56,056 INFO L273 TraceCheckUtils]: 28: Hoare triple {8608#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8608#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:56,057 INFO L273 TraceCheckUtils]: 29: Hoare triple {8608#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {8609#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:56,057 INFO L273 TraceCheckUtils]: 30: Hoare triple {8609#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8609#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:56,058 INFO L273 TraceCheckUtils]: 31: Hoare triple {8609#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8609#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:56,058 INFO L273 TraceCheckUtils]: 32: Hoare triple {8609#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {8610#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:56,059 INFO L273 TraceCheckUtils]: 33: Hoare triple {8610#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8610#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:56,059 INFO L273 TraceCheckUtils]: 34: Hoare triple {8610#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8610#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:56,060 INFO L273 TraceCheckUtils]: 35: Hoare triple {8610#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {8611#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:56,061 INFO L273 TraceCheckUtils]: 36: Hoare triple {8611#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8611#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:56,061 INFO L273 TraceCheckUtils]: 37: Hoare triple {8611#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8611#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:56,062 INFO L273 TraceCheckUtils]: 38: Hoare triple {8611#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {8612#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:56,062 INFO L273 TraceCheckUtils]: 39: Hoare triple {8612#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8612#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:56,063 INFO L273 TraceCheckUtils]: 40: Hoare triple {8612#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8612#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:56,064 INFO L273 TraceCheckUtils]: 41: Hoare triple {8612#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {8613#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:56,064 INFO L273 TraceCheckUtils]: 42: Hoare triple {8613#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8613#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:56,065 INFO L273 TraceCheckUtils]: 43: Hoare triple {8613#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8613#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:56,065 INFO L273 TraceCheckUtils]: 44: Hoare triple {8613#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {8614#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:56,066 INFO L273 TraceCheckUtils]: 45: Hoare triple {8614#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8614#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:56,067 INFO L273 TraceCheckUtils]: 46: Hoare triple {8614#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8614#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:56,067 INFO L273 TraceCheckUtils]: 47: Hoare triple {8614#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {8615#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:56,068 INFO L273 TraceCheckUtils]: 48: Hoare triple {8615#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8615#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:56,068 INFO L273 TraceCheckUtils]: 49: Hoare triple {8615#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8615#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:56,069 INFO L273 TraceCheckUtils]: 50: Hoare triple {8615#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {8616#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:56,070 INFO L273 TraceCheckUtils]: 51: Hoare triple {8616#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8616#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:56,070 INFO L273 TraceCheckUtils]: 52: Hoare triple {8616#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8616#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:56,071 INFO L273 TraceCheckUtils]: 53: Hoare triple {8616#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {8617#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:56,071 INFO L273 TraceCheckUtils]: 54: Hoare triple {8617#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8617#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:56,072 INFO L273 TraceCheckUtils]: 55: Hoare triple {8617#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8617#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:56,073 INFO L273 TraceCheckUtils]: 56: Hoare triple {8617#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {8618#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:56,073 INFO L273 TraceCheckUtils]: 57: Hoare triple {8618#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8618#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:56,074 INFO L273 TraceCheckUtils]: 58: Hoare triple {8618#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8618#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:56,074 INFO L273 TraceCheckUtils]: 59: Hoare triple {8618#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {8619#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:56,075 INFO L273 TraceCheckUtils]: 60: Hoare triple {8619#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8619#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:56,075 INFO L273 TraceCheckUtils]: 61: Hoare triple {8619#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8619#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:56,076 INFO L273 TraceCheckUtils]: 62: Hoare triple {8619#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {8620#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:56,077 INFO L273 TraceCheckUtils]: 63: Hoare triple {8620#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8620#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:56,077 INFO L273 TraceCheckUtils]: 64: Hoare triple {8620#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8620#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:56,078 INFO L273 TraceCheckUtils]: 65: Hoare triple {8620#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {8621#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:56,078 INFO L273 TraceCheckUtils]: 66: Hoare triple {8621#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8621#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:56,079 INFO L273 TraceCheckUtils]: 67: Hoare triple {8621#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {8621#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:56,080 INFO L273 TraceCheckUtils]: 68: Hoare triple {8621#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {8622#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:56,080 INFO L273 TraceCheckUtils]: 69: Hoare triple {8622#(<= main_~i~0 21)} assume !(~i~0 < 100000); {8600#false} is VALID [2018-11-23 11:55:56,081 INFO L273 TraceCheckUtils]: 70: Hoare triple {8600#false} havoc ~x~0;~x~0 := 0; {8600#false} is VALID [2018-11-23 11:55:56,081 INFO L273 TraceCheckUtils]: 71: Hoare triple {8600#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8600#false} is VALID [2018-11-23 11:55:56,081 INFO L256 TraceCheckUtils]: 72: Hoare triple {8600#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {8600#false} is VALID [2018-11-23 11:55:56,081 INFO L273 TraceCheckUtils]: 73: Hoare triple {8600#false} ~cond := #in~cond; {8600#false} is VALID [2018-11-23 11:55:56,081 INFO L273 TraceCheckUtils]: 74: Hoare triple {8600#false} assume 0 == ~cond; {8600#false} is VALID [2018-11-23 11:55:56,082 INFO L273 TraceCheckUtils]: 75: Hoare triple {8600#false} assume !false; {8600#false} is VALID [2018-11-23 11:55:56,088 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:56,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:56,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 11:55:56,110 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 76 [2018-11-23 11:55:56,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:56,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 11:55:56,191 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:56,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 11:55:56,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 11:55:56,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:55:56,193 INFO L87 Difference]: Start difference. First operand 81 states and 103 transitions. Second operand 25 states. [2018-11-23 11:55:56,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:56,622 INFO L93 Difference]: Finished difference Result 97 states and 122 transitions. [2018-11-23 11:55:56,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 11:55:56,622 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 76 [2018-11-23 11:55:56,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:56,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:55:56,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 122 transitions. [2018-11-23 11:55:56,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:55:56,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 122 transitions. [2018-11-23 11:55:56,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 122 transitions. [2018-11-23 11:55:56,832 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:56,834 INFO L225 Difference]: With dead ends: 97 [2018-11-23 11:55:56,834 INFO L226 Difference]: Without dead ends: 86 [2018-11-23 11:55:56,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:55:56,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-23 11:55:56,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-11-23 11:55:56,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:56,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 84 states. [2018-11-23 11:55:56,857 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 84 states. [2018-11-23 11:55:56,858 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 84 states. [2018-11-23 11:55:56,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:56,859 INFO L93 Difference]: Finished difference Result 86 states and 110 transitions. [2018-11-23 11:55:56,860 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 110 transitions. [2018-11-23 11:55:56,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:56,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:56,860 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 86 states. [2018-11-23 11:55:56,860 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 86 states. [2018-11-23 11:55:56,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:56,862 INFO L93 Difference]: Finished difference Result 86 states and 110 transitions. [2018-11-23 11:55:56,862 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 110 transitions. [2018-11-23 11:55:56,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:56,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:56,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:56,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:56,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 11:55:56,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2018-11-23 11:55:56,865 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 76 [2018-11-23 11:55:56,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:56,865 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2018-11-23 11:55:56,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 11:55:56,865 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2018-11-23 11:55:56,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 11:55:56,866 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:56,866 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:56,866 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:56,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:56,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1535812089, now seen corresponding path program 22 times [2018-11-23 11:55:56,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:56,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:56,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:56,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:56,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:57,241 INFO L256 TraceCheckUtils]: 0: Hoare triple {9267#true} call ULTIMATE.init(); {9267#true} is VALID [2018-11-23 11:55:57,241 INFO L273 TraceCheckUtils]: 1: Hoare triple {9267#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9267#true} is VALID [2018-11-23 11:55:57,241 INFO L273 TraceCheckUtils]: 2: Hoare triple {9267#true} assume true; {9267#true} is VALID [2018-11-23 11:55:57,241 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9267#true} {9267#true} #55#return; {9267#true} is VALID [2018-11-23 11:55:57,242 INFO L256 TraceCheckUtils]: 4: Hoare triple {9267#true} call #t~ret4 := main(); {9267#true} is VALID [2018-11-23 11:55:57,242 INFO L273 TraceCheckUtils]: 5: Hoare triple {9267#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {9269#(= main_~i~0 0)} is VALID [2018-11-23 11:55:57,243 INFO L273 TraceCheckUtils]: 6: Hoare triple {9269#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9269#(= main_~i~0 0)} is VALID [2018-11-23 11:55:57,243 INFO L273 TraceCheckUtils]: 7: Hoare triple {9269#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9269#(= main_~i~0 0)} is VALID [2018-11-23 11:55:57,243 INFO L273 TraceCheckUtils]: 8: Hoare triple {9269#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {9270#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:57,244 INFO L273 TraceCheckUtils]: 9: Hoare triple {9270#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9270#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:57,244 INFO L273 TraceCheckUtils]: 10: Hoare triple {9270#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9270#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:57,244 INFO L273 TraceCheckUtils]: 11: Hoare triple {9270#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {9271#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:57,245 INFO L273 TraceCheckUtils]: 12: Hoare triple {9271#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9271#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:57,245 INFO L273 TraceCheckUtils]: 13: Hoare triple {9271#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9271#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:57,246 INFO L273 TraceCheckUtils]: 14: Hoare triple {9271#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {9272#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:57,247 INFO L273 TraceCheckUtils]: 15: Hoare triple {9272#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9272#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:57,247 INFO L273 TraceCheckUtils]: 16: Hoare triple {9272#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9272#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:57,248 INFO L273 TraceCheckUtils]: 17: Hoare triple {9272#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {9273#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:57,248 INFO L273 TraceCheckUtils]: 18: Hoare triple {9273#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9273#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:57,249 INFO L273 TraceCheckUtils]: 19: Hoare triple {9273#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9273#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:57,250 INFO L273 TraceCheckUtils]: 20: Hoare triple {9273#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {9274#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:57,250 INFO L273 TraceCheckUtils]: 21: Hoare triple {9274#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9274#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:57,251 INFO L273 TraceCheckUtils]: 22: Hoare triple {9274#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9274#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:57,251 INFO L273 TraceCheckUtils]: 23: Hoare triple {9274#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {9275#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:57,252 INFO L273 TraceCheckUtils]: 24: Hoare triple {9275#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9275#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:57,252 INFO L273 TraceCheckUtils]: 25: Hoare triple {9275#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9275#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:57,253 INFO L273 TraceCheckUtils]: 26: Hoare triple {9275#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {9276#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:57,254 INFO L273 TraceCheckUtils]: 27: Hoare triple {9276#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9276#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:57,254 INFO L273 TraceCheckUtils]: 28: Hoare triple {9276#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9276#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:57,255 INFO L273 TraceCheckUtils]: 29: Hoare triple {9276#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {9277#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:57,255 INFO L273 TraceCheckUtils]: 30: Hoare triple {9277#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9277#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:57,256 INFO L273 TraceCheckUtils]: 31: Hoare triple {9277#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9277#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:57,257 INFO L273 TraceCheckUtils]: 32: Hoare triple {9277#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {9278#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:57,257 INFO L273 TraceCheckUtils]: 33: Hoare triple {9278#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9278#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:57,258 INFO L273 TraceCheckUtils]: 34: Hoare triple {9278#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9278#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:57,258 INFO L273 TraceCheckUtils]: 35: Hoare triple {9278#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {9279#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:57,259 INFO L273 TraceCheckUtils]: 36: Hoare triple {9279#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9279#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:57,259 INFO L273 TraceCheckUtils]: 37: Hoare triple {9279#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9279#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:57,260 INFO L273 TraceCheckUtils]: 38: Hoare triple {9279#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {9280#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:57,261 INFO L273 TraceCheckUtils]: 39: Hoare triple {9280#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9280#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:57,261 INFO L273 TraceCheckUtils]: 40: Hoare triple {9280#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9280#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:57,262 INFO L273 TraceCheckUtils]: 41: Hoare triple {9280#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {9281#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:57,262 INFO L273 TraceCheckUtils]: 42: Hoare triple {9281#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9281#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:57,263 INFO L273 TraceCheckUtils]: 43: Hoare triple {9281#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9281#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:57,264 INFO L273 TraceCheckUtils]: 44: Hoare triple {9281#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {9282#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:57,264 INFO L273 TraceCheckUtils]: 45: Hoare triple {9282#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9282#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:57,265 INFO L273 TraceCheckUtils]: 46: Hoare triple {9282#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9282#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:57,265 INFO L273 TraceCheckUtils]: 47: Hoare triple {9282#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {9283#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:57,266 INFO L273 TraceCheckUtils]: 48: Hoare triple {9283#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9283#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:57,266 INFO L273 TraceCheckUtils]: 49: Hoare triple {9283#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9283#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:57,267 INFO L273 TraceCheckUtils]: 50: Hoare triple {9283#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {9284#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:57,268 INFO L273 TraceCheckUtils]: 51: Hoare triple {9284#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9284#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:57,268 INFO L273 TraceCheckUtils]: 52: Hoare triple {9284#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9284#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:57,269 INFO L273 TraceCheckUtils]: 53: Hoare triple {9284#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {9285#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:57,269 INFO L273 TraceCheckUtils]: 54: Hoare triple {9285#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9285#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:57,270 INFO L273 TraceCheckUtils]: 55: Hoare triple {9285#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9285#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:57,271 INFO L273 TraceCheckUtils]: 56: Hoare triple {9285#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {9286#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:57,271 INFO L273 TraceCheckUtils]: 57: Hoare triple {9286#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9286#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:57,272 INFO L273 TraceCheckUtils]: 58: Hoare triple {9286#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9286#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:57,272 INFO L273 TraceCheckUtils]: 59: Hoare triple {9286#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {9287#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:57,273 INFO L273 TraceCheckUtils]: 60: Hoare triple {9287#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9287#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:57,274 INFO L273 TraceCheckUtils]: 61: Hoare triple {9287#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9287#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:57,274 INFO L273 TraceCheckUtils]: 62: Hoare triple {9287#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {9288#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:57,275 INFO L273 TraceCheckUtils]: 63: Hoare triple {9288#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9288#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:57,275 INFO L273 TraceCheckUtils]: 64: Hoare triple {9288#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9288#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:57,276 INFO L273 TraceCheckUtils]: 65: Hoare triple {9288#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {9289#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:57,277 INFO L273 TraceCheckUtils]: 66: Hoare triple {9289#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9289#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:57,277 INFO L273 TraceCheckUtils]: 67: Hoare triple {9289#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9289#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:57,278 INFO L273 TraceCheckUtils]: 68: Hoare triple {9289#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {9290#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:57,278 INFO L273 TraceCheckUtils]: 69: Hoare triple {9290#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9290#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:57,279 INFO L273 TraceCheckUtils]: 70: Hoare triple {9290#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9290#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:57,280 INFO L273 TraceCheckUtils]: 71: Hoare triple {9290#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {9291#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:57,280 INFO L273 TraceCheckUtils]: 72: Hoare triple {9291#(<= main_~i~0 22)} assume !(~i~0 < 100000); {9268#false} is VALID [2018-11-23 11:55:57,280 INFO L273 TraceCheckUtils]: 73: Hoare triple {9268#false} havoc ~x~0;~x~0 := 0; {9268#false} is VALID [2018-11-23 11:55:57,281 INFO L273 TraceCheckUtils]: 74: Hoare triple {9268#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9268#false} is VALID [2018-11-23 11:55:57,281 INFO L256 TraceCheckUtils]: 75: Hoare triple {9268#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {9268#false} is VALID [2018-11-23 11:55:57,281 INFO L273 TraceCheckUtils]: 76: Hoare triple {9268#false} ~cond := #in~cond; {9268#false} is VALID [2018-11-23 11:55:57,281 INFO L273 TraceCheckUtils]: 77: Hoare triple {9268#false} assume 0 == ~cond; {9268#false} is VALID [2018-11-23 11:55:57,281 INFO L273 TraceCheckUtils]: 78: Hoare triple {9268#false} assume !false; {9268#false} is VALID [2018-11-23 11:55:57,286 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 11:55:57,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:57,287 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:57,295 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:55:57,331 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:55:57,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:57,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:57,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:57,549 INFO L256 TraceCheckUtils]: 0: Hoare triple {9267#true} call ULTIMATE.init(); {9267#true} is VALID [2018-11-23 11:55:57,549 INFO L273 TraceCheckUtils]: 1: Hoare triple {9267#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9267#true} is VALID [2018-11-23 11:55:57,549 INFO L273 TraceCheckUtils]: 2: Hoare triple {9267#true} assume true; {9267#true} is VALID [2018-11-23 11:55:57,549 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9267#true} {9267#true} #55#return; {9267#true} is VALID [2018-11-23 11:55:57,549 INFO L256 TraceCheckUtils]: 4: Hoare triple {9267#true} call #t~ret4 := main(); {9267#true} is VALID [2018-11-23 11:55:57,550 INFO L273 TraceCheckUtils]: 5: Hoare triple {9267#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {9310#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:57,550 INFO L273 TraceCheckUtils]: 6: Hoare triple {9310#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9310#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:57,550 INFO L273 TraceCheckUtils]: 7: Hoare triple {9310#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9310#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:57,551 INFO L273 TraceCheckUtils]: 8: Hoare triple {9310#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {9270#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:57,551 INFO L273 TraceCheckUtils]: 9: Hoare triple {9270#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9270#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:57,552 INFO L273 TraceCheckUtils]: 10: Hoare triple {9270#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9270#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:57,552 INFO L273 TraceCheckUtils]: 11: Hoare triple {9270#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {9271#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:57,552 INFO L273 TraceCheckUtils]: 12: Hoare triple {9271#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9271#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:57,553 INFO L273 TraceCheckUtils]: 13: Hoare triple {9271#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9271#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:57,553 INFO L273 TraceCheckUtils]: 14: Hoare triple {9271#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {9272#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:57,553 INFO L273 TraceCheckUtils]: 15: Hoare triple {9272#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9272#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:57,554 INFO L273 TraceCheckUtils]: 16: Hoare triple {9272#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9272#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:57,555 INFO L273 TraceCheckUtils]: 17: Hoare triple {9272#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {9273#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:57,555 INFO L273 TraceCheckUtils]: 18: Hoare triple {9273#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9273#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:57,556 INFO L273 TraceCheckUtils]: 19: Hoare triple {9273#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9273#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:57,556 INFO L273 TraceCheckUtils]: 20: Hoare triple {9273#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {9274#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:57,557 INFO L273 TraceCheckUtils]: 21: Hoare triple {9274#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9274#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:57,557 INFO L273 TraceCheckUtils]: 22: Hoare triple {9274#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9274#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:57,558 INFO L273 TraceCheckUtils]: 23: Hoare triple {9274#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {9275#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:57,559 INFO L273 TraceCheckUtils]: 24: Hoare triple {9275#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9275#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:57,559 INFO L273 TraceCheckUtils]: 25: Hoare triple {9275#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9275#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:57,560 INFO L273 TraceCheckUtils]: 26: Hoare triple {9275#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {9276#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:57,560 INFO L273 TraceCheckUtils]: 27: Hoare triple {9276#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9276#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:57,561 INFO L273 TraceCheckUtils]: 28: Hoare triple {9276#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9276#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:57,562 INFO L273 TraceCheckUtils]: 29: Hoare triple {9276#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {9277#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:57,562 INFO L273 TraceCheckUtils]: 30: Hoare triple {9277#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9277#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:57,563 INFO L273 TraceCheckUtils]: 31: Hoare triple {9277#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9277#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:57,563 INFO L273 TraceCheckUtils]: 32: Hoare triple {9277#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {9278#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:57,564 INFO L273 TraceCheckUtils]: 33: Hoare triple {9278#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9278#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:57,565 INFO L273 TraceCheckUtils]: 34: Hoare triple {9278#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9278#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:57,565 INFO L273 TraceCheckUtils]: 35: Hoare triple {9278#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {9279#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:57,566 INFO L273 TraceCheckUtils]: 36: Hoare triple {9279#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9279#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:57,566 INFO L273 TraceCheckUtils]: 37: Hoare triple {9279#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9279#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:57,567 INFO L273 TraceCheckUtils]: 38: Hoare triple {9279#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {9280#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:57,568 INFO L273 TraceCheckUtils]: 39: Hoare triple {9280#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9280#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:57,568 INFO L273 TraceCheckUtils]: 40: Hoare triple {9280#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9280#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:57,569 INFO L273 TraceCheckUtils]: 41: Hoare triple {9280#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {9281#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:57,569 INFO L273 TraceCheckUtils]: 42: Hoare triple {9281#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9281#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:57,570 INFO L273 TraceCheckUtils]: 43: Hoare triple {9281#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9281#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:57,570 INFO L273 TraceCheckUtils]: 44: Hoare triple {9281#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {9282#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:57,571 INFO L273 TraceCheckUtils]: 45: Hoare triple {9282#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9282#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:57,572 INFO L273 TraceCheckUtils]: 46: Hoare triple {9282#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9282#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:57,572 INFO L273 TraceCheckUtils]: 47: Hoare triple {9282#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {9283#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:57,573 INFO L273 TraceCheckUtils]: 48: Hoare triple {9283#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9283#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:57,573 INFO L273 TraceCheckUtils]: 49: Hoare triple {9283#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9283#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:57,574 INFO L273 TraceCheckUtils]: 50: Hoare triple {9283#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {9284#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:57,574 INFO L273 TraceCheckUtils]: 51: Hoare triple {9284#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9284#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:57,575 INFO L273 TraceCheckUtils]: 52: Hoare triple {9284#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9284#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:57,576 INFO L273 TraceCheckUtils]: 53: Hoare triple {9284#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {9285#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:57,576 INFO L273 TraceCheckUtils]: 54: Hoare triple {9285#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9285#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:57,577 INFO L273 TraceCheckUtils]: 55: Hoare triple {9285#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9285#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:57,578 INFO L273 TraceCheckUtils]: 56: Hoare triple {9285#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {9286#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:57,578 INFO L273 TraceCheckUtils]: 57: Hoare triple {9286#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9286#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:57,579 INFO L273 TraceCheckUtils]: 58: Hoare triple {9286#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9286#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:57,579 INFO L273 TraceCheckUtils]: 59: Hoare triple {9286#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {9287#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:57,580 INFO L273 TraceCheckUtils]: 60: Hoare triple {9287#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9287#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:57,580 INFO L273 TraceCheckUtils]: 61: Hoare triple {9287#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9287#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:57,581 INFO L273 TraceCheckUtils]: 62: Hoare triple {9287#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {9288#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:57,582 INFO L273 TraceCheckUtils]: 63: Hoare triple {9288#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9288#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:57,582 INFO L273 TraceCheckUtils]: 64: Hoare triple {9288#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9288#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:57,583 INFO L273 TraceCheckUtils]: 65: Hoare triple {9288#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {9289#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:57,583 INFO L273 TraceCheckUtils]: 66: Hoare triple {9289#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9289#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:57,584 INFO L273 TraceCheckUtils]: 67: Hoare triple {9289#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9289#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:57,585 INFO L273 TraceCheckUtils]: 68: Hoare triple {9289#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {9290#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:57,585 INFO L273 TraceCheckUtils]: 69: Hoare triple {9290#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9290#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:57,586 INFO L273 TraceCheckUtils]: 70: Hoare triple {9290#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9290#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:57,586 INFO L273 TraceCheckUtils]: 71: Hoare triple {9290#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {9291#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:57,587 INFO L273 TraceCheckUtils]: 72: Hoare triple {9291#(<= main_~i~0 22)} assume !(~i~0 < 100000); {9268#false} is VALID [2018-11-23 11:55:57,587 INFO L273 TraceCheckUtils]: 73: Hoare triple {9268#false} havoc ~x~0;~x~0 := 0; {9268#false} is VALID [2018-11-23 11:55:57,588 INFO L273 TraceCheckUtils]: 74: Hoare triple {9268#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9268#false} is VALID [2018-11-23 11:55:57,588 INFO L256 TraceCheckUtils]: 75: Hoare triple {9268#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {9268#false} is VALID [2018-11-23 11:55:57,588 INFO L273 TraceCheckUtils]: 76: Hoare triple {9268#false} ~cond := #in~cond; {9268#false} is VALID [2018-11-23 11:55:57,588 INFO L273 TraceCheckUtils]: 77: Hoare triple {9268#false} assume 0 == ~cond; {9268#false} is VALID [2018-11-23 11:55:57,588 INFO L273 TraceCheckUtils]: 78: Hoare triple {9268#false} assume !false; {9268#false} is VALID [2018-11-23 11:55:57,593 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 11:55:57,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:57,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 11:55:57,613 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 79 [2018-11-23 11:55:57,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:57,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 11:55:57,693 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:57,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 11:55:57,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 11:55:57,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:55:57,694 INFO L87 Difference]: Start difference. First operand 84 states and 107 transitions. Second operand 26 states. [2018-11-23 11:55:58,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:58,331 INFO L93 Difference]: Finished difference Result 100 states and 126 transitions. [2018-11-23 11:55:58,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 11:55:58,331 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 79 [2018-11-23 11:55:58,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:58,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:55:58,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 126 transitions. [2018-11-23 11:55:58,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:55:58,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 126 transitions. [2018-11-23 11:55:58,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 126 transitions. [2018-11-23 11:55:58,458 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:58,460 INFO L225 Difference]: With dead ends: 100 [2018-11-23 11:55:58,460 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 11:55:58,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:55:58,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 11:55:58,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2018-11-23 11:55:58,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:58,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 87 states. [2018-11-23 11:55:58,521 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 87 states. [2018-11-23 11:55:58,521 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 87 states. [2018-11-23 11:55:58,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:58,522 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2018-11-23 11:55:58,522 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2018-11-23 11:55:58,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:58,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:58,523 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 89 states. [2018-11-23 11:55:58,523 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 89 states. [2018-11-23 11:55:58,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:58,524 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2018-11-23 11:55:58,525 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2018-11-23 11:55:58,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:58,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:58,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:58,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:58,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 11:55:58,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 111 transitions. [2018-11-23 11:55:58,527 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 111 transitions. Word has length 79 [2018-11-23 11:55:58,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:58,527 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 111 transitions. [2018-11-23 11:55:58,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 11:55:58,527 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 111 transitions. [2018-11-23 11:55:58,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-23 11:55:58,528 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:58,528 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:58,529 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:58,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:58,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1863295069, now seen corresponding path program 23 times [2018-11-23 11:55:58,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:58,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:58,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:58,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:58,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:59,069 INFO L256 TraceCheckUtils]: 0: Hoare triple {9959#true} call ULTIMATE.init(); {9959#true} is VALID [2018-11-23 11:55:59,069 INFO L273 TraceCheckUtils]: 1: Hoare triple {9959#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9959#true} is VALID [2018-11-23 11:55:59,069 INFO L273 TraceCheckUtils]: 2: Hoare triple {9959#true} assume true; {9959#true} is VALID [2018-11-23 11:55:59,070 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9959#true} {9959#true} #55#return; {9959#true} is VALID [2018-11-23 11:55:59,070 INFO L256 TraceCheckUtils]: 4: Hoare triple {9959#true} call #t~ret4 := main(); {9959#true} is VALID [2018-11-23 11:55:59,070 INFO L273 TraceCheckUtils]: 5: Hoare triple {9959#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {9961#(= main_~i~0 0)} is VALID [2018-11-23 11:55:59,071 INFO L273 TraceCheckUtils]: 6: Hoare triple {9961#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9961#(= main_~i~0 0)} is VALID [2018-11-23 11:55:59,071 INFO L273 TraceCheckUtils]: 7: Hoare triple {9961#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9961#(= main_~i~0 0)} is VALID [2018-11-23 11:55:59,072 INFO L273 TraceCheckUtils]: 8: Hoare triple {9961#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {9962#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:59,073 INFO L273 TraceCheckUtils]: 9: Hoare triple {9962#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9962#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:59,073 INFO L273 TraceCheckUtils]: 10: Hoare triple {9962#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9962#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:59,073 INFO L273 TraceCheckUtils]: 11: Hoare triple {9962#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {9963#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:59,074 INFO L273 TraceCheckUtils]: 12: Hoare triple {9963#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9963#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:59,074 INFO L273 TraceCheckUtils]: 13: Hoare triple {9963#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9963#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:59,074 INFO L273 TraceCheckUtils]: 14: Hoare triple {9963#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {9964#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:59,075 INFO L273 TraceCheckUtils]: 15: Hoare triple {9964#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9964#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:59,075 INFO L273 TraceCheckUtils]: 16: Hoare triple {9964#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9964#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:59,076 INFO L273 TraceCheckUtils]: 17: Hoare triple {9964#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {9965#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:59,077 INFO L273 TraceCheckUtils]: 18: Hoare triple {9965#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9965#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:59,077 INFO L273 TraceCheckUtils]: 19: Hoare triple {9965#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9965#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:59,078 INFO L273 TraceCheckUtils]: 20: Hoare triple {9965#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {9966#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:59,078 INFO L273 TraceCheckUtils]: 21: Hoare triple {9966#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9966#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:59,079 INFO L273 TraceCheckUtils]: 22: Hoare triple {9966#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9966#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:59,080 INFO L273 TraceCheckUtils]: 23: Hoare triple {9966#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {9967#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:59,080 INFO L273 TraceCheckUtils]: 24: Hoare triple {9967#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9967#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:59,081 INFO L273 TraceCheckUtils]: 25: Hoare triple {9967#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9967#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:59,081 INFO L273 TraceCheckUtils]: 26: Hoare triple {9967#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {9968#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:59,082 INFO L273 TraceCheckUtils]: 27: Hoare triple {9968#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9968#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:59,083 INFO L273 TraceCheckUtils]: 28: Hoare triple {9968#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9968#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:59,083 INFO L273 TraceCheckUtils]: 29: Hoare triple {9968#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {9969#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:59,084 INFO L273 TraceCheckUtils]: 30: Hoare triple {9969#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9969#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:59,084 INFO L273 TraceCheckUtils]: 31: Hoare triple {9969#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9969#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:59,085 INFO L273 TraceCheckUtils]: 32: Hoare triple {9969#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {9970#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:59,086 INFO L273 TraceCheckUtils]: 33: Hoare triple {9970#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9970#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:59,086 INFO L273 TraceCheckUtils]: 34: Hoare triple {9970#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9970#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:59,087 INFO L273 TraceCheckUtils]: 35: Hoare triple {9970#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {9971#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:59,087 INFO L273 TraceCheckUtils]: 36: Hoare triple {9971#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9971#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:59,088 INFO L273 TraceCheckUtils]: 37: Hoare triple {9971#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9971#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:59,089 INFO L273 TraceCheckUtils]: 38: Hoare triple {9971#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {9972#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:59,089 INFO L273 TraceCheckUtils]: 39: Hoare triple {9972#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9972#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:59,090 INFO L273 TraceCheckUtils]: 40: Hoare triple {9972#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9972#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:59,090 INFO L273 TraceCheckUtils]: 41: Hoare triple {9972#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {9973#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:59,091 INFO L273 TraceCheckUtils]: 42: Hoare triple {9973#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9973#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:59,091 INFO L273 TraceCheckUtils]: 43: Hoare triple {9973#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9973#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:59,092 INFO L273 TraceCheckUtils]: 44: Hoare triple {9973#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {9974#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:59,093 INFO L273 TraceCheckUtils]: 45: Hoare triple {9974#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9974#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:59,093 INFO L273 TraceCheckUtils]: 46: Hoare triple {9974#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9974#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:59,094 INFO L273 TraceCheckUtils]: 47: Hoare triple {9974#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {9975#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:59,094 INFO L273 TraceCheckUtils]: 48: Hoare triple {9975#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9975#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:59,095 INFO L273 TraceCheckUtils]: 49: Hoare triple {9975#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9975#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:59,096 INFO L273 TraceCheckUtils]: 50: Hoare triple {9975#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {9976#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:59,096 INFO L273 TraceCheckUtils]: 51: Hoare triple {9976#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9976#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:59,097 INFO L273 TraceCheckUtils]: 52: Hoare triple {9976#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9976#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:59,097 INFO L273 TraceCheckUtils]: 53: Hoare triple {9976#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {9977#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:59,098 INFO L273 TraceCheckUtils]: 54: Hoare triple {9977#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9977#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:59,098 INFO L273 TraceCheckUtils]: 55: Hoare triple {9977#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9977#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:59,099 INFO L273 TraceCheckUtils]: 56: Hoare triple {9977#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {9978#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:59,100 INFO L273 TraceCheckUtils]: 57: Hoare triple {9978#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9978#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:59,100 INFO L273 TraceCheckUtils]: 58: Hoare triple {9978#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9978#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:59,101 INFO L273 TraceCheckUtils]: 59: Hoare triple {9978#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {9979#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:59,102 INFO L273 TraceCheckUtils]: 60: Hoare triple {9979#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9979#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:59,102 INFO L273 TraceCheckUtils]: 61: Hoare triple {9979#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9979#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:59,103 INFO L273 TraceCheckUtils]: 62: Hoare triple {9979#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {9980#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:59,103 INFO L273 TraceCheckUtils]: 63: Hoare triple {9980#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9980#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:59,104 INFO L273 TraceCheckUtils]: 64: Hoare triple {9980#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9980#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:59,105 INFO L273 TraceCheckUtils]: 65: Hoare triple {9980#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {9981#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:59,105 INFO L273 TraceCheckUtils]: 66: Hoare triple {9981#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9981#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:59,124 INFO L273 TraceCheckUtils]: 67: Hoare triple {9981#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9981#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:59,126 INFO L273 TraceCheckUtils]: 68: Hoare triple {9981#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {9982#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:59,126 INFO L273 TraceCheckUtils]: 69: Hoare triple {9982#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9982#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:59,126 INFO L273 TraceCheckUtils]: 70: Hoare triple {9982#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9982#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:59,127 INFO L273 TraceCheckUtils]: 71: Hoare triple {9982#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {9983#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:59,127 INFO L273 TraceCheckUtils]: 72: Hoare triple {9983#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9983#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:59,127 INFO L273 TraceCheckUtils]: 73: Hoare triple {9983#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9983#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:59,128 INFO L273 TraceCheckUtils]: 74: Hoare triple {9983#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {9984#(<= main_~i~0 23)} is VALID [2018-11-23 11:55:59,128 INFO L273 TraceCheckUtils]: 75: Hoare triple {9984#(<= main_~i~0 23)} assume !(~i~0 < 100000); {9960#false} is VALID [2018-11-23 11:55:59,128 INFO L273 TraceCheckUtils]: 76: Hoare triple {9960#false} havoc ~x~0;~x~0 := 0; {9960#false} is VALID [2018-11-23 11:55:59,129 INFO L273 TraceCheckUtils]: 77: Hoare triple {9960#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9960#false} is VALID [2018-11-23 11:55:59,129 INFO L256 TraceCheckUtils]: 78: Hoare triple {9960#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {9960#false} is VALID [2018-11-23 11:55:59,129 INFO L273 TraceCheckUtils]: 79: Hoare triple {9960#false} ~cond := #in~cond; {9960#false} is VALID [2018-11-23 11:55:59,129 INFO L273 TraceCheckUtils]: 80: Hoare triple {9960#false} assume 0 == ~cond; {9960#false} is VALID [2018-11-23 11:55:59,129 INFO L273 TraceCheckUtils]: 81: Hoare triple {9960#false} assume !false; {9960#false} is VALID [2018-11-23 11:55:59,135 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:59,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:59,135 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:59,144 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:55:59,192 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-23 11:55:59,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:59,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:59,395 INFO L256 TraceCheckUtils]: 0: Hoare triple {9959#true} call ULTIMATE.init(); {9959#true} is VALID [2018-11-23 11:55:59,396 INFO L273 TraceCheckUtils]: 1: Hoare triple {9959#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9959#true} is VALID [2018-11-23 11:55:59,396 INFO L273 TraceCheckUtils]: 2: Hoare triple {9959#true} assume true; {9959#true} is VALID [2018-11-23 11:55:59,396 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9959#true} {9959#true} #55#return; {9959#true} is VALID [2018-11-23 11:55:59,396 INFO L256 TraceCheckUtils]: 4: Hoare triple {9959#true} call #t~ret4 := main(); {9959#true} is VALID [2018-11-23 11:55:59,397 INFO L273 TraceCheckUtils]: 5: Hoare triple {9959#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {10003#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:59,398 INFO L273 TraceCheckUtils]: 6: Hoare triple {10003#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10003#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:59,398 INFO L273 TraceCheckUtils]: 7: Hoare triple {10003#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10003#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:59,398 INFO L273 TraceCheckUtils]: 8: Hoare triple {10003#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {9962#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:59,399 INFO L273 TraceCheckUtils]: 9: Hoare triple {9962#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9962#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:59,399 INFO L273 TraceCheckUtils]: 10: Hoare triple {9962#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9962#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:59,399 INFO L273 TraceCheckUtils]: 11: Hoare triple {9962#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {9963#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:59,400 INFO L273 TraceCheckUtils]: 12: Hoare triple {9963#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9963#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:59,400 INFO L273 TraceCheckUtils]: 13: Hoare triple {9963#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9963#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:59,401 INFO L273 TraceCheckUtils]: 14: Hoare triple {9963#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {9964#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:59,401 INFO L273 TraceCheckUtils]: 15: Hoare triple {9964#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9964#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:59,401 INFO L273 TraceCheckUtils]: 16: Hoare triple {9964#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9964#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:59,402 INFO L273 TraceCheckUtils]: 17: Hoare triple {9964#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {9965#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:59,403 INFO L273 TraceCheckUtils]: 18: Hoare triple {9965#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9965#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:59,403 INFO L273 TraceCheckUtils]: 19: Hoare triple {9965#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9965#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:59,404 INFO L273 TraceCheckUtils]: 20: Hoare triple {9965#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {9966#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:59,404 INFO L273 TraceCheckUtils]: 21: Hoare triple {9966#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9966#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:59,405 INFO L273 TraceCheckUtils]: 22: Hoare triple {9966#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9966#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:59,406 INFO L273 TraceCheckUtils]: 23: Hoare triple {9966#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {9967#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:59,406 INFO L273 TraceCheckUtils]: 24: Hoare triple {9967#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9967#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:59,407 INFO L273 TraceCheckUtils]: 25: Hoare triple {9967#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9967#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:59,407 INFO L273 TraceCheckUtils]: 26: Hoare triple {9967#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {9968#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:59,408 INFO L273 TraceCheckUtils]: 27: Hoare triple {9968#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9968#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:59,408 INFO L273 TraceCheckUtils]: 28: Hoare triple {9968#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9968#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:59,409 INFO L273 TraceCheckUtils]: 29: Hoare triple {9968#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {9969#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:59,410 INFO L273 TraceCheckUtils]: 30: Hoare triple {9969#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9969#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:59,410 INFO L273 TraceCheckUtils]: 31: Hoare triple {9969#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9969#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:59,411 INFO L273 TraceCheckUtils]: 32: Hoare triple {9969#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {9970#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:59,411 INFO L273 TraceCheckUtils]: 33: Hoare triple {9970#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9970#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:59,412 INFO L273 TraceCheckUtils]: 34: Hoare triple {9970#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9970#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:59,413 INFO L273 TraceCheckUtils]: 35: Hoare triple {9970#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {9971#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:59,413 INFO L273 TraceCheckUtils]: 36: Hoare triple {9971#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9971#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:59,414 INFO L273 TraceCheckUtils]: 37: Hoare triple {9971#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9971#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:59,414 INFO L273 TraceCheckUtils]: 38: Hoare triple {9971#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {9972#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:59,415 INFO L273 TraceCheckUtils]: 39: Hoare triple {9972#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9972#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:59,415 INFO L273 TraceCheckUtils]: 40: Hoare triple {9972#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9972#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:59,416 INFO L273 TraceCheckUtils]: 41: Hoare triple {9972#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {9973#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:59,417 INFO L273 TraceCheckUtils]: 42: Hoare triple {9973#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9973#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:59,417 INFO L273 TraceCheckUtils]: 43: Hoare triple {9973#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9973#(<= main_~i~0 12)} is VALID [2018-11-23 11:55:59,418 INFO L273 TraceCheckUtils]: 44: Hoare triple {9973#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {9974#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:59,418 INFO L273 TraceCheckUtils]: 45: Hoare triple {9974#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9974#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:59,419 INFO L273 TraceCheckUtils]: 46: Hoare triple {9974#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9974#(<= main_~i~0 13)} is VALID [2018-11-23 11:55:59,420 INFO L273 TraceCheckUtils]: 47: Hoare triple {9974#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {9975#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:59,420 INFO L273 TraceCheckUtils]: 48: Hoare triple {9975#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9975#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:59,421 INFO L273 TraceCheckUtils]: 49: Hoare triple {9975#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9975#(<= main_~i~0 14)} is VALID [2018-11-23 11:55:59,421 INFO L273 TraceCheckUtils]: 50: Hoare triple {9975#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {9976#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:59,422 INFO L273 TraceCheckUtils]: 51: Hoare triple {9976#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9976#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:59,422 INFO L273 TraceCheckUtils]: 52: Hoare triple {9976#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9976#(<= main_~i~0 15)} is VALID [2018-11-23 11:55:59,423 INFO L273 TraceCheckUtils]: 53: Hoare triple {9976#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {9977#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:59,424 INFO L273 TraceCheckUtils]: 54: Hoare triple {9977#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9977#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:59,424 INFO L273 TraceCheckUtils]: 55: Hoare triple {9977#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9977#(<= main_~i~0 16)} is VALID [2018-11-23 11:55:59,425 INFO L273 TraceCheckUtils]: 56: Hoare triple {9977#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {9978#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:59,426 INFO L273 TraceCheckUtils]: 57: Hoare triple {9978#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9978#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:59,426 INFO L273 TraceCheckUtils]: 58: Hoare triple {9978#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9978#(<= main_~i~0 17)} is VALID [2018-11-23 11:55:59,427 INFO L273 TraceCheckUtils]: 59: Hoare triple {9978#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {9979#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:59,427 INFO L273 TraceCheckUtils]: 60: Hoare triple {9979#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9979#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:59,428 INFO L273 TraceCheckUtils]: 61: Hoare triple {9979#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9979#(<= main_~i~0 18)} is VALID [2018-11-23 11:55:59,428 INFO L273 TraceCheckUtils]: 62: Hoare triple {9979#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {9980#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:59,429 INFO L273 TraceCheckUtils]: 63: Hoare triple {9980#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9980#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:59,430 INFO L273 TraceCheckUtils]: 64: Hoare triple {9980#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9980#(<= main_~i~0 19)} is VALID [2018-11-23 11:55:59,430 INFO L273 TraceCheckUtils]: 65: Hoare triple {9980#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {9981#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:59,431 INFO L273 TraceCheckUtils]: 66: Hoare triple {9981#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9981#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:59,431 INFO L273 TraceCheckUtils]: 67: Hoare triple {9981#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9981#(<= main_~i~0 20)} is VALID [2018-11-23 11:55:59,432 INFO L273 TraceCheckUtils]: 68: Hoare triple {9981#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {9982#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:59,433 INFO L273 TraceCheckUtils]: 69: Hoare triple {9982#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9982#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:59,433 INFO L273 TraceCheckUtils]: 70: Hoare triple {9982#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9982#(<= main_~i~0 21)} is VALID [2018-11-23 11:55:59,434 INFO L273 TraceCheckUtils]: 71: Hoare triple {9982#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {9983#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:59,434 INFO L273 TraceCheckUtils]: 72: Hoare triple {9983#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9983#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:59,435 INFO L273 TraceCheckUtils]: 73: Hoare triple {9983#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {9983#(<= main_~i~0 22)} is VALID [2018-11-23 11:55:59,436 INFO L273 TraceCheckUtils]: 74: Hoare triple {9983#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {9984#(<= main_~i~0 23)} is VALID [2018-11-23 11:55:59,436 INFO L273 TraceCheckUtils]: 75: Hoare triple {9984#(<= main_~i~0 23)} assume !(~i~0 < 100000); {9960#false} is VALID [2018-11-23 11:55:59,436 INFO L273 TraceCheckUtils]: 76: Hoare triple {9960#false} havoc ~x~0;~x~0 := 0; {9960#false} is VALID [2018-11-23 11:55:59,437 INFO L273 TraceCheckUtils]: 77: Hoare triple {9960#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9960#false} is VALID [2018-11-23 11:55:59,437 INFO L256 TraceCheckUtils]: 78: Hoare triple {9960#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {9960#false} is VALID [2018-11-23 11:55:59,437 INFO L273 TraceCheckUtils]: 79: Hoare triple {9960#false} ~cond := #in~cond; {9960#false} is VALID [2018-11-23 11:55:59,437 INFO L273 TraceCheckUtils]: 80: Hoare triple {9960#false} assume 0 == ~cond; {9960#false} is VALID [2018-11-23 11:55:59,437 INFO L273 TraceCheckUtils]: 81: Hoare triple {9960#false} assume !false; {9960#false} is VALID [2018-11-23 11:55:59,443 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:59,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:59,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-23 11:55:59,461 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 82 [2018-11-23 11:55:59,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:59,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 11:55:59,544 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:59,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 11:55:59,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 11:55:59,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:55:59,545 INFO L87 Difference]: Start difference. First operand 87 states and 111 transitions. Second operand 27 states. [2018-11-23 11:55:59,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:59,821 INFO L93 Difference]: Finished difference Result 103 states and 130 transitions. [2018-11-23 11:55:59,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 11:55:59,821 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 82 [2018-11-23 11:55:59,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:59,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:55:59,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 130 transitions. [2018-11-23 11:55:59,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:55:59,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 130 transitions. [2018-11-23 11:55:59,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 130 transitions. [2018-11-23 11:55:59,944 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 11:55:59,945 INFO L225 Difference]: With dead ends: 103 [2018-11-23 11:55:59,946 INFO L226 Difference]: Without dead ends: 92 [2018-11-23 11:55:59,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:55:59,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-23 11:55:59,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-11-23 11:55:59,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:59,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 90 states. [2018-11-23 11:55:59,968 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 90 states. [2018-11-23 11:55:59,968 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 90 states. [2018-11-23 11:55:59,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:59,970 INFO L93 Difference]: Finished difference Result 92 states and 118 transitions. [2018-11-23 11:55:59,970 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 118 transitions. [2018-11-23 11:55:59,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:59,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:59,971 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 92 states. [2018-11-23 11:55:59,971 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 92 states. [2018-11-23 11:55:59,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:59,972 INFO L93 Difference]: Finished difference Result 92 states and 118 transitions. [2018-11-23 11:55:59,972 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 118 transitions. [2018-11-23 11:55:59,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:59,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:59,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:59,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:59,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 11:55:59,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 115 transitions. [2018-11-23 11:55:59,974 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 115 transitions. Word has length 82 [2018-11-23 11:55:59,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:59,974 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 115 transitions. [2018-11-23 11:55:59,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 11:55:59,975 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 115 transitions. [2018-11-23 11:55:59,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 11:55:59,975 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:59,975 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:59,976 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:59,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:59,976 INFO L82 PathProgramCache]: Analyzing trace with hash 2074266041, now seen corresponding path program 24 times [2018-11-23 11:55:59,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:59,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:59,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:59,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:59,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:00,805 INFO L256 TraceCheckUtils]: 0: Hoare triple {10675#true} call ULTIMATE.init(); {10675#true} is VALID [2018-11-23 11:56:00,806 INFO L273 TraceCheckUtils]: 1: Hoare triple {10675#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10675#true} is VALID [2018-11-23 11:56:00,806 INFO L273 TraceCheckUtils]: 2: Hoare triple {10675#true} assume true; {10675#true} is VALID [2018-11-23 11:56:00,806 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10675#true} {10675#true} #55#return; {10675#true} is VALID [2018-11-23 11:56:00,806 INFO L256 TraceCheckUtils]: 4: Hoare triple {10675#true} call #t~ret4 := main(); {10675#true} is VALID [2018-11-23 11:56:00,809 INFO L273 TraceCheckUtils]: 5: Hoare triple {10675#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {10677#(= main_~i~0 0)} is VALID [2018-11-23 11:56:00,810 INFO L273 TraceCheckUtils]: 6: Hoare triple {10677#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10677#(= main_~i~0 0)} is VALID [2018-11-23 11:56:00,810 INFO L273 TraceCheckUtils]: 7: Hoare triple {10677#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10677#(= main_~i~0 0)} is VALID [2018-11-23 11:56:00,810 INFO L273 TraceCheckUtils]: 8: Hoare triple {10677#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {10678#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:00,811 INFO L273 TraceCheckUtils]: 9: Hoare triple {10678#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10678#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:00,811 INFO L273 TraceCheckUtils]: 10: Hoare triple {10678#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10678#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:00,811 INFO L273 TraceCheckUtils]: 11: Hoare triple {10678#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {10679#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:00,812 INFO L273 TraceCheckUtils]: 12: Hoare triple {10679#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10679#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:00,812 INFO L273 TraceCheckUtils]: 13: Hoare triple {10679#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10679#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:00,813 INFO L273 TraceCheckUtils]: 14: Hoare triple {10679#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {10680#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:00,813 INFO L273 TraceCheckUtils]: 15: Hoare triple {10680#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10680#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:00,814 INFO L273 TraceCheckUtils]: 16: Hoare triple {10680#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10680#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:00,814 INFO L273 TraceCheckUtils]: 17: Hoare triple {10680#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {10681#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:00,815 INFO L273 TraceCheckUtils]: 18: Hoare triple {10681#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10681#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:00,815 INFO L273 TraceCheckUtils]: 19: Hoare triple {10681#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10681#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:00,816 INFO L273 TraceCheckUtils]: 20: Hoare triple {10681#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {10682#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:00,817 INFO L273 TraceCheckUtils]: 21: Hoare triple {10682#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10682#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:00,817 INFO L273 TraceCheckUtils]: 22: Hoare triple {10682#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10682#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:00,818 INFO L273 TraceCheckUtils]: 23: Hoare triple {10682#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {10683#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:00,818 INFO L273 TraceCheckUtils]: 24: Hoare triple {10683#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10683#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:00,819 INFO L273 TraceCheckUtils]: 25: Hoare triple {10683#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10683#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:00,820 INFO L273 TraceCheckUtils]: 26: Hoare triple {10683#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {10684#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:00,820 INFO L273 TraceCheckUtils]: 27: Hoare triple {10684#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10684#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:00,821 INFO L273 TraceCheckUtils]: 28: Hoare triple {10684#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10684#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:00,821 INFO L273 TraceCheckUtils]: 29: Hoare triple {10684#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {10685#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:00,822 INFO L273 TraceCheckUtils]: 30: Hoare triple {10685#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10685#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:00,822 INFO L273 TraceCheckUtils]: 31: Hoare triple {10685#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10685#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:00,823 INFO L273 TraceCheckUtils]: 32: Hoare triple {10685#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {10686#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:00,824 INFO L273 TraceCheckUtils]: 33: Hoare triple {10686#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10686#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:00,824 INFO L273 TraceCheckUtils]: 34: Hoare triple {10686#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10686#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:00,825 INFO L273 TraceCheckUtils]: 35: Hoare triple {10686#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {10687#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:00,825 INFO L273 TraceCheckUtils]: 36: Hoare triple {10687#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10687#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:00,826 INFO L273 TraceCheckUtils]: 37: Hoare triple {10687#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10687#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:00,827 INFO L273 TraceCheckUtils]: 38: Hoare triple {10687#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {10688#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:00,827 INFO L273 TraceCheckUtils]: 39: Hoare triple {10688#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10688#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:00,828 INFO L273 TraceCheckUtils]: 40: Hoare triple {10688#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10688#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:00,828 INFO L273 TraceCheckUtils]: 41: Hoare triple {10688#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {10689#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:00,829 INFO L273 TraceCheckUtils]: 42: Hoare triple {10689#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10689#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:00,829 INFO L273 TraceCheckUtils]: 43: Hoare triple {10689#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10689#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:00,830 INFO L273 TraceCheckUtils]: 44: Hoare triple {10689#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {10690#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:00,831 INFO L273 TraceCheckUtils]: 45: Hoare triple {10690#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10690#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:00,831 INFO L273 TraceCheckUtils]: 46: Hoare triple {10690#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10690#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:00,832 INFO L273 TraceCheckUtils]: 47: Hoare triple {10690#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {10691#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:00,832 INFO L273 TraceCheckUtils]: 48: Hoare triple {10691#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10691#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:00,833 INFO L273 TraceCheckUtils]: 49: Hoare triple {10691#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10691#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:00,834 INFO L273 TraceCheckUtils]: 50: Hoare triple {10691#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {10692#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:00,834 INFO L273 TraceCheckUtils]: 51: Hoare triple {10692#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10692#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:00,835 INFO L273 TraceCheckUtils]: 52: Hoare triple {10692#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10692#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:00,835 INFO L273 TraceCheckUtils]: 53: Hoare triple {10692#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {10693#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:00,836 INFO L273 TraceCheckUtils]: 54: Hoare triple {10693#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10693#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:00,836 INFO L273 TraceCheckUtils]: 55: Hoare triple {10693#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10693#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:00,837 INFO L273 TraceCheckUtils]: 56: Hoare triple {10693#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {10694#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:00,838 INFO L273 TraceCheckUtils]: 57: Hoare triple {10694#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10694#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:00,838 INFO L273 TraceCheckUtils]: 58: Hoare triple {10694#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10694#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:00,839 INFO L273 TraceCheckUtils]: 59: Hoare triple {10694#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {10695#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:00,839 INFO L273 TraceCheckUtils]: 60: Hoare triple {10695#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10695#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:00,840 INFO L273 TraceCheckUtils]: 61: Hoare triple {10695#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10695#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:00,841 INFO L273 TraceCheckUtils]: 62: Hoare triple {10695#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {10696#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:00,841 INFO L273 TraceCheckUtils]: 63: Hoare triple {10696#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10696#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:00,842 INFO L273 TraceCheckUtils]: 64: Hoare triple {10696#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10696#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:00,842 INFO L273 TraceCheckUtils]: 65: Hoare triple {10696#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {10697#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:00,843 INFO L273 TraceCheckUtils]: 66: Hoare triple {10697#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10697#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:00,844 INFO L273 TraceCheckUtils]: 67: Hoare triple {10697#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10697#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:00,844 INFO L273 TraceCheckUtils]: 68: Hoare triple {10697#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {10698#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:00,845 INFO L273 TraceCheckUtils]: 69: Hoare triple {10698#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10698#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:00,845 INFO L273 TraceCheckUtils]: 70: Hoare triple {10698#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10698#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:00,846 INFO L273 TraceCheckUtils]: 71: Hoare triple {10698#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {10699#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:00,847 INFO L273 TraceCheckUtils]: 72: Hoare triple {10699#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10699#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:00,847 INFO L273 TraceCheckUtils]: 73: Hoare triple {10699#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10699#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:00,848 INFO L273 TraceCheckUtils]: 74: Hoare triple {10699#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {10700#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:00,848 INFO L273 TraceCheckUtils]: 75: Hoare triple {10700#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10700#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:00,849 INFO L273 TraceCheckUtils]: 76: Hoare triple {10700#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10700#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:00,850 INFO L273 TraceCheckUtils]: 77: Hoare triple {10700#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {10701#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:00,850 INFO L273 TraceCheckUtils]: 78: Hoare triple {10701#(<= main_~i~0 24)} assume !(~i~0 < 100000); {10676#false} is VALID [2018-11-23 11:56:00,850 INFO L273 TraceCheckUtils]: 79: Hoare triple {10676#false} havoc ~x~0;~x~0 := 0; {10676#false} is VALID [2018-11-23 11:56:00,851 INFO L273 TraceCheckUtils]: 80: Hoare triple {10676#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10676#false} is VALID [2018-11-23 11:56:00,851 INFO L256 TraceCheckUtils]: 81: Hoare triple {10676#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {10676#false} is VALID [2018-11-23 11:56:00,851 INFO L273 TraceCheckUtils]: 82: Hoare triple {10676#false} ~cond := #in~cond; {10676#false} is VALID [2018-11-23 11:56:00,851 INFO L273 TraceCheckUtils]: 83: Hoare triple {10676#false} assume 0 == ~cond; {10676#false} is VALID [2018-11-23 11:56:00,851 INFO L273 TraceCheckUtils]: 84: Hoare triple {10676#false} assume !false; {10676#false} is VALID [2018-11-23 11:56:00,857 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:00,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:00,857 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:00,868 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:56:00,921 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-11-23 11:56:00,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:00,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:01,152 INFO L256 TraceCheckUtils]: 0: Hoare triple {10675#true} call ULTIMATE.init(); {10675#true} is VALID [2018-11-23 11:56:01,152 INFO L273 TraceCheckUtils]: 1: Hoare triple {10675#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10675#true} is VALID [2018-11-23 11:56:01,153 INFO L273 TraceCheckUtils]: 2: Hoare triple {10675#true} assume true; {10675#true} is VALID [2018-11-23 11:56:01,153 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10675#true} {10675#true} #55#return; {10675#true} is VALID [2018-11-23 11:56:01,153 INFO L256 TraceCheckUtils]: 4: Hoare triple {10675#true} call #t~ret4 := main(); {10675#true} is VALID [2018-11-23 11:56:01,154 INFO L273 TraceCheckUtils]: 5: Hoare triple {10675#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {10720#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:01,154 INFO L273 TraceCheckUtils]: 6: Hoare triple {10720#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10720#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:01,154 INFO L273 TraceCheckUtils]: 7: Hoare triple {10720#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10720#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:01,155 INFO L273 TraceCheckUtils]: 8: Hoare triple {10720#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {10678#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:01,155 INFO L273 TraceCheckUtils]: 9: Hoare triple {10678#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10678#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:01,155 INFO L273 TraceCheckUtils]: 10: Hoare triple {10678#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10678#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:01,156 INFO L273 TraceCheckUtils]: 11: Hoare triple {10678#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {10679#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:01,156 INFO L273 TraceCheckUtils]: 12: Hoare triple {10679#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10679#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:01,156 INFO L273 TraceCheckUtils]: 13: Hoare triple {10679#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10679#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:01,157 INFO L273 TraceCheckUtils]: 14: Hoare triple {10679#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {10680#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:01,158 INFO L273 TraceCheckUtils]: 15: Hoare triple {10680#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10680#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:01,158 INFO L273 TraceCheckUtils]: 16: Hoare triple {10680#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10680#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:01,159 INFO L273 TraceCheckUtils]: 17: Hoare triple {10680#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {10681#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:01,159 INFO L273 TraceCheckUtils]: 18: Hoare triple {10681#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10681#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:01,160 INFO L273 TraceCheckUtils]: 19: Hoare triple {10681#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10681#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:01,161 INFO L273 TraceCheckUtils]: 20: Hoare triple {10681#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {10682#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:01,161 INFO L273 TraceCheckUtils]: 21: Hoare triple {10682#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10682#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:01,162 INFO L273 TraceCheckUtils]: 22: Hoare triple {10682#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10682#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:01,162 INFO L273 TraceCheckUtils]: 23: Hoare triple {10682#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {10683#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:01,163 INFO L273 TraceCheckUtils]: 24: Hoare triple {10683#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10683#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:01,163 INFO L273 TraceCheckUtils]: 25: Hoare triple {10683#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10683#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:01,164 INFO L273 TraceCheckUtils]: 26: Hoare triple {10683#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {10684#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:01,165 INFO L273 TraceCheckUtils]: 27: Hoare triple {10684#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10684#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:01,165 INFO L273 TraceCheckUtils]: 28: Hoare triple {10684#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10684#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:01,166 INFO L273 TraceCheckUtils]: 29: Hoare triple {10684#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {10685#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:01,166 INFO L273 TraceCheckUtils]: 30: Hoare triple {10685#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10685#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:01,167 INFO L273 TraceCheckUtils]: 31: Hoare triple {10685#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10685#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:01,168 INFO L273 TraceCheckUtils]: 32: Hoare triple {10685#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {10686#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:01,168 INFO L273 TraceCheckUtils]: 33: Hoare triple {10686#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10686#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:01,169 INFO L273 TraceCheckUtils]: 34: Hoare triple {10686#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10686#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:01,169 INFO L273 TraceCheckUtils]: 35: Hoare triple {10686#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {10687#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:01,170 INFO L273 TraceCheckUtils]: 36: Hoare triple {10687#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10687#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:01,170 INFO L273 TraceCheckUtils]: 37: Hoare triple {10687#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10687#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:01,171 INFO L273 TraceCheckUtils]: 38: Hoare triple {10687#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {10688#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:01,172 INFO L273 TraceCheckUtils]: 39: Hoare triple {10688#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10688#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:01,172 INFO L273 TraceCheckUtils]: 40: Hoare triple {10688#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10688#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:01,173 INFO L273 TraceCheckUtils]: 41: Hoare triple {10688#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {10689#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:01,173 INFO L273 TraceCheckUtils]: 42: Hoare triple {10689#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10689#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:01,174 INFO L273 TraceCheckUtils]: 43: Hoare triple {10689#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10689#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:01,175 INFO L273 TraceCheckUtils]: 44: Hoare triple {10689#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {10690#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:01,175 INFO L273 TraceCheckUtils]: 45: Hoare triple {10690#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10690#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:01,176 INFO L273 TraceCheckUtils]: 46: Hoare triple {10690#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10690#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:01,176 INFO L273 TraceCheckUtils]: 47: Hoare triple {10690#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {10691#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:01,177 INFO L273 TraceCheckUtils]: 48: Hoare triple {10691#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10691#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:01,177 INFO L273 TraceCheckUtils]: 49: Hoare triple {10691#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10691#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:01,178 INFO L273 TraceCheckUtils]: 50: Hoare triple {10691#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {10692#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:01,179 INFO L273 TraceCheckUtils]: 51: Hoare triple {10692#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10692#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:01,179 INFO L273 TraceCheckUtils]: 52: Hoare triple {10692#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10692#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:01,180 INFO L273 TraceCheckUtils]: 53: Hoare triple {10692#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {10693#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:01,181 INFO L273 TraceCheckUtils]: 54: Hoare triple {10693#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10693#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:01,181 INFO L273 TraceCheckUtils]: 55: Hoare triple {10693#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10693#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:01,182 INFO L273 TraceCheckUtils]: 56: Hoare triple {10693#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {10694#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:01,182 INFO L273 TraceCheckUtils]: 57: Hoare triple {10694#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10694#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:01,183 INFO L273 TraceCheckUtils]: 58: Hoare triple {10694#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10694#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:01,183 INFO L273 TraceCheckUtils]: 59: Hoare triple {10694#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {10695#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:01,184 INFO L273 TraceCheckUtils]: 60: Hoare triple {10695#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10695#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:01,185 INFO L273 TraceCheckUtils]: 61: Hoare triple {10695#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10695#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:01,185 INFO L273 TraceCheckUtils]: 62: Hoare triple {10695#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {10696#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:01,186 INFO L273 TraceCheckUtils]: 63: Hoare triple {10696#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10696#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:01,186 INFO L273 TraceCheckUtils]: 64: Hoare triple {10696#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10696#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:01,187 INFO L273 TraceCheckUtils]: 65: Hoare triple {10696#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {10697#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:01,188 INFO L273 TraceCheckUtils]: 66: Hoare triple {10697#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10697#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:01,188 INFO L273 TraceCheckUtils]: 67: Hoare triple {10697#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10697#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:01,189 INFO L273 TraceCheckUtils]: 68: Hoare triple {10697#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {10698#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:01,189 INFO L273 TraceCheckUtils]: 69: Hoare triple {10698#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10698#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:01,190 INFO L273 TraceCheckUtils]: 70: Hoare triple {10698#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10698#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:01,191 INFO L273 TraceCheckUtils]: 71: Hoare triple {10698#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {10699#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:01,191 INFO L273 TraceCheckUtils]: 72: Hoare triple {10699#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10699#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:01,192 INFO L273 TraceCheckUtils]: 73: Hoare triple {10699#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10699#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:01,192 INFO L273 TraceCheckUtils]: 74: Hoare triple {10699#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {10700#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:01,193 INFO L273 TraceCheckUtils]: 75: Hoare triple {10700#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10700#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:01,193 INFO L273 TraceCheckUtils]: 76: Hoare triple {10700#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {10700#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:01,194 INFO L273 TraceCheckUtils]: 77: Hoare triple {10700#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {10701#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:01,195 INFO L273 TraceCheckUtils]: 78: Hoare triple {10701#(<= main_~i~0 24)} assume !(~i~0 < 100000); {10676#false} is VALID [2018-11-23 11:56:01,195 INFO L273 TraceCheckUtils]: 79: Hoare triple {10676#false} havoc ~x~0;~x~0 := 0; {10676#false} is VALID [2018-11-23 11:56:01,195 INFO L273 TraceCheckUtils]: 80: Hoare triple {10676#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10676#false} is VALID [2018-11-23 11:56:01,195 INFO L256 TraceCheckUtils]: 81: Hoare triple {10676#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {10676#false} is VALID [2018-11-23 11:56:01,196 INFO L273 TraceCheckUtils]: 82: Hoare triple {10676#false} ~cond := #in~cond; {10676#false} is VALID [2018-11-23 11:56:01,196 INFO L273 TraceCheckUtils]: 83: Hoare triple {10676#false} assume 0 == ~cond; {10676#false} is VALID [2018-11-23 11:56:01,196 INFO L273 TraceCheckUtils]: 84: Hoare triple {10676#false} assume !false; {10676#false} is VALID [2018-11-23 11:56:01,202 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:01,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:01,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-11-23 11:56:01,221 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 85 [2018-11-23 11:56:01,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:01,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 11:56:01,308 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:01,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 11:56:01,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 11:56:01,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:56:01,310 INFO L87 Difference]: Start difference. First operand 90 states and 115 transitions. Second operand 28 states. [2018-11-23 11:56:01,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:01,874 INFO L93 Difference]: Finished difference Result 106 states and 134 transitions. [2018-11-23 11:56:01,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 11:56:01,874 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 85 [2018-11-23 11:56:01,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:01,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:56:01,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 134 transitions. [2018-11-23 11:56:01,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:56:01,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 134 transitions. [2018-11-23 11:56:01,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 134 transitions. [2018-11-23 11:56:02,005 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:02,007 INFO L225 Difference]: With dead ends: 106 [2018-11-23 11:56:02,007 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 11:56:02,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:56:02,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 11:56:02,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2018-11-23 11:56:02,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:02,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 93 states. [2018-11-23 11:56:02,037 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 93 states. [2018-11-23 11:56:02,037 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 93 states. [2018-11-23 11:56:02,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:02,039 INFO L93 Difference]: Finished difference Result 95 states and 122 transitions. [2018-11-23 11:56:02,039 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 122 transitions. [2018-11-23 11:56:02,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:02,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:02,040 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 95 states. [2018-11-23 11:56:02,041 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 95 states. [2018-11-23 11:56:02,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:02,042 INFO L93 Difference]: Finished difference Result 95 states and 122 transitions. [2018-11-23 11:56:02,042 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 122 transitions. [2018-11-23 11:56:02,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:02,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:02,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:02,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:02,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-23 11:56:02,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 119 transitions. [2018-11-23 11:56:02,045 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 119 transitions. Word has length 85 [2018-11-23 11:56:02,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:02,045 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 119 transitions. [2018-11-23 11:56:02,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 11:56:02,045 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 119 transitions. [2018-11-23 11:56:02,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-23 11:56:02,046 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:02,046 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:02,046 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:02,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:02,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1810505699, now seen corresponding path program 25 times [2018-11-23 11:56:02,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:02,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:02,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:02,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:02,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:02,878 INFO L256 TraceCheckUtils]: 0: Hoare triple {11415#true} call ULTIMATE.init(); {11415#true} is VALID [2018-11-23 11:56:02,878 INFO L273 TraceCheckUtils]: 1: Hoare triple {11415#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11415#true} is VALID [2018-11-23 11:56:02,879 INFO L273 TraceCheckUtils]: 2: Hoare triple {11415#true} assume true; {11415#true} is VALID [2018-11-23 11:56:02,879 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11415#true} {11415#true} #55#return; {11415#true} is VALID [2018-11-23 11:56:02,879 INFO L256 TraceCheckUtils]: 4: Hoare triple {11415#true} call #t~ret4 := main(); {11415#true} is VALID [2018-11-23 11:56:02,880 INFO L273 TraceCheckUtils]: 5: Hoare triple {11415#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {11417#(= main_~i~0 0)} is VALID [2018-11-23 11:56:02,880 INFO L273 TraceCheckUtils]: 6: Hoare triple {11417#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11417#(= main_~i~0 0)} is VALID [2018-11-23 11:56:02,881 INFO L273 TraceCheckUtils]: 7: Hoare triple {11417#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11417#(= main_~i~0 0)} is VALID [2018-11-23 11:56:02,882 INFO L273 TraceCheckUtils]: 8: Hoare triple {11417#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {11418#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:02,882 INFO L273 TraceCheckUtils]: 9: Hoare triple {11418#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11418#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:02,883 INFO L273 TraceCheckUtils]: 10: Hoare triple {11418#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11418#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:02,884 INFO L273 TraceCheckUtils]: 11: Hoare triple {11418#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {11419#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:02,885 INFO L273 TraceCheckUtils]: 12: Hoare triple {11419#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11419#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:02,885 INFO L273 TraceCheckUtils]: 13: Hoare triple {11419#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11419#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:02,886 INFO L273 TraceCheckUtils]: 14: Hoare triple {11419#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {11420#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:02,887 INFO L273 TraceCheckUtils]: 15: Hoare triple {11420#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11420#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:02,887 INFO L273 TraceCheckUtils]: 16: Hoare triple {11420#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11420#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:02,888 INFO L273 TraceCheckUtils]: 17: Hoare triple {11420#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {11421#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:02,889 INFO L273 TraceCheckUtils]: 18: Hoare triple {11421#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11421#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:02,889 INFO L273 TraceCheckUtils]: 19: Hoare triple {11421#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11421#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:02,890 INFO L273 TraceCheckUtils]: 20: Hoare triple {11421#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {11422#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:02,891 INFO L273 TraceCheckUtils]: 21: Hoare triple {11422#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11422#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:02,891 INFO L273 TraceCheckUtils]: 22: Hoare triple {11422#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11422#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:02,892 INFO L273 TraceCheckUtils]: 23: Hoare triple {11422#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {11423#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:02,893 INFO L273 TraceCheckUtils]: 24: Hoare triple {11423#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11423#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:02,893 INFO L273 TraceCheckUtils]: 25: Hoare triple {11423#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11423#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:02,894 INFO L273 TraceCheckUtils]: 26: Hoare triple {11423#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {11424#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:02,895 INFO L273 TraceCheckUtils]: 27: Hoare triple {11424#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11424#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:02,896 INFO L273 TraceCheckUtils]: 28: Hoare triple {11424#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11424#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:02,896 INFO L273 TraceCheckUtils]: 29: Hoare triple {11424#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {11425#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:02,897 INFO L273 TraceCheckUtils]: 30: Hoare triple {11425#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11425#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:02,898 INFO L273 TraceCheckUtils]: 31: Hoare triple {11425#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11425#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:02,898 INFO L273 TraceCheckUtils]: 32: Hoare triple {11425#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {11426#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:02,899 INFO L273 TraceCheckUtils]: 33: Hoare triple {11426#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11426#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:02,900 INFO L273 TraceCheckUtils]: 34: Hoare triple {11426#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11426#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:02,900 INFO L273 TraceCheckUtils]: 35: Hoare triple {11426#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {11427#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:02,901 INFO L273 TraceCheckUtils]: 36: Hoare triple {11427#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11427#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:02,902 INFO L273 TraceCheckUtils]: 37: Hoare triple {11427#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11427#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:02,902 INFO L273 TraceCheckUtils]: 38: Hoare triple {11427#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {11428#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:02,903 INFO L273 TraceCheckUtils]: 39: Hoare triple {11428#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11428#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:02,904 INFO L273 TraceCheckUtils]: 40: Hoare triple {11428#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11428#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:02,904 INFO L273 TraceCheckUtils]: 41: Hoare triple {11428#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {11429#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:02,905 INFO L273 TraceCheckUtils]: 42: Hoare triple {11429#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11429#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:02,906 INFO L273 TraceCheckUtils]: 43: Hoare triple {11429#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11429#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:02,907 INFO L273 TraceCheckUtils]: 44: Hoare triple {11429#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {11430#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:02,907 INFO L273 TraceCheckUtils]: 45: Hoare triple {11430#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11430#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:02,908 INFO L273 TraceCheckUtils]: 46: Hoare triple {11430#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11430#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:02,909 INFO L273 TraceCheckUtils]: 47: Hoare triple {11430#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {11431#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:02,909 INFO L273 TraceCheckUtils]: 48: Hoare triple {11431#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11431#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:02,910 INFO L273 TraceCheckUtils]: 49: Hoare triple {11431#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11431#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:02,911 INFO L273 TraceCheckUtils]: 50: Hoare triple {11431#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {11432#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:02,911 INFO L273 TraceCheckUtils]: 51: Hoare triple {11432#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11432#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:02,912 INFO L273 TraceCheckUtils]: 52: Hoare triple {11432#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11432#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:02,913 INFO L273 TraceCheckUtils]: 53: Hoare triple {11432#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {11433#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:02,913 INFO L273 TraceCheckUtils]: 54: Hoare triple {11433#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11433#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:02,914 INFO L273 TraceCheckUtils]: 55: Hoare triple {11433#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11433#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:02,915 INFO L273 TraceCheckUtils]: 56: Hoare triple {11433#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {11434#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:02,915 INFO L273 TraceCheckUtils]: 57: Hoare triple {11434#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11434#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:02,916 INFO L273 TraceCheckUtils]: 58: Hoare triple {11434#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11434#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:02,917 INFO L273 TraceCheckUtils]: 59: Hoare triple {11434#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {11435#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:02,917 INFO L273 TraceCheckUtils]: 60: Hoare triple {11435#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11435#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:02,918 INFO L273 TraceCheckUtils]: 61: Hoare triple {11435#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11435#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:02,919 INFO L273 TraceCheckUtils]: 62: Hoare triple {11435#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {11436#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:02,920 INFO L273 TraceCheckUtils]: 63: Hoare triple {11436#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11436#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:02,920 INFO L273 TraceCheckUtils]: 64: Hoare triple {11436#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11436#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:02,921 INFO L273 TraceCheckUtils]: 65: Hoare triple {11436#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {11437#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:02,922 INFO L273 TraceCheckUtils]: 66: Hoare triple {11437#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11437#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:02,922 INFO L273 TraceCheckUtils]: 67: Hoare triple {11437#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11437#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:02,923 INFO L273 TraceCheckUtils]: 68: Hoare triple {11437#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {11438#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:02,924 INFO L273 TraceCheckUtils]: 69: Hoare triple {11438#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11438#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:02,924 INFO L273 TraceCheckUtils]: 70: Hoare triple {11438#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11438#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:02,925 INFO L273 TraceCheckUtils]: 71: Hoare triple {11438#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {11439#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:02,926 INFO L273 TraceCheckUtils]: 72: Hoare triple {11439#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11439#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:02,926 INFO L273 TraceCheckUtils]: 73: Hoare triple {11439#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11439#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:02,927 INFO L273 TraceCheckUtils]: 74: Hoare triple {11439#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {11440#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:02,928 INFO L273 TraceCheckUtils]: 75: Hoare triple {11440#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11440#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:02,928 INFO L273 TraceCheckUtils]: 76: Hoare triple {11440#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11440#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:02,929 INFO L273 TraceCheckUtils]: 77: Hoare triple {11440#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {11441#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:02,930 INFO L273 TraceCheckUtils]: 78: Hoare triple {11441#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11441#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:02,930 INFO L273 TraceCheckUtils]: 79: Hoare triple {11441#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11441#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:02,931 INFO L273 TraceCheckUtils]: 80: Hoare triple {11441#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {11442#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:02,932 INFO L273 TraceCheckUtils]: 81: Hoare triple {11442#(<= main_~i~0 25)} assume !(~i~0 < 100000); {11416#false} is VALID [2018-11-23 11:56:02,932 INFO L273 TraceCheckUtils]: 82: Hoare triple {11416#false} havoc ~x~0;~x~0 := 0; {11416#false} is VALID [2018-11-23 11:56:02,933 INFO L273 TraceCheckUtils]: 83: Hoare triple {11416#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11416#false} is VALID [2018-11-23 11:56:02,933 INFO L256 TraceCheckUtils]: 84: Hoare triple {11416#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {11416#false} is VALID [2018-11-23 11:56:02,933 INFO L273 TraceCheckUtils]: 85: Hoare triple {11416#false} ~cond := #in~cond; {11416#false} is VALID [2018-11-23 11:56:02,933 INFO L273 TraceCheckUtils]: 86: Hoare triple {11416#false} assume 0 == ~cond; {11416#false} is VALID [2018-11-23 11:56:02,934 INFO L273 TraceCheckUtils]: 87: Hoare triple {11416#false} assume !false; {11416#false} is VALID [2018-11-23 11:56:02,960 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:02,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:02,960 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:02,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:56:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:03,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:03,259 INFO L256 TraceCheckUtils]: 0: Hoare triple {11415#true} call ULTIMATE.init(); {11415#true} is VALID [2018-11-23 11:56:03,259 INFO L273 TraceCheckUtils]: 1: Hoare triple {11415#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11415#true} is VALID [2018-11-23 11:56:03,259 INFO L273 TraceCheckUtils]: 2: Hoare triple {11415#true} assume true; {11415#true} is VALID [2018-11-23 11:56:03,260 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11415#true} {11415#true} #55#return; {11415#true} is VALID [2018-11-23 11:56:03,260 INFO L256 TraceCheckUtils]: 4: Hoare triple {11415#true} call #t~ret4 := main(); {11415#true} is VALID [2018-11-23 11:56:03,261 INFO L273 TraceCheckUtils]: 5: Hoare triple {11415#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {11461#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:03,261 INFO L273 TraceCheckUtils]: 6: Hoare triple {11461#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11461#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:03,261 INFO L273 TraceCheckUtils]: 7: Hoare triple {11461#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11461#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:03,262 INFO L273 TraceCheckUtils]: 8: Hoare triple {11461#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {11418#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:03,262 INFO L273 TraceCheckUtils]: 9: Hoare triple {11418#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11418#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:03,263 INFO L273 TraceCheckUtils]: 10: Hoare triple {11418#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11418#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:03,263 INFO L273 TraceCheckUtils]: 11: Hoare triple {11418#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {11419#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:03,263 INFO L273 TraceCheckUtils]: 12: Hoare triple {11419#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11419#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:03,264 INFO L273 TraceCheckUtils]: 13: Hoare triple {11419#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11419#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:03,265 INFO L273 TraceCheckUtils]: 14: Hoare triple {11419#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {11420#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:03,265 INFO L273 TraceCheckUtils]: 15: Hoare triple {11420#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11420#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:03,266 INFO L273 TraceCheckUtils]: 16: Hoare triple {11420#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11420#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:03,266 INFO L273 TraceCheckUtils]: 17: Hoare triple {11420#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {11421#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:03,267 INFO L273 TraceCheckUtils]: 18: Hoare triple {11421#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11421#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:03,267 INFO L273 TraceCheckUtils]: 19: Hoare triple {11421#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11421#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:03,268 INFO L273 TraceCheckUtils]: 20: Hoare triple {11421#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {11422#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:03,269 INFO L273 TraceCheckUtils]: 21: Hoare triple {11422#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11422#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:03,269 INFO L273 TraceCheckUtils]: 22: Hoare triple {11422#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11422#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:03,270 INFO L273 TraceCheckUtils]: 23: Hoare triple {11422#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {11423#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:03,270 INFO L273 TraceCheckUtils]: 24: Hoare triple {11423#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11423#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:03,271 INFO L273 TraceCheckUtils]: 25: Hoare triple {11423#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11423#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:03,272 INFO L273 TraceCheckUtils]: 26: Hoare triple {11423#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {11424#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:03,272 INFO L273 TraceCheckUtils]: 27: Hoare triple {11424#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11424#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:03,273 INFO L273 TraceCheckUtils]: 28: Hoare triple {11424#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11424#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:03,273 INFO L273 TraceCheckUtils]: 29: Hoare triple {11424#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {11425#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:03,274 INFO L273 TraceCheckUtils]: 30: Hoare triple {11425#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11425#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:03,274 INFO L273 TraceCheckUtils]: 31: Hoare triple {11425#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11425#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:03,275 INFO L273 TraceCheckUtils]: 32: Hoare triple {11425#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {11426#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:03,276 INFO L273 TraceCheckUtils]: 33: Hoare triple {11426#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11426#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:03,276 INFO L273 TraceCheckUtils]: 34: Hoare triple {11426#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11426#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:03,277 INFO L273 TraceCheckUtils]: 35: Hoare triple {11426#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {11427#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:03,277 INFO L273 TraceCheckUtils]: 36: Hoare triple {11427#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11427#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:03,278 INFO L273 TraceCheckUtils]: 37: Hoare triple {11427#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11427#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:03,279 INFO L273 TraceCheckUtils]: 38: Hoare triple {11427#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {11428#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:03,279 INFO L273 TraceCheckUtils]: 39: Hoare triple {11428#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11428#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:03,280 INFO L273 TraceCheckUtils]: 40: Hoare triple {11428#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11428#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:03,280 INFO L273 TraceCheckUtils]: 41: Hoare triple {11428#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {11429#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:03,281 INFO L273 TraceCheckUtils]: 42: Hoare triple {11429#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11429#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:03,281 INFO L273 TraceCheckUtils]: 43: Hoare triple {11429#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11429#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:03,282 INFO L273 TraceCheckUtils]: 44: Hoare triple {11429#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {11430#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:03,283 INFO L273 TraceCheckUtils]: 45: Hoare triple {11430#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11430#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:03,283 INFO L273 TraceCheckUtils]: 46: Hoare triple {11430#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11430#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:03,284 INFO L273 TraceCheckUtils]: 47: Hoare triple {11430#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {11431#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:03,284 INFO L273 TraceCheckUtils]: 48: Hoare triple {11431#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11431#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:03,285 INFO L273 TraceCheckUtils]: 49: Hoare triple {11431#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11431#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:03,286 INFO L273 TraceCheckUtils]: 50: Hoare triple {11431#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {11432#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:03,286 INFO L273 TraceCheckUtils]: 51: Hoare triple {11432#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11432#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:03,287 INFO L273 TraceCheckUtils]: 52: Hoare triple {11432#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11432#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:03,287 INFO L273 TraceCheckUtils]: 53: Hoare triple {11432#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {11433#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:03,288 INFO L273 TraceCheckUtils]: 54: Hoare triple {11433#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11433#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:03,289 INFO L273 TraceCheckUtils]: 55: Hoare triple {11433#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11433#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:03,289 INFO L273 TraceCheckUtils]: 56: Hoare triple {11433#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {11434#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:03,290 INFO L273 TraceCheckUtils]: 57: Hoare triple {11434#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11434#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:03,290 INFO L273 TraceCheckUtils]: 58: Hoare triple {11434#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11434#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:03,291 INFO L273 TraceCheckUtils]: 59: Hoare triple {11434#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {11435#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:03,292 INFO L273 TraceCheckUtils]: 60: Hoare triple {11435#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11435#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:03,292 INFO L273 TraceCheckUtils]: 61: Hoare triple {11435#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11435#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:03,293 INFO L273 TraceCheckUtils]: 62: Hoare triple {11435#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {11436#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:03,293 INFO L273 TraceCheckUtils]: 63: Hoare triple {11436#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11436#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:03,294 INFO L273 TraceCheckUtils]: 64: Hoare triple {11436#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11436#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:03,295 INFO L273 TraceCheckUtils]: 65: Hoare triple {11436#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {11437#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:03,295 INFO L273 TraceCheckUtils]: 66: Hoare triple {11437#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11437#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:03,296 INFO L273 TraceCheckUtils]: 67: Hoare triple {11437#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11437#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:03,296 INFO L273 TraceCheckUtils]: 68: Hoare triple {11437#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {11438#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:03,297 INFO L273 TraceCheckUtils]: 69: Hoare triple {11438#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11438#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:03,297 INFO L273 TraceCheckUtils]: 70: Hoare triple {11438#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11438#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:03,298 INFO L273 TraceCheckUtils]: 71: Hoare triple {11438#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {11439#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:03,299 INFO L273 TraceCheckUtils]: 72: Hoare triple {11439#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11439#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:03,299 INFO L273 TraceCheckUtils]: 73: Hoare triple {11439#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11439#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:03,300 INFO L273 TraceCheckUtils]: 74: Hoare triple {11439#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {11440#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:03,300 INFO L273 TraceCheckUtils]: 75: Hoare triple {11440#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11440#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:03,301 INFO L273 TraceCheckUtils]: 76: Hoare triple {11440#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11440#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:03,302 INFO L273 TraceCheckUtils]: 77: Hoare triple {11440#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {11441#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:03,302 INFO L273 TraceCheckUtils]: 78: Hoare triple {11441#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11441#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:03,303 INFO L273 TraceCheckUtils]: 79: Hoare triple {11441#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {11441#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:03,303 INFO L273 TraceCheckUtils]: 80: Hoare triple {11441#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {11442#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:03,304 INFO L273 TraceCheckUtils]: 81: Hoare triple {11442#(<= main_~i~0 25)} assume !(~i~0 < 100000); {11416#false} is VALID [2018-11-23 11:56:03,304 INFO L273 TraceCheckUtils]: 82: Hoare triple {11416#false} havoc ~x~0;~x~0 := 0; {11416#false} is VALID [2018-11-23 11:56:03,304 INFO L273 TraceCheckUtils]: 83: Hoare triple {11416#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11416#false} is VALID [2018-11-23 11:56:03,305 INFO L256 TraceCheckUtils]: 84: Hoare triple {11416#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {11416#false} is VALID [2018-11-23 11:56:03,305 INFO L273 TraceCheckUtils]: 85: Hoare triple {11416#false} ~cond := #in~cond; {11416#false} is VALID [2018-11-23 11:56:03,305 INFO L273 TraceCheckUtils]: 86: Hoare triple {11416#false} assume 0 == ~cond; {11416#false} is VALID [2018-11-23 11:56:03,305 INFO L273 TraceCheckUtils]: 87: Hoare triple {11416#false} assume !false; {11416#false} is VALID [2018-11-23 11:56:03,311 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:03,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:03,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-23 11:56:03,331 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 88 [2018-11-23 11:56:03,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:03,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 11:56:03,420 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:03,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 11:56:03,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 11:56:03,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:56:03,421 INFO L87 Difference]: Start difference. First operand 93 states and 119 transitions. Second operand 29 states. [2018-11-23 11:56:04,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:04,087 INFO L93 Difference]: Finished difference Result 109 states and 138 transitions. [2018-11-23 11:56:04,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 11:56:04,088 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 88 [2018-11-23 11:56:04,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:04,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:56:04,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 138 transitions. [2018-11-23 11:56:04,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:56:04,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 138 transitions. [2018-11-23 11:56:04,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 138 transitions. [2018-11-23 11:56:04,217 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:04,219 INFO L225 Difference]: With dead ends: 109 [2018-11-23 11:56:04,220 INFO L226 Difference]: Without dead ends: 98 [2018-11-23 11:56:04,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:56:04,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-23 11:56:04,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-11-23 11:56:04,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:04,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 96 states. [2018-11-23 11:56:04,252 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 96 states. [2018-11-23 11:56:04,253 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 96 states. [2018-11-23 11:56:04,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:04,254 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2018-11-23 11:56:04,254 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2018-11-23 11:56:04,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:04,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:04,255 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 98 states. [2018-11-23 11:56:04,255 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 98 states. [2018-11-23 11:56:04,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:04,256 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2018-11-23 11:56:04,256 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2018-11-23 11:56:04,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:04,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:04,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:04,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:04,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 11:56:04,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 123 transitions. [2018-11-23 11:56:04,258 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 123 transitions. Word has length 88 [2018-11-23 11:56:04,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:04,258 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 123 transitions. [2018-11-23 11:56:04,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 11:56:04,258 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2018-11-23 11:56:04,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 11:56:04,258 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:04,259 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:04,259 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:04,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:04,259 INFO L82 PathProgramCache]: Analyzing trace with hash -378658439, now seen corresponding path program 26 times [2018-11-23 11:56:04,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:04,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:04,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:04,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:56:04,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:05,002 INFO L256 TraceCheckUtils]: 0: Hoare triple {12179#true} call ULTIMATE.init(); {12179#true} is VALID [2018-11-23 11:56:05,002 INFO L273 TraceCheckUtils]: 1: Hoare triple {12179#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12179#true} is VALID [2018-11-23 11:56:05,002 INFO L273 TraceCheckUtils]: 2: Hoare triple {12179#true} assume true; {12179#true} is VALID [2018-11-23 11:56:05,003 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12179#true} {12179#true} #55#return; {12179#true} is VALID [2018-11-23 11:56:05,003 INFO L256 TraceCheckUtils]: 4: Hoare triple {12179#true} call #t~ret4 := main(); {12179#true} is VALID [2018-11-23 11:56:05,003 INFO L273 TraceCheckUtils]: 5: Hoare triple {12179#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {12181#(= main_~i~0 0)} is VALID [2018-11-23 11:56:05,004 INFO L273 TraceCheckUtils]: 6: Hoare triple {12181#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12181#(= main_~i~0 0)} is VALID [2018-11-23 11:56:05,004 INFO L273 TraceCheckUtils]: 7: Hoare triple {12181#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12181#(= main_~i~0 0)} is VALID [2018-11-23 11:56:05,005 INFO L273 TraceCheckUtils]: 8: Hoare triple {12181#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {12182#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:05,005 INFO L273 TraceCheckUtils]: 9: Hoare triple {12182#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12182#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:05,005 INFO L273 TraceCheckUtils]: 10: Hoare triple {12182#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12182#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:05,006 INFO L273 TraceCheckUtils]: 11: Hoare triple {12182#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {12183#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:05,006 INFO L273 TraceCheckUtils]: 12: Hoare triple {12183#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12183#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:05,007 INFO L273 TraceCheckUtils]: 13: Hoare triple {12183#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12183#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:05,007 INFO L273 TraceCheckUtils]: 14: Hoare triple {12183#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {12184#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:05,008 INFO L273 TraceCheckUtils]: 15: Hoare triple {12184#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12184#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:05,008 INFO L273 TraceCheckUtils]: 16: Hoare triple {12184#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12184#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:05,009 INFO L273 TraceCheckUtils]: 17: Hoare triple {12184#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {12185#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:05,010 INFO L273 TraceCheckUtils]: 18: Hoare triple {12185#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12185#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:05,010 INFO L273 TraceCheckUtils]: 19: Hoare triple {12185#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12185#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:05,011 INFO L273 TraceCheckUtils]: 20: Hoare triple {12185#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {12186#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:05,011 INFO L273 TraceCheckUtils]: 21: Hoare triple {12186#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12186#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:05,012 INFO L273 TraceCheckUtils]: 22: Hoare triple {12186#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12186#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:05,013 INFO L273 TraceCheckUtils]: 23: Hoare triple {12186#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {12187#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:05,013 INFO L273 TraceCheckUtils]: 24: Hoare triple {12187#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12187#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:05,014 INFO L273 TraceCheckUtils]: 25: Hoare triple {12187#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12187#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:05,014 INFO L273 TraceCheckUtils]: 26: Hoare triple {12187#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {12188#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:05,015 INFO L273 TraceCheckUtils]: 27: Hoare triple {12188#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12188#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:05,015 INFO L273 TraceCheckUtils]: 28: Hoare triple {12188#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12188#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:05,016 INFO L273 TraceCheckUtils]: 29: Hoare triple {12188#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {12189#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:05,017 INFO L273 TraceCheckUtils]: 30: Hoare triple {12189#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12189#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:05,017 INFO L273 TraceCheckUtils]: 31: Hoare triple {12189#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12189#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:05,018 INFO L273 TraceCheckUtils]: 32: Hoare triple {12189#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {12190#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:05,018 INFO L273 TraceCheckUtils]: 33: Hoare triple {12190#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12190#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:05,019 INFO L273 TraceCheckUtils]: 34: Hoare triple {12190#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12190#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:05,020 INFO L273 TraceCheckUtils]: 35: Hoare triple {12190#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {12191#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:05,020 INFO L273 TraceCheckUtils]: 36: Hoare triple {12191#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12191#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:05,021 INFO L273 TraceCheckUtils]: 37: Hoare triple {12191#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12191#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:05,021 INFO L273 TraceCheckUtils]: 38: Hoare triple {12191#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {12192#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:05,022 INFO L273 TraceCheckUtils]: 39: Hoare triple {12192#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12192#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:05,022 INFO L273 TraceCheckUtils]: 40: Hoare triple {12192#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12192#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:05,023 INFO L273 TraceCheckUtils]: 41: Hoare triple {12192#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {12193#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:05,024 INFO L273 TraceCheckUtils]: 42: Hoare triple {12193#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12193#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:05,024 INFO L273 TraceCheckUtils]: 43: Hoare triple {12193#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12193#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:05,025 INFO L273 TraceCheckUtils]: 44: Hoare triple {12193#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {12194#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:05,025 INFO L273 TraceCheckUtils]: 45: Hoare triple {12194#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12194#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:05,026 INFO L273 TraceCheckUtils]: 46: Hoare triple {12194#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12194#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:05,027 INFO L273 TraceCheckUtils]: 47: Hoare triple {12194#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {12195#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:05,027 INFO L273 TraceCheckUtils]: 48: Hoare triple {12195#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12195#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:05,028 INFO L273 TraceCheckUtils]: 49: Hoare triple {12195#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12195#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:05,028 INFO L273 TraceCheckUtils]: 50: Hoare triple {12195#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {12196#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:05,029 INFO L273 TraceCheckUtils]: 51: Hoare triple {12196#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12196#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:05,029 INFO L273 TraceCheckUtils]: 52: Hoare triple {12196#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12196#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:05,030 INFO L273 TraceCheckUtils]: 53: Hoare triple {12196#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {12197#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:05,031 INFO L273 TraceCheckUtils]: 54: Hoare triple {12197#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12197#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:05,031 INFO L273 TraceCheckUtils]: 55: Hoare triple {12197#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12197#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:05,032 INFO L273 TraceCheckUtils]: 56: Hoare triple {12197#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {12198#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:05,032 INFO L273 TraceCheckUtils]: 57: Hoare triple {12198#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12198#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:05,033 INFO L273 TraceCheckUtils]: 58: Hoare triple {12198#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12198#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:05,034 INFO L273 TraceCheckUtils]: 59: Hoare triple {12198#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {12199#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:05,034 INFO L273 TraceCheckUtils]: 60: Hoare triple {12199#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12199#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:05,035 INFO L273 TraceCheckUtils]: 61: Hoare triple {12199#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12199#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:05,037 INFO L273 TraceCheckUtils]: 62: Hoare triple {12199#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {12200#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:05,038 INFO L273 TraceCheckUtils]: 63: Hoare triple {12200#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12200#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:05,039 INFO L273 TraceCheckUtils]: 64: Hoare triple {12200#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12200#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:05,039 INFO L273 TraceCheckUtils]: 65: Hoare triple {12200#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {12201#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:05,040 INFO L273 TraceCheckUtils]: 66: Hoare triple {12201#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12201#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:05,040 INFO L273 TraceCheckUtils]: 67: Hoare triple {12201#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12201#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:05,041 INFO L273 TraceCheckUtils]: 68: Hoare triple {12201#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {12202#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:05,041 INFO L273 TraceCheckUtils]: 69: Hoare triple {12202#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12202#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:05,041 INFO L273 TraceCheckUtils]: 70: Hoare triple {12202#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12202#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:05,042 INFO L273 TraceCheckUtils]: 71: Hoare triple {12202#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {12203#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:05,042 INFO L273 TraceCheckUtils]: 72: Hoare triple {12203#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12203#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:05,043 INFO L273 TraceCheckUtils]: 73: Hoare triple {12203#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12203#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:05,043 INFO L273 TraceCheckUtils]: 74: Hoare triple {12203#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {12204#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:05,044 INFO L273 TraceCheckUtils]: 75: Hoare triple {12204#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12204#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:05,044 INFO L273 TraceCheckUtils]: 76: Hoare triple {12204#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12204#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:05,045 INFO L273 TraceCheckUtils]: 77: Hoare triple {12204#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {12205#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:05,046 INFO L273 TraceCheckUtils]: 78: Hoare triple {12205#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12205#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:05,046 INFO L273 TraceCheckUtils]: 79: Hoare triple {12205#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12205#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:05,047 INFO L273 TraceCheckUtils]: 80: Hoare triple {12205#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {12206#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:05,047 INFO L273 TraceCheckUtils]: 81: Hoare triple {12206#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12206#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:05,048 INFO L273 TraceCheckUtils]: 82: Hoare triple {12206#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12206#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:05,049 INFO L273 TraceCheckUtils]: 83: Hoare triple {12206#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {12207#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:05,049 INFO L273 TraceCheckUtils]: 84: Hoare triple {12207#(<= main_~i~0 26)} assume !(~i~0 < 100000); {12180#false} is VALID [2018-11-23 11:56:05,050 INFO L273 TraceCheckUtils]: 85: Hoare triple {12180#false} havoc ~x~0;~x~0 := 0; {12180#false} is VALID [2018-11-23 11:56:05,050 INFO L273 TraceCheckUtils]: 86: Hoare triple {12180#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12180#false} is VALID [2018-11-23 11:56:05,050 INFO L256 TraceCheckUtils]: 87: Hoare triple {12180#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {12180#false} is VALID [2018-11-23 11:56:05,050 INFO L273 TraceCheckUtils]: 88: Hoare triple {12180#false} ~cond := #in~cond; {12180#false} is VALID [2018-11-23 11:56:05,050 INFO L273 TraceCheckUtils]: 89: Hoare triple {12180#false} assume 0 == ~cond; {12180#false} is VALID [2018-11-23 11:56:05,051 INFO L273 TraceCheckUtils]: 90: Hoare triple {12180#false} assume !false; {12180#false} is VALID [2018-11-23 11:56:05,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:05,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:05,058 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:05,067 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:56:05,110 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:56:05,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:05,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:05,332 INFO L256 TraceCheckUtils]: 0: Hoare triple {12179#true} call ULTIMATE.init(); {12179#true} is VALID [2018-11-23 11:56:05,332 INFO L273 TraceCheckUtils]: 1: Hoare triple {12179#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12179#true} is VALID [2018-11-23 11:56:05,332 INFO L273 TraceCheckUtils]: 2: Hoare triple {12179#true} assume true; {12179#true} is VALID [2018-11-23 11:56:05,332 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12179#true} {12179#true} #55#return; {12179#true} is VALID [2018-11-23 11:56:05,332 INFO L256 TraceCheckUtils]: 4: Hoare triple {12179#true} call #t~ret4 := main(); {12179#true} is VALID [2018-11-23 11:56:05,333 INFO L273 TraceCheckUtils]: 5: Hoare triple {12179#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {12226#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:05,334 INFO L273 TraceCheckUtils]: 6: Hoare triple {12226#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12226#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:05,334 INFO L273 TraceCheckUtils]: 7: Hoare triple {12226#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12226#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:05,352 INFO L273 TraceCheckUtils]: 8: Hoare triple {12226#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {12182#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:05,360 INFO L273 TraceCheckUtils]: 9: Hoare triple {12182#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12182#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:05,361 INFO L273 TraceCheckUtils]: 10: Hoare triple {12182#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12182#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:05,362 INFO L273 TraceCheckUtils]: 11: Hoare triple {12182#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {12183#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:05,362 INFO L273 TraceCheckUtils]: 12: Hoare triple {12183#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12183#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:05,362 INFO L273 TraceCheckUtils]: 13: Hoare triple {12183#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12183#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:05,363 INFO L273 TraceCheckUtils]: 14: Hoare triple {12183#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {12184#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:05,363 INFO L273 TraceCheckUtils]: 15: Hoare triple {12184#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12184#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:05,363 INFO L273 TraceCheckUtils]: 16: Hoare triple {12184#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12184#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:05,364 INFO L273 TraceCheckUtils]: 17: Hoare triple {12184#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {12185#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:05,364 INFO L273 TraceCheckUtils]: 18: Hoare triple {12185#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12185#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:05,364 INFO L273 TraceCheckUtils]: 19: Hoare triple {12185#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12185#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:05,365 INFO L273 TraceCheckUtils]: 20: Hoare triple {12185#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {12186#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:05,365 INFO L273 TraceCheckUtils]: 21: Hoare triple {12186#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12186#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:05,366 INFO L273 TraceCheckUtils]: 22: Hoare triple {12186#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12186#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:05,366 INFO L273 TraceCheckUtils]: 23: Hoare triple {12186#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {12187#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:05,367 INFO L273 TraceCheckUtils]: 24: Hoare triple {12187#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12187#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:05,367 INFO L273 TraceCheckUtils]: 25: Hoare triple {12187#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12187#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:05,368 INFO L273 TraceCheckUtils]: 26: Hoare triple {12187#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {12188#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:05,369 INFO L273 TraceCheckUtils]: 27: Hoare triple {12188#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12188#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:05,369 INFO L273 TraceCheckUtils]: 28: Hoare triple {12188#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12188#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:05,370 INFO L273 TraceCheckUtils]: 29: Hoare triple {12188#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {12189#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:05,370 INFO L273 TraceCheckUtils]: 30: Hoare triple {12189#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12189#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:05,371 INFO L273 TraceCheckUtils]: 31: Hoare triple {12189#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12189#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:05,372 INFO L273 TraceCheckUtils]: 32: Hoare triple {12189#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {12190#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:05,372 INFO L273 TraceCheckUtils]: 33: Hoare triple {12190#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12190#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:05,373 INFO L273 TraceCheckUtils]: 34: Hoare triple {12190#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12190#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:05,376 INFO L273 TraceCheckUtils]: 35: Hoare triple {12190#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {12191#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:05,376 INFO L273 TraceCheckUtils]: 36: Hoare triple {12191#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12191#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:05,377 INFO L273 TraceCheckUtils]: 37: Hoare triple {12191#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12191#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:05,377 INFO L273 TraceCheckUtils]: 38: Hoare triple {12191#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {12192#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:05,377 INFO L273 TraceCheckUtils]: 39: Hoare triple {12192#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12192#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:05,378 INFO L273 TraceCheckUtils]: 40: Hoare triple {12192#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12192#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:05,378 INFO L273 TraceCheckUtils]: 41: Hoare triple {12192#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {12193#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:05,378 INFO L273 TraceCheckUtils]: 42: Hoare triple {12193#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12193#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:05,379 INFO L273 TraceCheckUtils]: 43: Hoare triple {12193#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12193#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:05,379 INFO L273 TraceCheckUtils]: 44: Hoare triple {12193#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {12194#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:05,379 INFO L273 TraceCheckUtils]: 45: Hoare triple {12194#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12194#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:05,380 INFO L273 TraceCheckUtils]: 46: Hoare triple {12194#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12194#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:05,380 INFO L273 TraceCheckUtils]: 47: Hoare triple {12194#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {12195#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:05,381 INFO L273 TraceCheckUtils]: 48: Hoare triple {12195#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12195#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:05,381 INFO L273 TraceCheckUtils]: 49: Hoare triple {12195#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12195#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:05,382 INFO L273 TraceCheckUtils]: 50: Hoare triple {12195#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {12196#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:05,382 INFO L273 TraceCheckUtils]: 51: Hoare triple {12196#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12196#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:05,383 INFO L273 TraceCheckUtils]: 52: Hoare triple {12196#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12196#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:05,384 INFO L273 TraceCheckUtils]: 53: Hoare triple {12196#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {12197#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:05,384 INFO L273 TraceCheckUtils]: 54: Hoare triple {12197#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12197#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:05,385 INFO L273 TraceCheckUtils]: 55: Hoare triple {12197#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12197#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:05,385 INFO L273 TraceCheckUtils]: 56: Hoare triple {12197#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {12198#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:05,386 INFO L273 TraceCheckUtils]: 57: Hoare triple {12198#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12198#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:05,386 INFO L273 TraceCheckUtils]: 58: Hoare triple {12198#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12198#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:05,387 INFO L273 TraceCheckUtils]: 59: Hoare triple {12198#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {12199#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:05,388 INFO L273 TraceCheckUtils]: 60: Hoare triple {12199#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12199#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:05,388 INFO L273 TraceCheckUtils]: 61: Hoare triple {12199#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12199#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:05,389 INFO L273 TraceCheckUtils]: 62: Hoare triple {12199#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {12200#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:05,389 INFO L273 TraceCheckUtils]: 63: Hoare triple {12200#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12200#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:05,390 INFO L273 TraceCheckUtils]: 64: Hoare triple {12200#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12200#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:05,391 INFO L273 TraceCheckUtils]: 65: Hoare triple {12200#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {12201#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:05,391 INFO L273 TraceCheckUtils]: 66: Hoare triple {12201#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12201#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:05,392 INFO L273 TraceCheckUtils]: 67: Hoare triple {12201#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12201#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:05,392 INFO L273 TraceCheckUtils]: 68: Hoare triple {12201#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {12202#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:05,393 INFO L273 TraceCheckUtils]: 69: Hoare triple {12202#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12202#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:05,393 INFO L273 TraceCheckUtils]: 70: Hoare triple {12202#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12202#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:05,394 INFO L273 TraceCheckUtils]: 71: Hoare triple {12202#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {12203#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:05,395 INFO L273 TraceCheckUtils]: 72: Hoare triple {12203#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12203#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:05,395 INFO L273 TraceCheckUtils]: 73: Hoare triple {12203#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12203#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:05,396 INFO L273 TraceCheckUtils]: 74: Hoare triple {12203#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {12204#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:05,396 INFO L273 TraceCheckUtils]: 75: Hoare triple {12204#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12204#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:05,397 INFO L273 TraceCheckUtils]: 76: Hoare triple {12204#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12204#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:05,398 INFO L273 TraceCheckUtils]: 77: Hoare triple {12204#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {12205#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:05,398 INFO L273 TraceCheckUtils]: 78: Hoare triple {12205#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12205#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:05,399 INFO L273 TraceCheckUtils]: 79: Hoare triple {12205#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12205#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:05,399 INFO L273 TraceCheckUtils]: 80: Hoare triple {12205#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {12206#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:05,400 INFO L273 TraceCheckUtils]: 81: Hoare triple {12206#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12206#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:05,400 INFO L273 TraceCheckUtils]: 82: Hoare triple {12206#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12206#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:05,401 INFO L273 TraceCheckUtils]: 83: Hoare triple {12206#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {12207#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:05,402 INFO L273 TraceCheckUtils]: 84: Hoare triple {12207#(<= main_~i~0 26)} assume !(~i~0 < 100000); {12180#false} is VALID [2018-11-23 11:56:05,402 INFO L273 TraceCheckUtils]: 85: Hoare triple {12180#false} havoc ~x~0;~x~0 := 0; {12180#false} is VALID [2018-11-23 11:56:05,402 INFO L273 TraceCheckUtils]: 86: Hoare triple {12180#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12180#false} is VALID [2018-11-23 11:56:05,402 INFO L256 TraceCheckUtils]: 87: Hoare triple {12180#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {12180#false} is VALID [2018-11-23 11:56:05,403 INFO L273 TraceCheckUtils]: 88: Hoare triple {12180#false} ~cond := #in~cond; {12180#false} is VALID [2018-11-23 11:56:05,403 INFO L273 TraceCheckUtils]: 89: Hoare triple {12180#false} assume 0 == ~cond; {12180#false} is VALID [2018-11-23 11:56:05,403 INFO L273 TraceCheckUtils]: 90: Hoare triple {12180#false} assume !false; {12180#false} is VALID [2018-11-23 11:56:05,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:05,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:05,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-23 11:56:05,428 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 91 [2018-11-23 11:56:05,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:05,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 11:56:05,520 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:05,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 11:56:05,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 11:56:05,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:56:05,522 INFO L87 Difference]: Start difference. First operand 96 states and 123 transitions. Second operand 30 states. [2018-11-23 11:56:06,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:06,191 INFO L93 Difference]: Finished difference Result 112 states and 142 transitions. [2018-11-23 11:56:06,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 11:56:06,191 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 91 [2018-11-23 11:56:06,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:06,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:56:06,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 142 transitions. [2018-11-23 11:56:06,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:56:06,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 142 transitions. [2018-11-23 11:56:06,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 142 transitions. [2018-11-23 11:56:06,594 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:06,596 INFO L225 Difference]: With dead ends: 112 [2018-11-23 11:56:06,596 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 11:56:06,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:56:06,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 11:56:06,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-11-23 11:56:06,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:06,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 99 states. [2018-11-23 11:56:06,669 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 99 states. [2018-11-23 11:56:06,669 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 99 states. [2018-11-23 11:56:06,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:06,670 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2018-11-23 11:56:06,671 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 130 transitions. [2018-11-23 11:56:06,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:06,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:06,671 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 101 states. [2018-11-23 11:56:06,671 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 101 states. [2018-11-23 11:56:06,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:06,673 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2018-11-23 11:56:06,673 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 130 transitions. [2018-11-23 11:56:06,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:06,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:06,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:06,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:06,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 11:56:06,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 127 transitions. [2018-11-23 11:56:06,675 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 127 transitions. Word has length 91 [2018-11-23 11:56:06,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:06,675 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 127 transitions. [2018-11-23 11:56:06,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 11:56:06,676 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 127 transitions. [2018-11-23 11:56:06,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-23 11:56:06,676 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:06,676 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:06,677 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:06,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:06,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1310896163, now seen corresponding path program 27 times [2018-11-23 11:56:06,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:06,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:06,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:06,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:06,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:07,305 INFO L256 TraceCheckUtils]: 0: Hoare triple {12967#true} call ULTIMATE.init(); {12967#true} is VALID [2018-11-23 11:56:07,305 INFO L273 TraceCheckUtils]: 1: Hoare triple {12967#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12967#true} is VALID [2018-11-23 11:56:07,305 INFO L273 TraceCheckUtils]: 2: Hoare triple {12967#true} assume true; {12967#true} is VALID [2018-11-23 11:56:07,305 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12967#true} {12967#true} #55#return; {12967#true} is VALID [2018-11-23 11:56:07,305 INFO L256 TraceCheckUtils]: 4: Hoare triple {12967#true} call #t~ret4 := main(); {12967#true} is VALID [2018-11-23 11:56:07,306 INFO L273 TraceCheckUtils]: 5: Hoare triple {12967#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {12969#(= main_~i~0 0)} is VALID [2018-11-23 11:56:07,306 INFO L273 TraceCheckUtils]: 6: Hoare triple {12969#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12969#(= main_~i~0 0)} is VALID [2018-11-23 11:56:07,306 INFO L273 TraceCheckUtils]: 7: Hoare triple {12969#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12969#(= main_~i~0 0)} is VALID [2018-11-23 11:56:07,307 INFO L273 TraceCheckUtils]: 8: Hoare triple {12969#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {12970#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:07,308 INFO L273 TraceCheckUtils]: 9: Hoare triple {12970#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12970#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:07,308 INFO L273 TraceCheckUtils]: 10: Hoare triple {12970#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12970#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:07,309 INFO L273 TraceCheckUtils]: 11: Hoare triple {12970#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {12971#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:07,309 INFO L273 TraceCheckUtils]: 12: Hoare triple {12971#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12971#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:07,310 INFO L273 TraceCheckUtils]: 13: Hoare triple {12971#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12971#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:07,311 INFO L273 TraceCheckUtils]: 14: Hoare triple {12971#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {12972#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:07,311 INFO L273 TraceCheckUtils]: 15: Hoare triple {12972#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12972#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:07,312 INFO L273 TraceCheckUtils]: 16: Hoare triple {12972#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12972#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:07,312 INFO L273 TraceCheckUtils]: 17: Hoare triple {12972#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {12973#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:07,313 INFO L273 TraceCheckUtils]: 18: Hoare triple {12973#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12973#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:07,313 INFO L273 TraceCheckUtils]: 19: Hoare triple {12973#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12973#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:07,314 INFO L273 TraceCheckUtils]: 20: Hoare triple {12973#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {12974#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:07,315 INFO L273 TraceCheckUtils]: 21: Hoare triple {12974#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12974#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:07,315 INFO L273 TraceCheckUtils]: 22: Hoare triple {12974#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12974#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:07,316 INFO L273 TraceCheckUtils]: 23: Hoare triple {12974#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {12975#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:07,317 INFO L273 TraceCheckUtils]: 24: Hoare triple {12975#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12975#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:07,317 INFO L273 TraceCheckUtils]: 25: Hoare triple {12975#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12975#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:07,318 INFO L273 TraceCheckUtils]: 26: Hoare triple {12975#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {12976#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:07,318 INFO L273 TraceCheckUtils]: 27: Hoare triple {12976#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12976#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:07,319 INFO L273 TraceCheckUtils]: 28: Hoare triple {12976#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12976#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:07,319 INFO L273 TraceCheckUtils]: 29: Hoare triple {12976#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {12977#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:07,320 INFO L273 TraceCheckUtils]: 30: Hoare triple {12977#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12977#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:07,321 INFO L273 TraceCheckUtils]: 31: Hoare triple {12977#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12977#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:07,321 INFO L273 TraceCheckUtils]: 32: Hoare triple {12977#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {12978#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:07,322 INFO L273 TraceCheckUtils]: 33: Hoare triple {12978#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12978#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:07,322 INFO L273 TraceCheckUtils]: 34: Hoare triple {12978#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12978#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:07,323 INFO L273 TraceCheckUtils]: 35: Hoare triple {12978#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {12979#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:07,324 INFO L273 TraceCheckUtils]: 36: Hoare triple {12979#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12979#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:07,324 INFO L273 TraceCheckUtils]: 37: Hoare triple {12979#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12979#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:07,325 INFO L273 TraceCheckUtils]: 38: Hoare triple {12979#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {12980#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:07,325 INFO L273 TraceCheckUtils]: 39: Hoare triple {12980#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12980#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:07,326 INFO L273 TraceCheckUtils]: 40: Hoare triple {12980#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12980#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:07,326 INFO L273 TraceCheckUtils]: 41: Hoare triple {12980#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {12981#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:07,327 INFO L273 TraceCheckUtils]: 42: Hoare triple {12981#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12981#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:07,328 INFO L273 TraceCheckUtils]: 43: Hoare triple {12981#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12981#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:07,328 INFO L273 TraceCheckUtils]: 44: Hoare triple {12981#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {12982#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:07,329 INFO L273 TraceCheckUtils]: 45: Hoare triple {12982#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12982#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:07,329 INFO L273 TraceCheckUtils]: 46: Hoare triple {12982#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12982#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:07,330 INFO L273 TraceCheckUtils]: 47: Hoare triple {12982#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {12983#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:07,331 INFO L273 TraceCheckUtils]: 48: Hoare triple {12983#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12983#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:07,331 INFO L273 TraceCheckUtils]: 49: Hoare triple {12983#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12983#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:07,332 INFO L273 TraceCheckUtils]: 50: Hoare triple {12983#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {12984#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:07,332 INFO L273 TraceCheckUtils]: 51: Hoare triple {12984#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12984#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:07,333 INFO L273 TraceCheckUtils]: 52: Hoare triple {12984#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12984#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:07,333 INFO L273 TraceCheckUtils]: 53: Hoare triple {12984#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {12985#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:07,334 INFO L273 TraceCheckUtils]: 54: Hoare triple {12985#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12985#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:07,335 INFO L273 TraceCheckUtils]: 55: Hoare triple {12985#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12985#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:07,335 INFO L273 TraceCheckUtils]: 56: Hoare triple {12985#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {12986#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:07,336 INFO L273 TraceCheckUtils]: 57: Hoare triple {12986#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12986#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:07,336 INFO L273 TraceCheckUtils]: 58: Hoare triple {12986#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12986#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:07,337 INFO L273 TraceCheckUtils]: 59: Hoare triple {12986#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {12987#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:07,338 INFO L273 TraceCheckUtils]: 60: Hoare triple {12987#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12987#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:07,338 INFO L273 TraceCheckUtils]: 61: Hoare triple {12987#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12987#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:07,339 INFO L273 TraceCheckUtils]: 62: Hoare triple {12987#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {12988#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:07,339 INFO L273 TraceCheckUtils]: 63: Hoare triple {12988#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12988#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:07,340 INFO L273 TraceCheckUtils]: 64: Hoare triple {12988#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12988#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:07,341 INFO L273 TraceCheckUtils]: 65: Hoare triple {12988#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {12989#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:07,341 INFO L273 TraceCheckUtils]: 66: Hoare triple {12989#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12989#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:07,342 INFO L273 TraceCheckUtils]: 67: Hoare triple {12989#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12989#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:07,342 INFO L273 TraceCheckUtils]: 68: Hoare triple {12989#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {12990#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:07,343 INFO L273 TraceCheckUtils]: 69: Hoare triple {12990#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12990#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:07,343 INFO L273 TraceCheckUtils]: 70: Hoare triple {12990#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12990#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:07,344 INFO L273 TraceCheckUtils]: 71: Hoare triple {12990#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {12991#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:07,345 INFO L273 TraceCheckUtils]: 72: Hoare triple {12991#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12991#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:07,345 INFO L273 TraceCheckUtils]: 73: Hoare triple {12991#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12991#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:07,346 INFO L273 TraceCheckUtils]: 74: Hoare triple {12991#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {12992#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:07,346 INFO L273 TraceCheckUtils]: 75: Hoare triple {12992#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12992#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:07,347 INFO L273 TraceCheckUtils]: 76: Hoare triple {12992#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12992#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:07,347 INFO L273 TraceCheckUtils]: 77: Hoare triple {12992#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {12993#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:07,348 INFO L273 TraceCheckUtils]: 78: Hoare triple {12993#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12993#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:07,349 INFO L273 TraceCheckUtils]: 79: Hoare triple {12993#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12993#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:07,349 INFO L273 TraceCheckUtils]: 80: Hoare triple {12993#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {12994#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:07,350 INFO L273 TraceCheckUtils]: 81: Hoare triple {12994#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12994#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:07,350 INFO L273 TraceCheckUtils]: 82: Hoare triple {12994#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12994#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:07,351 INFO L273 TraceCheckUtils]: 83: Hoare triple {12994#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {12995#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:07,352 INFO L273 TraceCheckUtils]: 84: Hoare triple {12995#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12995#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:07,352 INFO L273 TraceCheckUtils]: 85: Hoare triple {12995#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12995#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:07,353 INFO L273 TraceCheckUtils]: 86: Hoare triple {12995#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {12996#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:07,353 INFO L273 TraceCheckUtils]: 87: Hoare triple {12996#(<= main_~i~0 27)} assume !(~i~0 < 100000); {12968#false} is VALID [2018-11-23 11:56:07,354 INFO L273 TraceCheckUtils]: 88: Hoare triple {12968#false} havoc ~x~0;~x~0 := 0; {12968#false} is VALID [2018-11-23 11:56:07,354 INFO L273 TraceCheckUtils]: 89: Hoare triple {12968#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12968#false} is VALID [2018-11-23 11:56:07,354 INFO L256 TraceCheckUtils]: 90: Hoare triple {12968#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {12968#false} is VALID [2018-11-23 11:56:07,354 INFO L273 TraceCheckUtils]: 91: Hoare triple {12968#false} ~cond := #in~cond; {12968#false} is VALID [2018-11-23 11:56:07,354 INFO L273 TraceCheckUtils]: 92: Hoare triple {12968#false} assume 0 == ~cond; {12968#false} is VALID [2018-11-23 11:56:07,355 INFO L273 TraceCheckUtils]: 93: Hoare triple {12968#false} assume !false; {12968#false} is VALID [2018-11-23 11:56:07,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:07,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:07,362 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:07,372 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:56:07,436 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-11-23 11:56:07,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:07,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:07,680 INFO L256 TraceCheckUtils]: 0: Hoare triple {12967#true} call ULTIMATE.init(); {12967#true} is VALID [2018-11-23 11:56:07,681 INFO L273 TraceCheckUtils]: 1: Hoare triple {12967#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12967#true} is VALID [2018-11-23 11:56:07,681 INFO L273 TraceCheckUtils]: 2: Hoare triple {12967#true} assume true; {12967#true} is VALID [2018-11-23 11:56:07,681 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12967#true} {12967#true} #55#return; {12967#true} is VALID [2018-11-23 11:56:07,681 INFO L256 TraceCheckUtils]: 4: Hoare triple {12967#true} call #t~ret4 := main(); {12967#true} is VALID [2018-11-23 11:56:07,682 INFO L273 TraceCheckUtils]: 5: Hoare triple {12967#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {13015#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:07,682 INFO L273 TraceCheckUtils]: 6: Hoare triple {13015#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13015#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:07,683 INFO L273 TraceCheckUtils]: 7: Hoare triple {13015#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13015#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:07,683 INFO L273 TraceCheckUtils]: 8: Hoare triple {13015#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {12970#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:07,684 INFO L273 TraceCheckUtils]: 9: Hoare triple {12970#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12970#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:07,684 INFO L273 TraceCheckUtils]: 10: Hoare triple {12970#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12970#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:07,684 INFO L273 TraceCheckUtils]: 11: Hoare triple {12970#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {12971#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:07,685 INFO L273 TraceCheckUtils]: 12: Hoare triple {12971#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12971#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:07,685 INFO L273 TraceCheckUtils]: 13: Hoare triple {12971#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12971#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:07,686 INFO L273 TraceCheckUtils]: 14: Hoare triple {12971#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {12972#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:07,687 INFO L273 TraceCheckUtils]: 15: Hoare triple {12972#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12972#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:07,687 INFO L273 TraceCheckUtils]: 16: Hoare triple {12972#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12972#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:07,688 INFO L273 TraceCheckUtils]: 17: Hoare triple {12972#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {12973#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:07,688 INFO L273 TraceCheckUtils]: 18: Hoare triple {12973#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12973#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:07,689 INFO L273 TraceCheckUtils]: 19: Hoare triple {12973#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12973#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:07,690 INFO L273 TraceCheckUtils]: 20: Hoare triple {12973#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {12974#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:07,690 INFO L273 TraceCheckUtils]: 21: Hoare triple {12974#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12974#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:07,691 INFO L273 TraceCheckUtils]: 22: Hoare triple {12974#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12974#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:07,691 INFO L273 TraceCheckUtils]: 23: Hoare triple {12974#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {12975#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:07,692 INFO L273 TraceCheckUtils]: 24: Hoare triple {12975#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12975#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:07,692 INFO L273 TraceCheckUtils]: 25: Hoare triple {12975#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12975#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:07,693 INFO L273 TraceCheckUtils]: 26: Hoare triple {12975#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {12976#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:07,694 INFO L273 TraceCheckUtils]: 27: Hoare triple {12976#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12976#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:07,694 INFO L273 TraceCheckUtils]: 28: Hoare triple {12976#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12976#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:07,695 INFO L273 TraceCheckUtils]: 29: Hoare triple {12976#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {12977#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:07,695 INFO L273 TraceCheckUtils]: 30: Hoare triple {12977#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12977#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:07,696 INFO L273 TraceCheckUtils]: 31: Hoare triple {12977#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12977#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:07,697 INFO L273 TraceCheckUtils]: 32: Hoare triple {12977#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {12978#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:07,697 INFO L273 TraceCheckUtils]: 33: Hoare triple {12978#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12978#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:07,698 INFO L273 TraceCheckUtils]: 34: Hoare triple {12978#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12978#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:07,698 INFO L273 TraceCheckUtils]: 35: Hoare triple {12978#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {12979#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:07,699 INFO L273 TraceCheckUtils]: 36: Hoare triple {12979#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12979#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:07,699 INFO L273 TraceCheckUtils]: 37: Hoare triple {12979#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12979#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:07,700 INFO L273 TraceCheckUtils]: 38: Hoare triple {12979#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {12980#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:07,701 INFO L273 TraceCheckUtils]: 39: Hoare triple {12980#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12980#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:07,701 INFO L273 TraceCheckUtils]: 40: Hoare triple {12980#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12980#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:07,702 INFO L273 TraceCheckUtils]: 41: Hoare triple {12980#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {12981#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:07,702 INFO L273 TraceCheckUtils]: 42: Hoare triple {12981#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12981#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:07,703 INFO L273 TraceCheckUtils]: 43: Hoare triple {12981#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12981#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:07,704 INFO L273 TraceCheckUtils]: 44: Hoare triple {12981#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {12982#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:07,704 INFO L273 TraceCheckUtils]: 45: Hoare triple {12982#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12982#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:07,705 INFO L273 TraceCheckUtils]: 46: Hoare triple {12982#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12982#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:07,705 INFO L273 TraceCheckUtils]: 47: Hoare triple {12982#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {12983#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:07,706 INFO L273 TraceCheckUtils]: 48: Hoare triple {12983#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12983#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:07,706 INFO L273 TraceCheckUtils]: 49: Hoare triple {12983#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12983#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:07,707 INFO L273 TraceCheckUtils]: 50: Hoare triple {12983#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {12984#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:07,708 INFO L273 TraceCheckUtils]: 51: Hoare triple {12984#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12984#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:07,708 INFO L273 TraceCheckUtils]: 52: Hoare triple {12984#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12984#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:07,709 INFO L273 TraceCheckUtils]: 53: Hoare triple {12984#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {12985#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:07,709 INFO L273 TraceCheckUtils]: 54: Hoare triple {12985#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12985#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:07,710 INFO L273 TraceCheckUtils]: 55: Hoare triple {12985#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12985#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:07,711 INFO L273 TraceCheckUtils]: 56: Hoare triple {12985#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {12986#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:07,711 INFO L273 TraceCheckUtils]: 57: Hoare triple {12986#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12986#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:07,712 INFO L273 TraceCheckUtils]: 58: Hoare triple {12986#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12986#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:07,712 INFO L273 TraceCheckUtils]: 59: Hoare triple {12986#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {12987#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:07,713 INFO L273 TraceCheckUtils]: 60: Hoare triple {12987#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12987#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:07,713 INFO L273 TraceCheckUtils]: 61: Hoare triple {12987#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12987#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:07,714 INFO L273 TraceCheckUtils]: 62: Hoare triple {12987#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {12988#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:07,715 INFO L273 TraceCheckUtils]: 63: Hoare triple {12988#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12988#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:07,715 INFO L273 TraceCheckUtils]: 64: Hoare triple {12988#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12988#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:07,716 INFO L273 TraceCheckUtils]: 65: Hoare triple {12988#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {12989#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:07,716 INFO L273 TraceCheckUtils]: 66: Hoare triple {12989#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12989#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:07,717 INFO L273 TraceCheckUtils]: 67: Hoare triple {12989#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12989#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:07,718 INFO L273 TraceCheckUtils]: 68: Hoare triple {12989#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {12990#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:07,718 INFO L273 TraceCheckUtils]: 69: Hoare triple {12990#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12990#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:07,719 INFO L273 TraceCheckUtils]: 70: Hoare triple {12990#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12990#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:07,719 INFO L273 TraceCheckUtils]: 71: Hoare triple {12990#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {12991#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:07,720 INFO L273 TraceCheckUtils]: 72: Hoare triple {12991#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12991#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:07,720 INFO L273 TraceCheckUtils]: 73: Hoare triple {12991#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12991#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:07,721 INFO L273 TraceCheckUtils]: 74: Hoare triple {12991#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {12992#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:07,722 INFO L273 TraceCheckUtils]: 75: Hoare triple {12992#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12992#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:07,722 INFO L273 TraceCheckUtils]: 76: Hoare triple {12992#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12992#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:07,723 INFO L273 TraceCheckUtils]: 77: Hoare triple {12992#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {12993#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:07,723 INFO L273 TraceCheckUtils]: 78: Hoare triple {12993#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12993#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:07,724 INFO L273 TraceCheckUtils]: 79: Hoare triple {12993#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12993#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:07,725 INFO L273 TraceCheckUtils]: 80: Hoare triple {12993#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {12994#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:07,725 INFO L273 TraceCheckUtils]: 81: Hoare triple {12994#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12994#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:07,726 INFO L273 TraceCheckUtils]: 82: Hoare triple {12994#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12994#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:07,726 INFO L273 TraceCheckUtils]: 83: Hoare triple {12994#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {12995#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:07,727 INFO L273 TraceCheckUtils]: 84: Hoare triple {12995#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12995#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:07,727 INFO L273 TraceCheckUtils]: 85: Hoare triple {12995#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {12995#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:07,728 INFO L273 TraceCheckUtils]: 86: Hoare triple {12995#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {12996#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:07,729 INFO L273 TraceCheckUtils]: 87: Hoare triple {12996#(<= main_~i~0 27)} assume !(~i~0 < 100000); {12968#false} is VALID [2018-11-23 11:56:07,729 INFO L273 TraceCheckUtils]: 88: Hoare triple {12968#false} havoc ~x~0;~x~0 := 0; {12968#false} is VALID [2018-11-23 11:56:07,729 INFO L273 TraceCheckUtils]: 89: Hoare triple {12968#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12968#false} is VALID [2018-11-23 11:56:07,729 INFO L256 TraceCheckUtils]: 90: Hoare triple {12968#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {12968#false} is VALID [2018-11-23 11:56:07,730 INFO L273 TraceCheckUtils]: 91: Hoare triple {12968#false} ~cond := #in~cond; {12968#false} is VALID [2018-11-23 11:56:07,730 INFO L273 TraceCheckUtils]: 92: Hoare triple {12968#false} assume 0 == ~cond; {12968#false} is VALID [2018-11-23 11:56:07,730 INFO L273 TraceCheckUtils]: 93: Hoare triple {12968#false} assume !false; {12968#false} is VALID [2018-11-23 11:56:07,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:07,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:07,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-23 11:56:07,758 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 94 [2018-11-23 11:56:07,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:07,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 11:56:07,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:07,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 11:56:07,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 11:56:07,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 11:56:07,853 INFO L87 Difference]: Start difference. First operand 99 states and 127 transitions. Second operand 31 states. [2018-11-23 11:56:09,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:09,160 INFO L93 Difference]: Finished difference Result 115 states and 146 transitions. [2018-11-23 11:56:09,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 11:56:09,160 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 94 [2018-11-23 11:56:09,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:09,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:56:09,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 146 transitions. [2018-11-23 11:56:09,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:56:09,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 146 transitions. [2018-11-23 11:56:09,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 146 transitions. [2018-11-23 11:56:09,317 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:09,319 INFO L225 Difference]: With dead ends: 115 [2018-11-23 11:56:09,319 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 11:56:09,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 11:56:09,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 11:56:09,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2018-11-23 11:56:09,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:09,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 102 states. [2018-11-23 11:56:09,345 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 102 states. [2018-11-23 11:56:09,345 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 102 states. [2018-11-23 11:56:09,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:09,347 INFO L93 Difference]: Finished difference Result 104 states and 134 transitions. [2018-11-23 11:56:09,348 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 134 transitions. [2018-11-23 11:56:09,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:09,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:09,348 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 104 states. [2018-11-23 11:56:09,348 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 104 states. [2018-11-23 11:56:09,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:09,350 INFO L93 Difference]: Finished difference Result 104 states and 134 transitions. [2018-11-23 11:56:09,350 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 134 transitions. [2018-11-23 11:56:09,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:09,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:09,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:09,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:09,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-23 11:56:09,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 131 transitions. [2018-11-23 11:56:09,353 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 131 transitions. Word has length 94 [2018-11-23 11:56:09,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:09,354 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 131 transitions. [2018-11-23 11:56:09,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 11:56:09,354 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 131 transitions. [2018-11-23 11:56:09,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-23 11:56:09,355 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:09,355 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:09,355 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:09,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:09,355 INFO L82 PathProgramCache]: Analyzing trace with hash 2110302521, now seen corresponding path program 28 times [2018-11-23 11:56:09,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:09,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:09,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:09,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:09,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:09,930 INFO L256 TraceCheckUtils]: 0: Hoare triple {13779#true} call ULTIMATE.init(); {13779#true} is VALID [2018-11-23 11:56:09,931 INFO L273 TraceCheckUtils]: 1: Hoare triple {13779#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13779#true} is VALID [2018-11-23 11:56:09,931 INFO L273 TraceCheckUtils]: 2: Hoare triple {13779#true} assume true; {13779#true} is VALID [2018-11-23 11:56:09,931 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13779#true} {13779#true} #55#return; {13779#true} is VALID [2018-11-23 11:56:09,931 INFO L256 TraceCheckUtils]: 4: Hoare triple {13779#true} call #t~ret4 := main(); {13779#true} is VALID [2018-11-23 11:56:09,932 INFO L273 TraceCheckUtils]: 5: Hoare triple {13779#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {13781#(= main_~i~0 0)} is VALID [2018-11-23 11:56:09,935 INFO L273 TraceCheckUtils]: 6: Hoare triple {13781#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13781#(= main_~i~0 0)} is VALID [2018-11-23 11:56:09,935 INFO L273 TraceCheckUtils]: 7: Hoare triple {13781#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13781#(= main_~i~0 0)} is VALID [2018-11-23 11:56:09,936 INFO L273 TraceCheckUtils]: 8: Hoare triple {13781#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {13782#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:09,936 INFO L273 TraceCheckUtils]: 9: Hoare triple {13782#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13782#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:09,937 INFO L273 TraceCheckUtils]: 10: Hoare triple {13782#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13782#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:09,937 INFO L273 TraceCheckUtils]: 11: Hoare triple {13782#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {13783#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:09,937 INFO L273 TraceCheckUtils]: 12: Hoare triple {13783#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13783#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:09,938 INFO L273 TraceCheckUtils]: 13: Hoare triple {13783#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13783#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:09,938 INFO L273 TraceCheckUtils]: 14: Hoare triple {13783#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {13784#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:09,938 INFO L273 TraceCheckUtils]: 15: Hoare triple {13784#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13784#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:09,939 INFO L273 TraceCheckUtils]: 16: Hoare triple {13784#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13784#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:09,939 INFO L273 TraceCheckUtils]: 17: Hoare triple {13784#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {13785#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:09,940 INFO L273 TraceCheckUtils]: 18: Hoare triple {13785#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13785#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:09,940 INFO L273 TraceCheckUtils]: 19: Hoare triple {13785#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13785#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:09,941 INFO L273 TraceCheckUtils]: 20: Hoare triple {13785#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {13786#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:09,942 INFO L273 TraceCheckUtils]: 21: Hoare triple {13786#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13786#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:09,942 INFO L273 TraceCheckUtils]: 22: Hoare triple {13786#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13786#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:09,943 INFO L273 TraceCheckUtils]: 23: Hoare triple {13786#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {13787#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:09,943 INFO L273 TraceCheckUtils]: 24: Hoare triple {13787#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13787#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:09,944 INFO L273 TraceCheckUtils]: 25: Hoare triple {13787#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13787#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:09,945 INFO L273 TraceCheckUtils]: 26: Hoare triple {13787#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {13788#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:09,945 INFO L273 TraceCheckUtils]: 27: Hoare triple {13788#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13788#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:09,946 INFO L273 TraceCheckUtils]: 28: Hoare triple {13788#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13788#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:09,946 INFO L273 TraceCheckUtils]: 29: Hoare triple {13788#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {13789#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:09,947 INFO L273 TraceCheckUtils]: 30: Hoare triple {13789#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13789#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:09,947 INFO L273 TraceCheckUtils]: 31: Hoare triple {13789#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13789#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:09,948 INFO L273 TraceCheckUtils]: 32: Hoare triple {13789#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {13790#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:09,949 INFO L273 TraceCheckUtils]: 33: Hoare triple {13790#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13790#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:09,949 INFO L273 TraceCheckUtils]: 34: Hoare triple {13790#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13790#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:09,950 INFO L273 TraceCheckUtils]: 35: Hoare triple {13790#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {13791#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:09,950 INFO L273 TraceCheckUtils]: 36: Hoare triple {13791#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13791#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:09,951 INFO L273 TraceCheckUtils]: 37: Hoare triple {13791#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13791#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:09,952 INFO L273 TraceCheckUtils]: 38: Hoare triple {13791#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {13792#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:09,952 INFO L273 TraceCheckUtils]: 39: Hoare triple {13792#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13792#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:09,953 INFO L273 TraceCheckUtils]: 40: Hoare triple {13792#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13792#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:09,953 INFO L273 TraceCheckUtils]: 41: Hoare triple {13792#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {13793#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:09,954 INFO L273 TraceCheckUtils]: 42: Hoare triple {13793#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13793#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:09,954 INFO L273 TraceCheckUtils]: 43: Hoare triple {13793#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13793#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:09,955 INFO L273 TraceCheckUtils]: 44: Hoare triple {13793#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {13794#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:09,956 INFO L273 TraceCheckUtils]: 45: Hoare triple {13794#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13794#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:09,956 INFO L273 TraceCheckUtils]: 46: Hoare triple {13794#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13794#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:09,957 INFO L273 TraceCheckUtils]: 47: Hoare triple {13794#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {13795#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:09,957 INFO L273 TraceCheckUtils]: 48: Hoare triple {13795#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13795#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:09,958 INFO L273 TraceCheckUtils]: 49: Hoare triple {13795#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13795#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:09,959 INFO L273 TraceCheckUtils]: 50: Hoare triple {13795#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {13796#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:09,959 INFO L273 TraceCheckUtils]: 51: Hoare triple {13796#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13796#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:09,960 INFO L273 TraceCheckUtils]: 52: Hoare triple {13796#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13796#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:09,961 INFO L273 TraceCheckUtils]: 53: Hoare triple {13796#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {13797#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:09,961 INFO L273 TraceCheckUtils]: 54: Hoare triple {13797#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13797#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:09,962 INFO L273 TraceCheckUtils]: 55: Hoare triple {13797#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13797#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:09,963 INFO L273 TraceCheckUtils]: 56: Hoare triple {13797#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {13798#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:09,964 INFO L273 TraceCheckUtils]: 57: Hoare triple {13798#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13798#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:09,964 INFO L273 TraceCheckUtils]: 58: Hoare triple {13798#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13798#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:09,965 INFO L273 TraceCheckUtils]: 59: Hoare triple {13798#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {13799#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:09,966 INFO L273 TraceCheckUtils]: 60: Hoare triple {13799#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13799#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:09,966 INFO L273 TraceCheckUtils]: 61: Hoare triple {13799#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13799#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:09,967 INFO L273 TraceCheckUtils]: 62: Hoare triple {13799#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {13800#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:09,968 INFO L273 TraceCheckUtils]: 63: Hoare triple {13800#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13800#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:09,968 INFO L273 TraceCheckUtils]: 64: Hoare triple {13800#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13800#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:09,969 INFO L273 TraceCheckUtils]: 65: Hoare triple {13800#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {13801#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:09,970 INFO L273 TraceCheckUtils]: 66: Hoare triple {13801#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13801#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:09,970 INFO L273 TraceCheckUtils]: 67: Hoare triple {13801#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13801#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:09,971 INFO L273 TraceCheckUtils]: 68: Hoare triple {13801#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {13802#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:09,972 INFO L273 TraceCheckUtils]: 69: Hoare triple {13802#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13802#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:09,972 INFO L273 TraceCheckUtils]: 70: Hoare triple {13802#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13802#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:09,973 INFO L273 TraceCheckUtils]: 71: Hoare triple {13802#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {13803#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:09,974 INFO L273 TraceCheckUtils]: 72: Hoare triple {13803#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13803#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:09,974 INFO L273 TraceCheckUtils]: 73: Hoare triple {13803#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13803#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:09,975 INFO L273 TraceCheckUtils]: 74: Hoare triple {13803#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {13804#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:09,976 INFO L273 TraceCheckUtils]: 75: Hoare triple {13804#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13804#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:09,996 INFO L273 TraceCheckUtils]: 76: Hoare triple {13804#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13804#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:09,997 INFO L273 TraceCheckUtils]: 77: Hoare triple {13804#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {13805#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:09,997 INFO L273 TraceCheckUtils]: 78: Hoare triple {13805#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13805#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:09,997 INFO L273 TraceCheckUtils]: 79: Hoare triple {13805#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13805#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:09,998 INFO L273 TraceCheckUtils]: 80: Hoare triple {13805#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {13806#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:09,998 INFO L273 TraceCheckUtils]: 81: Hoare triple {13806#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13806#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:09,998 INFO L273 TraceCheckUtils]: 82: Hoare triple {13806#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13806#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:09,999 INFO L273 TraceCheckUtils]: 83: Hoare triple {13806#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {13807#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:09,999 INFO L273 TraceCheckUtils]: 84: Hoare triple {13807#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13807#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:09,999 INFO L273 TraceCheckUtils]: 85: Hoare triple {13807#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13807#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:10,000 INFO L273 TraceCheckUtils]: 86: Hoare triple {13807#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {13808#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:10,001 INFO L273 TraceCheckUtils]: 87: Hoare triple {13808#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13808#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:10,001 INFO L273 TraceCheckUtils]: 88: Hoare triple {13808#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13808#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:10,002 INFO L273 TraceCheckUtils]: 89: Hoare triple {13808#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {13809#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:10,003 INFO L273 TraceCheckUtils]: 90: Hoare triple {13809#(<= main_~i~0 28)} assume !(~i~0 < 100000); {13780#false} is VALID [2018-11-23 11:56:10,003 INFO L273 TraceCheckUtils]: 91: Hoare triple {13780#false} havoc ~x~0;~x~0 := 0; {13780#false} is VALID [2018-11-23 11:56:10,003 INFO L273 TraceCheckUtils]: 92: Hoare triple {13780#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {13780#false} is VALID [2018-11-23 11:56:10,003 INFO L256 TraceCheckUtils]: 93: Hoare triple {13780#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {13780#false} is VALID [2018-11-23 11:56:10,004 INFO L273 TraceCheckUtils]: 94: Hoare triple {13780#false} ~cond := #in~cond; {13780#false} is VALID [2018-11-23 11:56:10,004 INFO L273 TraceCheckUtils]: 95: Hoare triple {13780#false} assume 0 == ~cond; {13780#false} is VALID [2018-11-23 11:56:10,004 INFO L273 TraceCheckUtils]: 96: Hoare triple {13780#false} assume !false; {13780#false} is VALID [2018-11-23 11:56:10,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:10,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:10,012 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:10,022 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:56:10,063 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:56:10,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:10,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:10,325 INFO L256 TraceCheckUtils]: 0: Hoare triple {13779#true} call ULTIMATE.init(); {13779#true} is VALID [2018-11-23 11:56:10,325 INFO L273 TraceCheckUtils]: 1: Hoare triple {13779#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13779#true} is VALID [2018-11-23 11:56:10,325 INFO L273 TraceCheckUtils]: 2: Hoare triple {13779#true} assume true; {13779#true} is VALID [2018-11-23 11:56:10,326 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13779#true} {13779#true} #55#return; {13779#true} is VALID [2018-11-23 11:56:10,326 INFO L256 TraceCheckUtils]: 4: Hoare triple {13779#true} call #t~ret4 := main(); {13779#true} is VALID [2018-11-23 11:56:10,327 INFO L273 TraceCheckUtils]: 5: Hoare triple {13779#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {13828#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:10,327 INFO L273 TraceCheckUtils]: 6: Hoare triple {13828#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13828#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:10,328 INFO L273 TraceCheckUtils]: 7: Hoare triple {13828#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13828#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:10,328 INFO L273 TraceCheckUtils]: 8: Hoare triple {13828#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {13782#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:10,328 INFO L273 TraceCheckUtils]: 9: Hoare triple {13782#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13782#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:10,329 INFO L273 TraceCheckUtils]: 10: Hoare triple {13782#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13782#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:10,329 INFO L273 TraceCheckUtils]: 11: Hoare triple {13782#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {13783#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:10,329 INFO L273 TraceCheckUtils]: 12: Hoare triple {13783#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13783#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:10,330 INFO L273 TraceCheckUtils]: 13: Hoare triple {13783#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13783#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:10,330 INFO L273 TraceCheckUtils]: 14: Hoare triple {13783#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {13784#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:10,331 INFO L273 TraceCheckUtils]: 15: Hoare triple {13784#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13784#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:10,332 INFO L273 TraceCheckUtils]: 16: Hoare triple {13784#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13784#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:10,332 INFO L273 TraceCheckUtils]: 17: Hoare triple {13784#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {13785#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:10,333 INFO L273 TraceCheckUtils]: 18: Hoare triple {13785#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13785#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:10,333 INFO L273 TraceCheckUtils]: 19: Hoare triple {13785#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13785#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:10,334 INFO L273 TraceCheckUtils]: 20: Hoare triple {13785#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {13786#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:10,335 INFO L273 TraceCheckUtils]: 21: Hoare triple {13786#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13786#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:10,335 INFO L273 TraceCheckUtils]: 22: Hoare triple {13786#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13786#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:10,336 INFO L273 TraceCheckUtils]: 23: Hoare triple {13786#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {13787#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:10,336 INFO L273 TraceCheckUtils]: 24: Hoare triple {13787#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13787#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:10,337 INFO L273 TraceCheckUtils]: 25: Hoare triple {13787#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13787#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:10,337 INFO L273 TraceCheckUtils]: 26: Hoare triple {13787#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {13788#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:10,338 INFO L273 TraceCheckUtils]: 27: Hoare triple {13788#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13788#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:10,342 INFO L273 TraceCheckUtils]: 28: Hoare triple {13788#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13788#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:10,342 INFO L273 TraceCheckUtils]: 29: Hoare triple {13788#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {13789#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:10,343 INFO L273 TraceCheckUtils]: 30: Hoare triple {13789#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13789#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:10,343 INFO L273 TraceCheckUtils]: 31: Hoare triple {13789#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13789#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:10,343 INFO L273 TraceCheckUtils]: 32: Hoare triple {13789#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {13790#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:10,344 INFO L273 TraceCheckUtils]: 33: Hoare triple {13790#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13790#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:10,344 INFO L273 TraceCheckUtils]: 34: Hoare triple {13790#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13790#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:10,344 INFO L273 TraceCheckUtils]: 35: Hoare triple {13790#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {13791#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:10,345 INFO L273 TraceCheckUtils]: 36: Hoare triple {13791#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13791#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:10,345 INFO L273 TraceCheckUtils]: 37: Hoare triple {13791#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13791#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:10,346 INFO L273 TraceCheckUtils]: 38: Hoare triple {13791#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {13792#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:10,346 INFO L273 TraceCheckUtils]: 39: Hoare triple {13792#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13792#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:10,347 INFO L273 TraceCheckUtils]: 40: Hoare triple {13792#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13792#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:10,347 INFO L273 TraceCheckUtils]: 41: Hoare triple {13792#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {13793#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:10,348 INFO L273 TraceCheckUtils]: 42: Hoare triple {13793#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13793#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:10,348 INFO L273 TraceCheckUtils]: 43: Hoare triple {13793#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13793#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:10,349 INFO L273 TraceCheckUtils]: 44: Hoare triple {13793#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {13794#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:10,369 INFO L273 TraceCheckUtils]: 45: Hoare triple {13794#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13794#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:10,383 INFO L273 TraceCheckUtils]: 46: Hoare triple {13794#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13794#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:10,391 INFO L273 TraceCheckUtils]: 47: Hoare triple {13794#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {13795#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:10,404 INFO L273 TraceCheckUtils]: 48: Hoare triple {13795#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13795#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:10,405 INFO L273 TraceCheckUtils]: 49: Hoare triple {13795#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13795#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:10,405 INFO L273 TraceCheckUtils]: 50: Hoare triple {13795#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {13796#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:10,407 INFO L273 TraceCheckUtils]: 51: Hoare triple {13796#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13796#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:10,407 INFO L273 TraceCheckUtils]: 52: Hoare triple {13796#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13796#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:10,407 INFO L273 TraceCheckUtils]: 53: Hoare triple {13796#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {13797#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:10,408 INFO L273 TraceCheckUtils]: 54: Hoare triple {13797#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13797#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:10,408 INFO L273 TraceCheckUtils]: 55: Hoare triple {13797#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13797#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:10,408 INFO L273 TraceCheckUtils]: 56: Hoare triple {13797#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {13798#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:10,409 INFO L273 TraceCheckUtils]: 57: Hoare triple {13798#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13798#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:10,409 INFO L273 TraceCheckUtils]: 58: Hoare triple {13798#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13798#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:10,409 INFO L273 TraceCheckUtils]: 59: Hoare triple {13798#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {13799#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:10,410 INFO L273 TraceCheckUtils]: 60: Hoare triple {13799#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13799#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:10,410 INFO L273 TraceCheckUtils]: 61: Hoare triple {13799#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13799#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:10,410 INFO L273 TraceCheckUtils]: 62: Hoare triple {13799#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {13800#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:10,411 INFO L273 TraceCheckUtils]: 63: Hoare triple {13800#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13800#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:10,411 INFO L273 TraceCheckUtils]: 64: Hoare triple {13800#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13800#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:10,412 INFO L273 TraceCheckUtils]: 65: Hoare triple {13800#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {13801#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:10,413 INFO L273 TraceCheckUtils]: 66: Hoare triple {13801#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13801#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:10,413 INFO L273 TraceCheckUtils]: 67: Hoare triple {13801#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13801#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:10,414 INFO L273 TraceCheckUtils]: 68: Hoare triple {13801#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {13802#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:10,414 INFO L273 TraceCheckUtils]: 69: Hoare triple {13802#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13802#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:10,415 INFO L273 TraceCheckUtils]: 70: Hoare triple {13802#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13802#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:10,416 INFO L273 TraceCheckUtils]: 71: Hoare triple {13802#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {13803#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:10,416 INFO L273 TraceCheckUtils]: 72: Hoare triple {13803#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13803#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:10,417 INFO L273 TraceCheckUtils]: 73: Hoare triple {13803#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13803#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:10,417 INFO L273 TraceCheckUtils]: 74: Hoare triple {13803#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {13804#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:10,418 INFO L273 TraceCheckUtils]: 75: Hoare triple {13804#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13804#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:10,418 INFO L273 TraceCheckUtils]: 76: Hoare triple {13804#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13804#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:10,419 INFO L273 TraceCheckUtils]: 77: Hoare triple {13804#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {13805#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:10,420 INFO L273 TraceCheckUtils]: 78: Hoare triple {13805#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13805#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:10,420 INFO L273 TraceCheckUtils]: 79: Hoare triple {13805#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13805#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:10,421 INFO L273 TraceCheckUtils]: 80: Hoare triple {13805#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {13806#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:10,421 INFO L273 TraceCheckUtils]: 81: Hoare triple {13806#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13806#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:10,422 INFO L273 TraceCheckUtils]: 82: Hoare triple {13806#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13806#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:10,423 INFO L273 TraceCheckUtils]: 83: Hoare triple {13806#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {13807#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:10,423 INFO L273 TraceCheckUtils]: 84: Hoare triple {13807#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13807#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:10,424 INFO L273 TraceCheckUtils]: 85: Hoare triple {13807#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13807#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:10,424 INFO L273 TraceCheckUtils]: 86: Hoare triple {13807#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {13808#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:10,425 INFO L273 TraceCheckUtils]: 87: Hoare triple {13808#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13808#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:10,425 INFO L273 TraceCheckUtils]: 88: Hoare triple {13808#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {13808#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:10,431 INFO L273 TraceCheckUtils]: 89: Hoare triple {13808#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {13809#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:10,432 INFO L273 TraceCheckUtils]: 90: Hoare triple {13809#(<= main_~i~0 28)} assume !(~i~0 < 100000); {13780#false} is VALID [2018-11-23 11:56:10,432 INFO L273 TraceCheckUtils]: 91: Hoare triple {13780#false} havoc ~x~0;~x~0 := 0; {13780#false} is VALID [2018-11-23 11:56:10,432 INFO L273 TraceCheckUtils]: 92: Hoare triple {13780#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {13780#false} is VALID [2018-11-23 11:56:10,432 INFO L256 TraceCheckUtils]: 93: Hoare triple {13780#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {13780#false} is VALID [2018-11-23 11:56:10,432 INFO L273 TraceCheckUtils]: 94: Hoare triple {13780#false} ~cond := #in~cond; {13780#false} is VALID [2018-11-23 11:56:10,432 INFO L273 TraceCheckUtils]: 95: Hoare triple {13780#false} assume 0 == ~cond; {13780#false} is VALID [2018-11-23 11:56:10,433 INFO L273 TraceCheckUtils]: 96: Hoare triple {13780#false} assume !false; {13780#false} is VALID [2018-11-23 11:56:10,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:10,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:10,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-23 11:56:10,458 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 97 [2018-11-23 11:56:10,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:10,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 11:56:10,588 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:10,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 11:56:10,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 11:56:10,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 11:56:10,589 INFO L87 Difference]: Start difference. First operand 102 states and 131 transitions. Second operand 32 states. [2018-11-23 11:56:11,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:11,292 INFO L93 Difference]: Finished difference Result 118 states and 150 transitions. [2018-11-23 11:56:11,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 11:56:11,292 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 97 [2018-11-23 11:56:11,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:11,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:56:11,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 150 transitions. [2018-11-23 11:56:11,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:56:11,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 150 transitions. [2018-11-23 11:56:11,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 150 transitions. [2018-11-23 11:56:11,433 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:11,436 INFO L225 Difference]: With dead ends: 118 [2018-11-23 11:56:11,436 INFO L226 Difference]: Without dead ends: 107 [2018-11-23 11:56:11,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 11:56:11,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-23 11:56:11,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-11-23 11:56:11,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:11,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand 105 states. [2018-11-23 11:56:11,468 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 105 states. [2018-11-23 11:56:11,468 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 105 states. [2018-11-23 11:56:11,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:11,470 INFO L93 Difference]: Finished difference Result 107 states and 138 transitions. [2018-11-23 11:56:11,470 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 138 transitions. [2018-11-23 11:56:11,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:11,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:11,470 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 107 states. [2018-11-23 11:56:11,471 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 107 states. [2018-11-23 11:56:11,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:11,472 INFO L93 Difference]: Finished difference Result 107 states and 138 transitions. [2018-11-23 11:56:11,472 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 138 transitions. [2018-11-23 11:56:11,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:11,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:11,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:11,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:11,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 11:56:11,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 135 transitions. [2018-11-23 11:56:11,474 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 135 transitions. Word has length 97 [2018-11-23 11:56:11,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:11,474 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 135 transitions. [2018-11-23 11:56:11,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 11:56:11,474 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 135 transitions. [2018-11-23 11:56:11,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-23 11:56:11,475 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:11,475 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:11,475 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:11,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:11,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1631457379, now seen corresponding path program 29 times [2018-11-23 11:56:11,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:11,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:11,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:11,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:11,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:12,175 INFO L256 TraceCheckUtils]: 0: Hoare triple {14615#true} call ULTIMATE.init(); {14615#true} is VALID [2018-11-23 11:56:12,176 INFO L273 TraceCheckUtils]: 1: Hoare triple {14615#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14615#true} is VALID [2018-11-23 11:56:12,176 INFO L273 TraceCheckUtils]: 2: Hoare triple {14615#true} assume true; {14615#true} is VALID [2018-11-23 11:56:12,176 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14615#true} {14615#true} #55#return; {14615#true} is VALID [2018-11-23 11:56:12,176 INFO L256 TraceCheckUtils]: 4: Hoare triple {14615#true} call #t~ret4 := main(); {14615#true} is VALID [2018-11-23 11:56:12,177 INFO L273 TraceCheckUtils]: 5: Hoare triple {14615#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {14617#(= main_~i~0 0)} is VALID [2018-11-23 11:56:12,177 INFO L273 TraceCheckUtils]: 6: Hoare triple {14617#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14617#(= main_~i~0 0)} is VALID [2018-11-23 11:56:12,178 INFO L273 TraceCheckUtils]: 7: Hoare triple {14617#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14617#(= main_~i~0 0)} is VALID [2018-11-23 11:56:12,178 INFO L273 TraceCheckUtils]: 8: Hoare triple {14617#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {14618#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:12,179 INFO L273 TraceCheckUtils]: 9: Hoare triple {14618#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14618#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:12,181 INFO L273 TraceCheckUtils]: 10: Hoare triple {14618#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14618#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:12,199 INFO L273 TraceCheckUtils]: 11: Hoare triple {14618#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {14619#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:12,210 INFO L273 TraceCheckUtils]: 12: Hoare triple {14619#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14619#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:12,210 INFO L273 TraceCheckUtils]: 13: Hoare triple {14619#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14619#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:12,211 INFO L273 TraceCheckUtils]: 14: Hoare triple {14619#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {14620#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:12,211 INFO L273 TraceCheckUtils]: 15: Hoare triple {14620#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14620#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:12,211 INFO L273 TraceCheckUtils]: 16: Hoare triple {14620#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14620#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:12,212 INFO L273 TraceCheckUtils]: 17: Hoare triple {14620#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {14621#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:12,212 INFO L273 TraceCheckUtils]: 18: Hoare triple {14621#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14621#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:12,212 INFO L273 TraceCheckUtils]: 19: Hoare triple {14621#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14621#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:12,213 INFO L273 TraceCheckUtils]: 20: Hoare triple {14621#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {14622#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:12,213 INFO L273 TraceCheckUtils]: 21: Hoare triple {14622#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14622#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:12,213 INFO L273 TraceCheckUtils]: 22: Hoare triple {14622#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14622#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:12,214 INFO L273 TraceCheckUtils]: 23: Hoare triple {14622#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {14623#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:12,214 INFO L273 TraceCheckUtils]: 24: Hoare triple {14623#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14623#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:12,215 INFO L273 TraceCheckUtils]: 25: Hoare triple {14623#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14623#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:12,215 INFO L273 TraceCheckUtils]: 26: Hoare triple {14623#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {14624#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:12,232 INFO L273 TraceCheckUtils]: 27: Hoare triple {14624#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14624#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:12,240 INFO L273 TraceCheckUtils]: 28: Hoare triple {14624#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14624#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:12,248 INFO L273 TraceCheckUtils]: 29: Hoare triple {14624#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {14625#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:12,248 INFO L273 TraceCheckUtils]: 30: Hoare triple {14625#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14625#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:12,249 INFO L273 TraceCheckUtils]: 31: Hoare triple {14625#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14625#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:12,249 INFO L273 TraceCheckUtils]: 32: Hoare triple {14625#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {14626#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:12,249 INFO L273 TraceCheckUtils]: 33: Hoare triple {14626#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14626#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:12,250 INFO L273 TraceCheckUtils]: 34: Hoare triple {14626#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14626#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:12,250 INFO L273 TraceCheckUtils]: 35: Hoare triple {14626#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {14627#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:12,251 INFO L273 TraceCheckUtils]: 36: Hoare triple {14627#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14627#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:12,251 INFO L273 TraceCheckUtils]: 37: Hoare triple {14627#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14627#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:12,251 INFO L273 TraceCheckUtils]: 38: Hoare triple {14627#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {14628#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:12,252 INFO L273 TraceCheckUtils]: 39: Hoare triple {14628#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14628#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:12,252 INFO L273 TraceCheckUtils]: 40: Hoare triple {14628#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14628#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:12,252 INFO L273 TraceCheckUtils]: 41: Hoare triple {14628#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {14629#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:12,253 INFO L273 TraceCheckUtils]: 42: Hoare triple {14629#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14629#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:12,253 INFO L273 TraceCheckUtils]: 43: Hoare triple {14629#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14629#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:12,254 INFO L273 TraceCheckUtils]: 44: Hoare triple {14629#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {14630#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:12,255 INFO L273 TraceCheckUtils]: 45: Hoare triple {14630#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14630#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:12,255 INFO L273 TraceCheckUtils]: 46: Hoare triple {14630#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14630#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:12,256 INFO L273 TraceCheckUtils]: 47: Hoare triple {14630#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {14631#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:12,256 INFO L273 TraceCheckUtils]: 48: Hoare triple {14631#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14631#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:12,257 INFO L273 TraceCheckUtils]: 49: Hoare triple {14631#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14631#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:12,258 INFO L273 TraceCheckUtils]: 50: Hoare triple {14631#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {14632#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:12,258 INFO L273 TraceCheckUtils]: 51: Hoare triple {14632#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14632#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:12,259 INFO L273 TraceCheckUtils]: 52: Hoare triple {14632#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14632#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:12,259 INFO L273 TraceCheckUtils]: 53: Hoare triple {14632#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {14633#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:12,260 INFO L273 TraceCheckUtils]: 54: Hoare triple {14633#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14633#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:12,260 INFO L273 TraceCheckUtils]: 55: Hoare triple {14633#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14633#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:12,261 INFO L273 TraceCheckUtils]: 56: Hoare triple {14633#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {14634#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:12,262 INFO L273 TraceCheckUtils]: 57: Hoare triple {14634#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14634#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:12,262 INFO L273 TraceCheckUtils]: 58: Hoare triple {14634#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14634#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:12,263 INFO L273 TraceCheckUtils]: 59: Hoare triple {14634#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {14635#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:12,263 INFO L273 TraceCheckUtils]: 60: Hoare triple {14635#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14635#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:12,264 INFO L273 TraceCheckUtils]: 61: Hoare triple {14635#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14635#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:12,265 INFO L273 TraceCheckUtils]: 62: Hoare triple {14635#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {14636#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:12,265 INFO L273 TraceCheckUtils]: 63: Hoare triple {14636#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14636#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:12,266 INFO L273 TraceCheckUtils]: 64: Hoare triple {14636#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14636#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:12,266 INFO L273 TraceCheckUtils]: 65: Hoare triple {14636#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {14637#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:12,267 INFO L273 TraceCheckUtils]: 66: Hoare triple {14637#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14637#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:12,267 INFO L273 TraceCheckUtils]: 67: Hoare triple {14637#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14637#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:12,268 INFO L273 TraceCheckUtils]: 68: Hoare triple {14637#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {14638#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:12,269 INFO L273 TraceCheckUtils]: 69: Hoare triple {14638#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14638#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:12,269 INFO L273 TraceCheckUtils]: 70: Hoare triple {14638#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14638#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:12,270 INFO L273 TraceCheckUtils]: 71: Hoare triple {14638#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {14639#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:12,270 INFO L273 TraceCheckUtils]: 72: Hoare triple {14639#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14639#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:12,271 INFO L273 TraceCheckUtils]: 73: Hoare triple {14639#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14639#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:12,272 INFO L273 TraceCheckUtils]: 74: Hoare triple {14639#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {14640#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:12,272 INFO L273 TraceCheckUtils]: 75: Hoare triple {14640#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14640#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:12,273 INFO L273 TraceCheckUtils]: 76: Hoare triple {14640#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14640#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:12,273 INFO L273 TraceCheckUtils]: 77: Hoare triple {14640#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {14641#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:12,274 INFO L273 TraceCheckUtils]: 78: Hoare triple {14641#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14641#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:12,274 INFO L273 TraceCheckUtils]: 79: Hoare triple {14641#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14641#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:12,275 INFO L273 TraceCheckUtils]: 80: Hoare triple {14641#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {14642#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:12,276 INFO L273 TraceCheckUtils]: 81: Hoare triple {14642#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14642#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:12,276 INFO L273 TraceCheckUtils]: 82: Hoare triple {14642#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14642#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:12,277 INFO L273 TraceCheckUtils]: 83: Hoare triple {14642#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {14643#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:12,277 INFO L273 TraceCheckUtils]: 84: Hoare triple {14643#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14643#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:12,297 INFO L273 TraceCheckUtils]: 85: Hoare triple {14643#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14643#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:12,306 INFO L273 TraceCheckUtils]: 86: Hoare triple {14643#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {14644#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:12,321 INFO L273 TraceCheckUtils]: 87: Hoare triple {14644#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14644#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:12,329 INFO L273 TraceCheckUtils]: 88: Hoare triple {14644#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14644#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:12,343 INFO L273 TraceCheckUtils]: 89: Hoare triple {14644#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {14645#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:12,351 INFO L273 TraceCheckUtils]: 90: Hoare triple {14645#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14645#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:12,368 INFO L273 TraceCheckUtils]: 91: Hoare triple {14645#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14645#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:12,382 INFO L273 TraceCheckUtils]: 92: Hoare triple {14645#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {14646#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:12,391 INFO L273 TraceCheckUtils]: 93: Hoare triple {14646#(<= main_~i~0 29)} assume !(~i~0 < 100000); {14616#false} is VALID [2018-11-23 11:56:12,391 INFO L273 TraceCheckUtils]: 94: Hoare triple {14616#false} havoc ~x~0;~x~0 := 0; {14616#false} is VALID [2018-11-23 11:56:12,391 INFO L273 TraceCheckUtils]: 95: Hoare triple {14616#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {14616#false} is VALID [2018-11-23 11:56:12,391 INFO L256 TraceCheckUtils]: 96: Hoare triple {14616#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {14616#false} is VALID [2018-11-23 11:56:12,391 INFO L273 TraceCheckUtils]: 97: Hoare triple {14616#false} ~cond := #in~cond; {14616#false} is VALID [2018-11-23 11:56:12,392 INFO L273 TraceCheckUtils]: 98: Hoare triple {14616#false} assume 0 == ~cond; {14616#false} is VALID [2018-11-23 11:56:12,392 INFO L273 TraceCheckUtils]: 99: Hoare triple {14616#false} assume !false; {14616#false} is VALID [2018-11-23 11:56:12,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:12,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:12,401 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:12,416 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:56:12,611 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-11-23 11:56:12,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:12,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:12,866 INFO L256 TraceCheckUtils]: 0: Hoare triple {14615#true} call ULTIMATE.init(); {14615#true} is VALID [2018-11-23 11:56:12,866 INFO L273 TraceCheckUtils]: 1: Hoare triple {14615#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14615#true} is VALID [2018-11-23 11:56:12,866 INFO L273 TraceCheckUtils]: 2: Hoare triple {14615#true} assume true; {14615#true} is VALID [2018-11-23 11:56:12,867 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14615#true} {14615#true} #55#return; {14615#true} is VALID [2018-11-23 11:56:12,867 INFO L256 TraceCheckUtils]: 4: Hoare triple {14615#true} call #t~ret4 := main(); {14615#true} is VALID [2018-11-23 11:56:12,867 INFO L273 TraceCheckUtils]: 5: Hoare triple {14615#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {14665#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:12,868 INFO L273 TraceCheckUtils]: 6: Hoare triple {14665#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14665#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:12,868 INFO L273 TraceCheckUtils]: 7: Hoare triple {14665#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14665#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:12,869 INFO L273 TraceCheckUtils]: 8: Hoare triple {14665#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {14618#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:12,869 INFO L273 TraceCheckUtils]: 9: Hoare triple {14618#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14618#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:12,869 INFO L273 TraceCheckUtils]: 10: Hoare triple {14618#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14618#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:12,870 INFO L273 TraceCheckUtils]: 11: Hoare triple {14618#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {14619#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:12,870 INFO L273 TraceCheckUtils]: 12: Hoare triple {14619#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14619#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:12,871 INFO L273 TraceCheckUtils]: 13: Hoare triple {14619#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14619#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:12,871 INFO L273 TraceCheckUtils]: 14: Hoare triple {14619#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {14620#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:12,872 INFO L273 TraceCheckUtils]: 15: Hoare triple {14620#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14620#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:12,872 INFO L273 TraceCheckUtils]: 16: Hoare triple {14620#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14620#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:12,873 INFO L273 TraceCheckUtils]: 17: Hoare triple {14620#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {14621#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:12,874 INFO L273 TraceCheckUtils]: 18: Hoare triple {14621#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14621#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:12,874 INFO L273 TraceCheckUtils]: 19: Hoare triple {14621#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14621#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:12,875 INFO L273 TraceCheckUtils]: 20: Hoare triple {14621#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {14622#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:12,875 INFO L273 TraceCheckUtils]: 21: Hoare triple {14622#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14622#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:12,876 INFO L273 TraceCheckUtils]: 22: Hoare triple {14622#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14622#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:12,877 INFO L273 TraceCheckUtils]: 23: Hoare triple {14622#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {14623#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:12,877 INFO L273 TraceCheckUtils]: 24: Hoare triple {14623#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14623#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:12,878 INFO L273 TraceCheckUtils]: 25: Hoare triple {14623#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14623#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:12,878 INFO L273 TraceCheckUtils]: 26: Hoare triple {14623#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {14624#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:12,879 INFO L273 TraceCheckUtils]: 27: Hoare triple {14624#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14624#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:12,879 INFO L273 TraceCheckUtils]: 28: Hoare triple {14624#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14624#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:12,880 INFO L273 TraceCheckUtils]: 29: Hoare triple {14624#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {14625#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:12,881 INFO L273 TraceCheckUtils]: 30: Hoare triple {14625#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14625#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:12,902 INFO L273 TraceCheckUtils]: 31: Hoare triple {14625#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14625#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:12,909 INFO L273 TraceCheckUtils]: 32: Hoare triple {14625#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {14626#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:12,909 INFO L273 TraceCheckUtils]: 33: Hoare triple {14626#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14626#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:12,910 INFO L273 TraceCheckUtils]: 34: Hoare triple {14626#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14626#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:12,910 INFO L273 TraceCheckUtils]: 35: Hoare triple {14626#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {14627#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:12,910 INFO L273 TraceCheckUtils]: 36: Hoare triple {14627#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14627#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:12,911 INFO L273 TraceCheckUtils]: 37: Hoare triple {14627#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14627#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:12,911 INFO L273 TraceCheckUtils]: 38: Hoare triple {14627#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {14628#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:12,911 INFO L273 TraceCheckUtils]: 39: Hoare triple {14628#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14628#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:12,912 INFO L273 TraceCheckUtils]: 40: Hoare triple {14628#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14628#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:12,912 INFO L273 TraceCheckUtils]: 41: Hoare triple {14628#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {14629#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:12,912 INFO L273 TraceCheckUtils]: 42: Hoare triple {14629#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14629#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:12,913 INFO L273 TraceCheckUtils]: 43: Hoare triple {14629#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14629#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:12,914 INFO L273 TraceCheckUtils]: 44: Hoare triple {14629#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {14630#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:12,914 INFO L273 TraceCheckUtils]: 45: Hoare triple {14630#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14630#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:12,915 INFO L273 TraceCheckUtils]: 46: Hoare triple {14630#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14630#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:12,915 INFO L273 TraceCheckUtils]: 47: Hoare triple {14630#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {14631#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:12,916 INFO L273 TraceCheckUtils]: 48: Hoare triple {14631#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14631#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:12,916 INFO L273 TraceCheckUtils]: 49: Hoare triple {14631#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14631#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:12,917 INFO L273 TraceCheckUtils]: 50: Hoare triple {14631#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {14632#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:12,918 INFO L273 TraceCheckUtils]: 51: Hoare triple {14632#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14632#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:12,918 INFO L273 TraceCheckUtils]: 52: Hoare triple {14632#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14632#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:12,919 INFO L273 TraceCheckUtils]: 53: Hoare triple {14632#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {14633#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:12,919 INFO L273 TraceCheckUtils]: 54: Hoare triple {14633#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14633#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:12,920 INFO L273 TraceCheckUtils]: 55: Hoare triple {14633#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14633#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:12,920 INFO L273 TraceCheckUtils]: 56: Hoare triple {14633#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {14634#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:12,921 INFO L273 TraceCheckUtils]: 57: Hoare triple {14634#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14634#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:12,921 INFO L273 TraceCheckUtils]: 58: Hoare triple {14634#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14634#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:12,922 INFO L273 TraceCheckUtils]: 59: Hoare triple {14634#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {14635#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:12,923 INFO L273 TraceCheckUtils]: 60: Hoare triple {14635#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14635#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:12,923 INFO L273 TraceCheckUtils]: 61: Hoare triple {14635#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14635#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:12,924 INFO L273 TraceCheckUtils]: 62: Hoare triple {14635#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {14636#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:12,924 INFO L273 TraceCheckUtils]: 63: Hoare triple {14636#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14636#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:12,925 INFO L273 TraceCheckUtils]: 64: Hoare triple {14636#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14636#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:12,926 INFO L273 TraceCheckUtils]: 65: Hoare triple {14636#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {14637#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:12,926 INFO L273 TraceCheckUtils]: 66: Hoare triple {14637#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14637#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:12,927 INFO L273 TraceCheckUtils]: 67: Hoare triple {14637#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14637#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:12,927 INFO L273 TraceCheckUtils]: 68: Hoare triple {14637#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {14638#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:12,928 INFO L273 TraceCheckUtils]: 69: Hoare triple {14638#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14638#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:12,928 INFO L273 TraceCheckUtils]: 70: Hoare triple {14638#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14638#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:12,929 INFO L273 TraceCheckUtils]: 71: Hoare triple {14638#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {14639#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:12,930 INFO L273 TraceCheckUtils]: 72: Hoare triple {14639#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14639#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:12,930 INFO L273 TraceCheckUtils]: 73: Hoare triple {14639#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14639#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:12,931 INFO L273 TraceCheckUtils]: 74: Hoare triple {14639#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {14640#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:12,931 INFO L273 TraceCheckUtils]: 75: Hoare triple {14640#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14640#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:12,932 INFO L273 TraceCheckUtils]: 76: Hoare triple {14640#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14640#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:12,933 INFO L273 TraceCheckUtils]: 77: Hoare triple {14640#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {14641#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:12,933 INFO L273 TraceCheckUtils]: 78: Hoare triple {14641#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14641#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:12,934 INFO L273 TraceCheckUtils]: 79: Hoare triple {14641#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14641#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:12,934 INFO L273 TraceCheckUtils]: 80: Hoare triple {14641#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {14642#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:12,935 INFO L273 TraceCheckUtils]: 81: Hoare triple {14642#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14642#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:12,935 INFO L273 TraceCheckUtils]: 82: Hoare triple {14642#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14642#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:12,936 INFO L273 TraceCheckUtils]: 83: Hoare triple {14642#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {14643#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:12,936 INFO L273 TraceCheckUtils]: 84: Hoare triple {14643#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14643#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:12,937 INFO L273 TraceCheckUtils]: 85: Hoare triple {14643#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14643#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:12,938 INFO L273 TraceCheckUtils]: 86: Hoare triple {14643#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {14644#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:12,938 INFO L273 TraceCheckUtils]: 87: Hoare triple {14644#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14644#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:12,939 INFO L273 TraceCheckUtils]: 88: Hoare triple {14644#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14644#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:12,939 INFO L273 TraceCheckUtils]: 89: Hoare triple {14644#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {14645#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:12,940 INFO L273 TraceCheckUtils]: 90: Hoare triple {14645#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14645#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:12,940 INFO L273 TraceCheckUtils]: 91: Hoare triple {14645#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {14645#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:12,941 INFO L273 TraceCheckUtils]: 92: Hoare triple {14645#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {14646#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:12,942 INFO L273 TraceCheckUtils]: 93: Hoare triple {14646#(<= main_~i~0 29)} assume !(~i~0 < 100000); {14616#false} is VALID [2018-11-23 11:56:12,942 INFO L273 TraceCheckUtils]: 94: Hoare triple {14616#false} havoc ~x~0;~x~0 := 0; {14616#false} is VALID [2018-11-23 11:56:12,942 INFO L273 TraceCheckUtils]: 95: Hoare triple {14616#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {14616#false} is VALID [2018-11-23 11:56:12,942 INFO L256 TraceCheckUtils]: 96: Hoare triple {14616#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {14616#false} is VALID [2018-11-23 11:56:12,943 INFO L273 TraceCheckUtils]: 97: Hoare triple {14616#false} ~cond := #in~cond; {14616#false} is VALID [2018-11-23 11:56:12,943 INFO L273 TraceCheckUtils]: 98: Hoare triple {14616#false} assume 0 == ~cond; {14616#false} is VALID [2018-11-23 11:56:12,943 INFO L273 TraceCheckUtils]: 99: Hoare triple {14616#false} assume !false; {14616#false} is VALID [2018-11-23 11:56:12,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:12,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:12,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-11-23 11:56:12,970 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 100 [2018-11-23 11:56:12,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:12,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 11:56:13,069 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:13,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 11:56:13,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 11:56:13,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 11:56:13,071 INFO L87 Difference]: Start difference. First operand 105 states and 135 transitions. Second operand 33 states. [2018-11-23 11:56:13,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:13,855 INFO L93 Difference]: Finished difference Result 121 states and 154 transitions. [2018-11-23 11:56:13,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 11:56:13,855 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 100 [2018-11-23 11:56:13,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:13,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:56:13,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 154 transitions. [2018-11-23 11:56:13,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:56:13,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 154 transitions. [2018-11-23 11:56:13,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 154 transitions. [2018-11-23 11:56:14,019 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:14,022 INFO L225 Difference]: With dead ends: 121 [2018-11-23 11:56:14,022 INFO L226 Difference]: Without dead ends: 110 [2018-11-23 11:56:14,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 11:56:14,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-23 11:56:14,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-11-23 11:56:14,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:14,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 108 states. [2018-11-23 11:56:14,063 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 108 states. [2018-11-23 11:56:14,063 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 108 states. [2018-11-23 11:56:14,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:14,065 INFO L93 Difference]: Finished difference Result 110 states and 142 transitions. [2018-11-23 11:56:14,065 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 142 transitions. [2018-11-23 11:56:14,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:14,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:14,066 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 110 states. [2018-11-23 11:56:14,066 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 110 states. [2018-11-23 11:56:14,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:14,068 INFO L93 Difference]: Finished difference Result 110 states and 142 transitions. [2018-11-23 11:56:14,068 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 142 transitions. [2018-11-23 11:56:14,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:14,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:14,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:14,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:14,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-23 11:56:14,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 139 transitions. [2018-11-23 11:56:14,070 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 139 transitions. Word has length 100 [2018-11-23 11:56:14,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:14,071 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 139 transitions. [2018-11-23 11:56:14,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 11:56:14,071 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 139 transitions. [2018-11-23 11:56:14,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-23 11:56:14,072 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:14,072 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:14,072 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:14,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:14,072 INFO L82 PathProgramCache]: Analyzing trace with hash -57777927, now seen corresponding path program 30 times [2018-11-23 11:56:14,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:14,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:14,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:14,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:14,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:14,657 INFO L256 TraceCheckUtils]: 0: Hoare triple {15475#true} call ULTIMATE.init(); {15475#true} is VALID [2018-11-23 11:56:14,657 INFO L273 TraceCheckUtils]: 1: Hoare triple {15475#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15475#true} is VALID [2018-11-23 11:56:14,658 INFO L273 TraceCheckUtils]: 2: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-23 11:56:14,658 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15475#true} {15475#true} #55#return; {15475#true} is VALID [2018-11-23 11:56:14,658 INFO L256 TraceCheckUtils]: 4: Hoare triple {15475#true} call #t~ret4 := main(); {15475#true} is VALID [2018-11-23 11:56:14,658 INFO L273 TraceCheckUtils]: 5: Hoare triple {15475#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {15477#(= main_~i~0 0)} is VALID [2018-11-23 11:56:14,659 INFO L273 TraceCheckUtils]: 6: Hoare triple {15477#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15477#(= main_~i~0 0)} is VALID [2018-11-23 11:56:14,659 INFO L273 TraceCheckUtils]: 7: Hoare triple {15477#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15477#(= main_~i~0 0)} is VALID [2018-11-23 11:56:14,660 INFO L273 TraceCheckUtils]: 8: Hoare triple {15477#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {15478#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:14,661 INFO L273 TraceCheckUtils]: 9: Hoare triple {15478#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15478#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:14,661 INFO L273 TraceCheckUtils]: 10: Hoare triple {15478#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15478#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:14,661 INFO L273 TraceCheckUtils]: 11: Hoare triple {15478#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {15479#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:14,662 INFO L273 TraceCheckUtils]: 12: Hoare triple {15479#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15479#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:14,662 INFO L273 TraceCheckUtils]: 13: Hoare triple {15479#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15479#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:14,662 INFO L273 TraceCheckUtils]: 14: Hoare triple {15479#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {15480#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:14,663 INFO L273 TraceCheckUtils]: 15: Hoare triple {15480#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15480#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:14,663 INFO L273 TraceCheckUtils]: 16: Hoare triple {15480#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15480#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:14,664 INFO L273 TraceCheckUtils]: 17: Hoare triple {15480#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {15481#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:14,665 INFO L273 TraceCheckUtils]: 18: Hoare triple {15481#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15481#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:14,665 INFO L273 TraceCheckUtils]: 19: Hoare triple {15481#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15481#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:14,666 INFO L273 TraceCheckUtils]: 20: Hoare triple {15481#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {15482#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:14,666 INFO L273 TraceCheckUtils]: 21: Hoare triple {15482#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15482#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:14,667 INFO L273 TraceCheckUtils]: 22: Hoare triple {15482#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15482#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:14,667 INFO L273 TraceCheckUtils]: 23: Hoare triple {15482#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {15483#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:14,668 INFO L273 TraceCheckUtils]: 24: Hoare triple {15483#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15483#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:14,668 INFO L273 TraceCheckUtils]: 25: Hoare triple {15483#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15483#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:14,669 INFO L273 TraceCheckUtils]: 26: Hoare triple {15483#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {15484#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:14,670 INFO L273 TraceCheckUtils]: 27: Hoare triple {15484#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15484#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:14,670 INFO L273 TraceCheckUtils]: 28: Hoare triple {15484#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15484#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:14,671 INFO L273 TraceCheckUtils]: 29: Hoare triple {15484#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {15485#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:14,671 INFO L273 TraceCheckUtils]: 30: Hoare triple {15485#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15485#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:14,672 INFO L273 TraceCheckUtils]: 31: Hoare triple {15485#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15485#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:14,673 INFO L273 TraceCheckUtils]: 32: Hoare triple {15485#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {15486#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:14,673 INFO L273 TraceCheckUtils]: 33: Hoare triple {15486#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15486#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:14,674 INFO L273 TraceCheckUtils]: 34: Hoare triple {15486#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15486#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:14,674 INFO L273 TraceCheckUtils]: 35: Hoare triple {15486#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {15487#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:14,675 INFO L273 TraceCheckUtils]: 36: Hoare triple {15487#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15487#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:14,675 INFO L273 TraceCheckUtils]: 37: Hoare triple {15487#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15487#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:14,676 INFO L273 TraceCheckUtils]: 38: Hoare triple {15487#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {15488#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:14,677 INFO L273 TraceCheckUtils]: 39: Hoare triple {15488#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15488#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:14,677 INFO L273 TraceCheckUtils]: 40: Hoare triple {15488#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15488#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:14,678 INFO L273 TraceCheckUtils]: 41: Hoare triple {15488#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {15489#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:14,678 INFO L273 TraceCheckUtils]: 42: Hoare triple {15489#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15489#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:14,679 INFO L273 TraceCheckUtils]: 43: Hoare triple {15489#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15489#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:14,679 INFO L273 TraceCheckUtils]: 44: Hoare triple {15489#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {15490#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:14,680 INFO L273 TraceCheckUtils]: 45: Hoare triple {15490#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15490#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:14,680 INFO L273 TraceCheckUtils]: 46: Hoare triple {15490#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15490#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:14,681 INFO L273 TraceCheckUtils]: 47: Hoare triple {15490#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {15491#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:14,682 INFO L273 TraceCheckUtils]: 48: Hoare triple {15491#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15491#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:14,682 INFO L273 TraceCheckUtils]: 49: Hoare triple {15491#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15491#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:14,683 INFO L273 TraceCheckUtils]: 50: Hoare triple {15491#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {15492#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:14,683 INFO L273 TraceCheckUtils]: 51: Hoare triple {15492#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15492#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:14,684 INFO L273 TraceCheckUtils]: 52: Hoare triple {15492#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15492#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:14,685 INFO L273 TraceCheckUtils]: 53: Hoare triple {15492#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {15493#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:14,685 INFO L273 TraceCheckUtils]: 54: Hoare triple {15493#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15493#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:14,686 INFO L273 TraceCheckUtils]: 55: Hoare triple {15493#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15493#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:14,686 INFO L273 TraceCheckUtils]: 56: Hoare triple {15493#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {15494#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:14,687 INFO L273 TraceCheckUtils]: 57: Hoare triple {15494#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15494#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:14,688 INFO L273 TraceCheckUtils]: 58: Hoare triple {15494#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15494#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:14,689 INFO L273 TraceCheckUtils]: 59: Hoare triple {15494#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {15495#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:14,690 INFO L273 TraceCheckUtils]: 60: Hoare triple {15495#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15495#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:14,690 INFO L273 TraceCheckUtils]: 61: Hoare triple {15495#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15495#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:14,690 INFO L273 TraceCheckUtils]: 62: Hoare triple {15495#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {15496#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:14,691 INFO L273 TraceCheckUtils]: 63: Hoare triple {15496#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15496#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:14,691 INFO L273 TraceCheckUtils]: 64: Hoare triple {15496#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15496#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:14,691 INFO L273 TraceCheckUtils]: 65: Hoare triple {15496#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {15497#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:14,692 INFO L273 TraceCheckUtils]: 66: Hoare triple {15497#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15497#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:14,692 INFO L273 TraceCheckUtils]: 67: Hoare triple {15497#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15497#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:14,693 INFO L273 TraceCheckUtils]: 68: Hoare triple {15497#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {15498#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:14,693 INFO L273 TraceCheckUtils]: 69: Hoare triple {15498#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15498#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:14,694 INFO L273 TraceCheckUtils]: 70: Hoare triple {15498#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15498#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:14,695 INFO L273 TraceCheckUtils]: 71: Hoare triple {15498#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {15499#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:14,695 INFO L273 TraceCheckUtils]: 72: Hoare triple {15499#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15499#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:14,696 INFO L273 TraceCheckUtils]: 73: Hoare triple {15499#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15499#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:14,696 INFO L273 TraceCheckUtils]: 74: Hoare triple {15499#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {15500#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:14,697 INFO L273 TraceCheckUtils]: 75: Hoare triple {15500#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15500#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:14,697 INFO L273 TraceCheckUtils]: 76: Hoare triple {15500#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15500#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:14,698 INFO L273 TraceCheckUtils]: 77: Hoare triple {15500#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {15501#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:14,699 INFO L273 TraceCheckUtils]: 78: Hoare triple {15501#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15501#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:14,699 INFO L273 TraceCheckUtils]: 79: Hoare triple {15501#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15501#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:14,700 INFO L273 TraceCheckUtils]: 80: Hoare triple {15501#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {15502#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:14,700 INFO L273 TraceCheckUtils]: 81: Hoare triple {15502#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15502#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:14,701 INFO L273 TraceCheckUtils]: 82: Hoare triple {15502#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15502#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:14,702 INFO L273 TraceCheckUtils]: 83: Hoare triple {15502#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {15503#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:14,702 INFO L273 TraceCheckUtils]: 84: Hoare triple {15503#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15503#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:14,703 INFO L273 TraceCheckUtils]: 85: Hoare triple {15503#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15503#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:14,703 INFO L273 TraceCheckUtils]: 86: Hoare triple {15503#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {15504#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:14,704 INFO L273 TraceCheckUtils]: 87: Hoare triple {15504#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15504#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:14,704 INFO L273 TraceCheckUtils]: 88: Hoare triple {15504#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15504#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:14,705 INFO L273 TraceCheckUtils]: 89: Hoare triple {15504#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {15505#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:14,705 INFO L273 TraceCheckUtils]: 90: Hoare triple {15505#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15505#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:14,706 INFO L273 TraceCheckUtils]: 91: Hoare triple {15505#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15505#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:14,707 INFO L273 TraceCheckUtils]: 92: Hoare triple {15505#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {15506#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:14,707 INFO L273 TraceCheckUtils]: 93: Hoare triple {15506#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15506#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:14,708 INFO L273 TraceCheckUtils]: 94: Hoare triple {15506#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15506#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:14,708 INFO L273 TraceCheckUtils]: 95: Hoare triple {15506#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {15507#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:14,709 INFO L273 TraceCheckUtils]: 96: Hoare triple {15507#(<= main_~i~0 30)} assume !(~i~0 < 100000); {15476#false} is VALID [2018-11-23 11:56:14,709 INFO L273 TraceCheckUtils]: 97: Hoare triple {15476#false} havoc ~x~0;~x~0 := 0; {15476#false} is VALID [2018-11-23 11:56:14,709 INFO L273 TraceCheckUtils]: 98: Hoare triple {15476#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {15476#false} is VALID [2018-11-23 11:56:14,710 INFO L256 TraceCheckUtils]: 99: Hoare triple {15476#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {15476#false} is VALID [2018-11-23 11:56:14,710 INFO L273 TraceCheckUtils]: 100: Hoare triple {15476#false} ~cond := #in~cond; {15476#false} is VALID [2018-11-23 11:56:14,710 INFO L273 TraceCheckUtils]: 101: Hoare triple {15476#false} assume 0 == ~cond; {15476#false} is VALID [2018-11-23 11:56:14,710 INFO L273 TraceCheckUtils]: 102: Hoare triple {15476#false} assume !false; {15476#false} is VALID [2018-11-23 11:56:14,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:14,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:14,719 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:14,729 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:56:14,799 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-11-23 11:56:14,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:14,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:16,254 INFO L256 TraceCheckUtils]: 0: Hoare triple {15475#true} call ULTIMATE.init(); {15475#true} is VALID [2018-11-23 11:56:16,254 INFO L273 TraceCheckUtils]: 1: Hoare triple {15475#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15475#true} is VALID [2018-11-23 11:56:16,255 INFO L273 TraceCheckUtils]: 2: Hoare triple {15475#true} assume true; {15475#true} is VALID [2018-11-23 11:56:16,255 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15475#true} {15475#true} #55#return; {15475#true} is VALID [2018-11-23 11:56:16,255 INFO L256 TraceCheckUtils]: 4: Hoare triple {15475#true} call #t~ret4 := main(); {15475#true} is VALID [2018-11-23 11:56:16,256 INFO L273 TraceCheckUtils]: 5: Hoare triple {15475#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {15526#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:16,256 INFO L273 TraceCheckUtils]: 6: Hoare triple {15526#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15526#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:16,256 INFO L273 TraceCheckUtils]: 7: Hoare triple {15526#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15526#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:16,257 INFO L273 TraceCheckUtils]: 8: Hoare triple {15526#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {15478#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:16,257 INFO L273 TraceCheckUtils]: 9: Hoare triple {15478#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15478#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:16,257 INFO L273 TraceCheckUtils]: 10: Hoare triple {15478#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15478#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:16,258 INFO L273 TraceCheckUtils]: 11: Hoare triple {15478#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {15479#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:16,258 INFO L273 TraceCheckUtils]: 12: Hoare triple {15479#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15479#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:16,258 INFO L273 TraceCheckUtils]: 13: Hoare triple {15479#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15479#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:16,259 INFO L273 TraceCheckUtils]: 14: Hoare triple {15479#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {15480#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:16,259 INFO L273 TraceCheckUtils]: 15: Hoare triple {15480#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15480#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:16,260 INFO L273 TraceCheckUtils]: 16: Hoare triple {15480#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15480#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:16,261 INFO L273 TraceCheckUtils]: 17: Hoare triple {15480#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {15481#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:16,261 INFO L273 TraceCheckUtils]: 18: Hoare triple {15481#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15481#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:16,262 INFO L273 TraceCheckUtils]: 19: Hoare triple {15481#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15481#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:16,262 INFO L273 TraceCheckUtils]: 20: Hoare triple {15481#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {15482#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:16,263 INFO L273 TraceCheckUtils]: 21: Hoare triple {15482#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15482#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:16,263 INFO L273 TraceCheckUtils]: 22: Hoare triple {15482#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15482#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:16,264 INFO L273 TraceCheckUtils]: 23: Hoare triple {15482#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {15483#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:16,265 INFO L273 TraceCheckUtils]: 24: Hoare triple {15483#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15483#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:16,265 INFO L273 TraceCheckUtils]: 25: Hoare triple {15483#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15483#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:16,266 INFO L273 TraceCheckUtils]: 26: Hoare triple {15483#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {15484#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:16,266 INFO L273 TraceCheckUtils]: 27: Hoare triple {15484#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15484#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:16,267 INFO L273 TraceCheckUtils]: 28: Hoare triple {15484#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15484#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:16,268 INFO L273 TraceCheckUtils]: 29: Hoare triple {15484#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {15485#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:16,268 INFO L273 TraceCheckUtils]: 30: Hoare triple {15485#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15485#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:16,269 INFO L273 TraceCheckUtils]: 31: Hoare triple {15485#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15485#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:16,269 INFO L273 TraceCheckUtils]: 32: Hoare triple {15485#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {15486#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:16,270 INFO L273 TraceCheckUtils]: 33: Hoare triple {15486#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15486#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:16,270 INFO L273 TraceCheckUtils]: 34: Hoare triple {15486#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15486#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:16,271 INFO L273 TraceCheckUtils]: 35: Hoare triple {15486#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {15487#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:16,271 INFO L273 TraceCheckUtils]: 36: Hoare triple {15487#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15487#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:16,272 INFO L273 TraceCheckUtils]: 37: Hoare triple {15487#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15487#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:16,273 INFO L273 TraceCheckUtils]: 38: Hoare triple {15487#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {15488#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:16,273 INFO L273 TraceCheckUtils]: 39: Hoare triple {15488#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15488#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:16,274 INFO L273 TraceCheckUtils]: 40: Hoare triple {15488#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15488#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:16,274 INFO L273 TraceCheckUtils]: 41: Hoare triple {15488#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {15489#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:16,275 INFO L273 TraceCheckUtils]: 42: Hoare triple {15489#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15489#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:16,275 INFO L273 TraceCheckUtils]: 43: Hoare triple {15489#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15489#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:16,276 INFO L273 TraceCheckUtils]: 44: Hoare triple {15489#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {15490#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:16,277 INFO L273 TraceCheckUtils]: 45: Hoare triple {15490#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15490#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:16,277 INFO L273 TraceCheckUtils]: 46: Hoare triple {15490#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15490#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:16,278 INFO L273 TraceCheckUtils]: 47: Hoare triple {15490#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {15491#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:16,278 INFO L273 TraceCheckUtils]: 48: Hoare triple {15491#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15491#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:16,279 INFO L273 TraceCheckUtils]: 49: Hoare triple {15491#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15491#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:16,280 INFO L273 TraceCheckUtils]: 50: Hoare triple {15491#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {15492#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:16,280 INFO L273 TraceCheckUtils]: 51: Hoare triple {15492#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15492#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:16,281 INFO L273 TraceCheckUtils]: 52: Hoare triple {15492#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15492#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:16,281 INFO L273 TraceCheckUtils]: 53: Hoare triple {15492#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {15493#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:16,282 INFO L273 TraceCheckUtils]: 54: Hoare triple {15493#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15493#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:16,282 INFO L273 TraceCheckUtils]: 55: Hoare triple {15493#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15493#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:16,283 INFO L273 TraceCheckUtils]: 56: Hoare triple {15493#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {15494#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:16,283 INFO L273 TraceCheckUtils]: 57: Hoare triple {15494#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15494#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:16,284 INFO L273 TraceCheckUtils]: 58: Hoare triple {15494#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15494#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:16,285 INFO L273 TraceCheckUtils]: 59: Hoare triple {15494#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {15495#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:16,285 INFO L273 TraceCheckUtils]: 60: Hoare triple {15495#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15495#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:16,286 INFO L273 TraceCheckUtils]: 61: Hoare triple {15495#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15495#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:16,286 INFO L273 TraceCheckUtils]: 62: Hoare triple {15495#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {15496#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:16,287 INFO L273 TraceCheckUtils]: 63: Hoare triple {15496#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15496#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:16,287 INFO L273 TraceCheckUtils]: 64: Hoare triple {15496#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15496#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:16,288 INFO L273 TraceCheckUtils]: 65: Hoare triple {15496#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {15497#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:16,289 INFO L273 TraceCheckUtils]: 66: Hoare triple {15497#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15497#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:16,289 INFO L273 TraceCheckUtils]: 67: Hoare triple {15497#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15497#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:16,290 INFO L273 TraceCheckUtils]: 68: Hoare triple {15497#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {15498#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:16,290 INFO L273 TraceCheckUtils]: 69: Hoare triple {15498#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15498#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:16,291 INFO L273 TraceCheckUtils]: 70: Hoare triple {15498#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15498#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:16,292 INFO L273 TraceCheckUtils]: 71: Hoare triple {15498#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {15499#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:16,292 INFO L273 TraceCheckUtils]: 72: Hoare triple {15499#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15499#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:16,293 INFO L273 TraceCheckUtils]: 73: Hoare triple {15499#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15499#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:16,293 INFO L273 TraceCheckUtils]: 74: Hoare triple {15499#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {15500#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:16,294 INFO L273 TraceCheckUtils]: 75: Hoare triple {15500#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15500#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:16,294 INFO L273 TraceCheckUtils]: 76: Hoare triple {15500#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15500#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:16,295 INFO L273 TraceCheckUtils]: 77: Hoare triple {15500#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {15501#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:16,296 INFO L273 TraceCheckUtils]: 78: Hoare triple {15501#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15501#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:16,296 INFO L273 TraceCheckUtils]: 79: Hoare triple {15501#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15501#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:16,297 INFO L273 TraceCheckUtils]: 80: Hoare triple {15501#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {15502#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:16,297 INFO L273 TraceCheckUtils]: 81: Hoare triple {15502#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15502#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:16,298 INFO L273 TraceCheckUtils]: 82: Hoare triple {15502#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15502#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:16,298 INFO L273 TraceCheckUtils]: 83: Hoare triple {15502#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {15503#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:16,299 INFO L273 TraceCheckUtils]: 84: Hoare triple {15503#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15503#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:16,299 INFO L273 TraceCheckUtils]: 85: Hoare triple {15503#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15503#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:16,300 INFO L273 TraceCheckUtils]: 86: Hoare triple {15503#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {15504#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:16,301 INFO L273 TraceCheckUtils]: 87: Hoare triple {15504#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15504#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:16,301 INFO L273 TraceCheckUtils]: 88: Hoare triple {15504#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15504#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:16,302 INFO L273 TraceCheckUtils]: 89: Hoare triple {15504#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {15505#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:16,302 INFO L273 TraceCheckUtils]: 90: Hoare triple {15505#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15505#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:16,303 INFO L273 TraceCheckUtils]: 91: Hoare triple {15505#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15505#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:16,304 INFO L273 TraceCheckUtils]: 92: Hoare triple {15505#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {15506#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:16,304 INFO L273 TraceCheckUtils]: 93: Hoare triple {15506#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15506#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:16,305 INFO L273 TraceCheckUtils]: 94: Hoare triple {15506#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {15506#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:16,305 INFO L273 TraceCheckUtils]: 95: Hoare triple {15506#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {15507#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:16,306 INFO L273 TraceCheckUtils]: 96: Hoare triple {15507#(<= main_~i~0 30)} assume !(~i~0 < 100000); {15476#false} is VALID [2018-11-23 11:56:16,306 INFO L273 TraceCheckUtils]: 97: Hoare triple {15476#false} havoc ~x~0;~x~0 := 0; {15476#false} is VALID [2018-11-23 11:56:16,306 INFO L273 TraceCheckUtils]: 98: Hoare triple {15476#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {15476#false} is VALID [2018-11-23 11:56:16,307 INFO L256 TraceCheckUtils]: 99: Hoare triple {15476#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {15476#false} is VALID [2018-11-23 11:56:16,307 INFO L273 TraceCheckUtils]: 100: Hoare triple {15476#false} ~cond := #in~cond; {15476#false} is VALID [2018-11-23 11:56:16,307 INFO L273 TraceCheckUtils]: 101: Hoare triple {15476#false} assume 0 == ~cond; {15476#false} is VALID [2018-11-23 11:56:16,307 INFO L273 TraceCheckUtils]: 102: Hoare triple {15476#false} assume !false; {15476#false} is VALID [2018-11-23 11:56:16,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:16,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:16,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-11-23 11:56:16,334 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 103 [2018-11-23 11:56:16,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:16,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 11:56:16,436 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:16,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 11:56:16,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 11:56:16,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 11:56:16,438 INFO L87 Difference]: Start difference. First operand 108 states and 139 transitions. Second operand 34 states. [2018-11-23 11:56:17,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:17,106 INFO L93 Difference]: Finished difference Result 124 states and 158 transitions. [2018-11-23 11:56:17,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 11:56:17,107 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 103 [2018-11-23 11:56:17,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:17,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:56:17,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 158 transitions. [2018-11-23 11:56:17,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:56:17,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 158 transitions. [2018-11-23 11:56:17,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 158 transitions. [2018-11-23 11:56:17,279 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:17,281 INFO L225 Difference]: With dead ends: 124 [2018-11-23 11:56:17,281 INFO L226 Difference]: Without dead ends: 113 [2018-11-23 11:56:17,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 11:56:17,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-23 11:56:17,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2018-11-23 11:56:17,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:17,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 111 states. [2018-11-23 11:56:17,320 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 111 states. [2018-11-23 11:56:17,320 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 111 states. [2018-11-23 11:56:17,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:17,322 INFO L93 Difference]: Finished difference Result 113 states and 146 transitions. [2018-11-23 11:56:17,322 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2018-11-23 11:56:17,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:17,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:17,323 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 113 states. [2018-11-23 11:56:17,323 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 113 states. [2018-11-23 11:56:17,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:17,325 INFO L93 Difference]: Finished difference Result 113 states and 146 transitions. [2018-11-23 11:56:17,325 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2018-11-23 11:56:17,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:17,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:17,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:17,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:17,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-23 11:56:17,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 143 transitions. [2018-11-23 11:56:17,328 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 143 transitions. Word has length 103 [2018-11-23 11:56:17,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:17,328 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 143 transitions. [2018-11-23 11:56:17,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 11:56:17,329 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 143 transitions. [2018-11-23 11:56:17,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-23 11:56:17,329 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:17,330 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:17,330 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:17,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:17,330 INFO L82 PathProgramCache]: Analyzing trace with hash 65028259, now seen corresponding path program 31 times [2018-11-23 11:56:17,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:17,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:17,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:17,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:17,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:18,110 INFO L256 TraceCheckUtils]: 0: Hoare triple {16359#true} call ULTIMATE.init(); {16359#true} is VALID [2018-11-23 11:56:18,111 INFO L273 TraceCheckUtils]: 1: Hoare triple {16359#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16359#true} is VALID [2018-11-23 11:56:18,111 INFO L273 TraceCheckUtils]: 2: Hoare triple {16359#true} assume true; {16359#true} is VALID [2018-11-23 11:56:18,111 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16359#true} {16359#true} #55#return; {16359#true} is VALID [2018-11-23 11:56:18,111 INFO L256 TraceCheckUtils]: 4: Hoare triple {16359#true} call #t~ret4 := main(); {16359#true} is VALID [2018-11-23 11:56:18,112 INFO L273 TraceCheckUtils]: 5: Hoare triple {16359#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {16361#(= main_~i~0 0)} is VALID [2018-11-23 11:56:18,112 INFO L273 TraceCheckUtils]: 6: Hoare triple {16361#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16361#(= main_~i~0 0)} is VALID [2018-11-23 11:56:18,113 INFO L273 TraceCheckUtils]: 7: Hoare triple {16361#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16361#(= main_~i~0 0)} is VALID [2018-11-23 11:56:18,113 INFO L273 TraceCheckUtils]: 8: Hoare triple {16361#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {16362#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:18,113 INFO L273 TraceCheckUtils]: 9: Hoare triple {16362#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16362#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:18,114 INFO L273 TraceCheckUtils]: 10: Hoare triple {16362#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16362#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:18,114 INFO L273 TraceCheckUtils]: 11: Hoare triple {16362#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {16363#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:18,114 INFO L273 TraceCheckUtils]: 12: Hoare triple {16363#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16363#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:18,115 INFO L273 TraceCheckUtils]: 13: Hoare triple {16363#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16363#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:18,115 INFO L273 TraceCheckUtils]: 14: Hoare triple {16363#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {16364#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:18,115 INFO L273 TraceCheckUtils]: 15: Hoare triple {16364#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16364#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:18,116 INFO L273 TraceCheckUtils]: 16: Hoare triple {16364#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16364#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:18,117 INFO L273 TraceCheckUtils]: 17: Hoare triple {16364#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {16365#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:18,117 INFO L273 TraceCheckUtils]: 18: Hoare triple {16365#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16365#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:18,118 INFO L273 TraceCheckUtils]: 19: Hoare triple {16365#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16365#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:18,118 INFO L273 TraceCheckUtils]: 20: Hoare triple {16365#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {16366#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:18,119 INFO L273 TraceCheckUtils]: 21: Hoare triple {16366#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16366#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:18,119 INFO L273 TraceCheckUtils]: 22: Hoare triple {16366#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16366#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:18,120 INFO L273 TraceCheckUtils]: 23: Hoare triple {16366#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {16367#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:18,121 INFO L273 TraceCheckUtils]: 24: Hoare triple {16367#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16367#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:18,121 INFO L273 TraceCheckUtils]: 25: Hoare triple {16367#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16367#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:18,122 INFO L273 TraceCheckUtils]: 26: Hoare triple {16367#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {16368#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:18,122 INFO L273 TraceCheckUtils]: 27: Hoare triple {16368#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16368#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:18,123 INFO L273 TraceCheckUtils]: 28: Hoare triple {16368#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16368#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:18,123 INFO L273 TraceCheckUtils]: 29: Hoare triple {16368#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {16369#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:18,124 INFO L273 TraceCheckUtils]: 30: Hoare triple {16369#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16369#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:18,124 INFO L273 TraceCheckUtils]: 31: Hoare triple {16369#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16369#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:18,125 INFO L273 TraceCheckUtils]: 32: Hoare triple {16369#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {16370#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:18,126 INFO L273 TraceCheckUtils]: 33: Hoare triple {16370#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16370#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:18,126 INFO L273 TraceCheckUtils]: 34: Hoare triple {16370#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16370#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:18,127 INFO L273 TraceCheckUtils]: 35: Hoare triple {16370#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {16371#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:18,127 INFO L273 TraceCheckUtils]: 36: Hoare triple {16371#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16371#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:18,128 INFO L273 TraceCheckUtils]: 37: Hoare triple {16371#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16371#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:18,129 INFO L273 TraceCheckUtils]: 38: Hoare triple {16371#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {16372#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:18,129 INFO L273 TraceCheckUtils]: 39: Hoare triple {16372#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16372#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:18,130 INFO L273 TraceCheckUtils]: 40: Hoare triple {16372#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16372#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:18,130 INFO L273 TraceCheckUtils]: 41: Hoare triple {16372#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {16373#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:18,131 INFO L273 TraceCheckUtils]: 42: Hoare triple {16373#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16373#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:18,131 INFO L273 TraceCheckUtils]: 43: Hoare triple {16373#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16373#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:18,132 INFO L273 TraceCheckUtils]: 44: Hoare triple {16373#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {16374#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:18,133 INFO L273 TraceCheckUtils]: 45: Hoare triple {16374#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16374#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:18,133 INFO L273 TraceCheckUtils]: 46: Hoare triple {16374#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16374#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:18,134 INFO L273 TraceCheckUtils]: 47: Hoare triple {16374#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {16375#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:18,134 INFO L273 TraceCheckUtils]: 48: Hoare triple {16375#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16375#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:18,135 INFO L273 TraceCheckUtils]: 49: Hoare triple {16375#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16375#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:18,136 INFO L273 TraceCheckUtils]: 50: Hoare triple {16375#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {16376#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:18,136 INFO L273 TraceCheckUtils]: 51: Hoare triple {16376#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16376#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:18,137 INFO L273 TraceCheckUtils]: 52: Hoare triple {16376#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16376#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:18,137 INFO L273 TraceCheckUtils]: 53: Hoare triple {16376#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {16377#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:18,138 INFO L273 TraceCheckUtils]: 54: Hoare triple {16377#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16377#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:18,138 INFO L273 TraceCheckUtils]: 55: Hoare triple {16377#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16377#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:18,139 INFO L273 TraceCheckUtils]: 56: Hoare triple {16377#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {16378#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:18,139 INFO L273 TraceCheckUtils]: 57: Hoare triple {16378#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16378#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:18,140 INFO L273 TraceCheckUtils]: 58: Hoare triple {16378#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16378#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:18,141 INFO L273 TraceCheckUtils]: 59: Hoare triple {16378#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {16379#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:18,141 INFO L273 TraceCheckUtils]: 60: Hoare triple {16379#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16379#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:18,142 INFO L273 TraceCheckUtils]: 61: Hoare triple {16379#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16379#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:18,142 INFO L273 TraceCheckUtils]: 62: Hoare triple {16379#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {16380#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:18,143 INFO L273 TraceCheckUtils]: 63: Hoare triple {16380#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16380#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:18,143 INFO L273 TraceCheckUtils]: 64: Hoare triple {16380#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16380#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:18,144 INFO L273 TraceCheckUtils]: 65: Hoare triple {16380#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {16381#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:18,145 INFO L273 TraceCheckUtils]: 66: Hoare triple {16381#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16381#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:18,145 INFO L273 TraceCheckUtils]: 67: Hoare triple {16381#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16381#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:18,146 INFO L273 TraceCheckUtils]: 68: Hoare triple {16381#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {16382#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:18,146 INFO L273 TraceCheckUtils]: 69: Hoare triple {16382#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16382#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:18,147 INFO L273 TraceCheckUtils]: 70: Hoare triple {16382#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16382#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:18,148 INFO L273 TraceCheckUtils]: 71: Hoare triple {16382#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {16383#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:18,148 INFO L273 TraceCheckUtils]: 72: Hoare triple {16383#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16383#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:18,149 INFO L273 TraceCheckUtils]: 73: Hoare triple {16383#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16383#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:18,149 INFO L273 TraceCheckUtils]: 74: Hoare triple {16383#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {16384#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:18,150 INFO L273 TraceCheckUtils]: 75: Hoare triple {16384#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16384#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:18,150 INFO L273 TraceCheckUtils]: 76: Hoare triple {16384#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16384#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:18,151 INFO L273 TraceCheckUtils]: 77: Hoare triple {16384#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {16385#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:18,151 INFO L273 TraceCheckUtils]: 78: Hoare triple {16385#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16385#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:18,152 INFO L273 TraceCheckUtils]: 79: Hoare triple {16385#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16385#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:18,153 INFO L273 TraceCheckUtils]: 80: Hoare triple {16385#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {16386#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:18,153 INFO L273 TraceCheckUtils]: 81: Hoare triple {16386#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16386#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:18,154 INFO L273 TraceCheckUtils]: 82: Hoare triple {16386#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16386#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:18,154 INFO L273 TraceCheckUtils]: 83: Hoare triple {16386#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {16387#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:18,155 INFO L273 TraceCheckUtils]: 84: Hoare triple {16387#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16387#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:18,155 INFO L273 TraceCheckUtils]: 85: Hoare triple {16387#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16387#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:18,156 INFO L273 TraceCheckUtils]: 86: Hoare triple {16387#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {16388#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:18,157 INFO L273 TraceCheckUtils]: 87: Hoare triple {16388#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16388#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:18,157 INFO L273 TraceCheckUtils]: 88: Hoare triple {16388#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16388#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:18,158 INFO L273 TraceCheckUtils]: 89: Hoare triple {16388#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {16389#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:18,158 INFO L273 TraceCheckUtils]: 90: Hoare triple {16389#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16389#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:18,159 INFO L273 TraceCheckUtils]: 91: Hoare triple {16389#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16389#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:18,160 INFO L273 TraceCheckUtils]: 92: Hoare triple {16389#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {16390#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:18,160 INFO L273 TraceCheckUtils]: 93: Hoare triple {16390#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16390#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:18,161 INFO L273 TraceCheckUtils]: 94: Hoare triple {16390#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16390#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:18,161 INFO L273 TraceCheckUtils]: 95: Hoare triple {16390#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {16391#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:18,162 INFO L273 TraceCheckUtils]: 96: Hoare triple {16391#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16391#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:18,162 INFO L273 TraceCheckUtils]: 97: Hoare triple {16391#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16391#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:18,163 INFO L273 TraceCheckUtils]: 98: Hoare triple {16391#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {16392#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:18,164 INFO L273 TraceCheckUtils]: 99: Hoare triple {16392#(<= main_~i~0 31)} assume !(~i~0 < 100000); {16360#false} is VALID [2018-11-23 11:56:18,164 INFO L273 TraceCheckUtils]: 100: Hoare triple {16360#false} havoc ~x~0;~x~0 := 0; {16360#false} is VALID [2018-11-23 11:56:18,164 INFO L273 TraceCheckUtils]: 101: Hoare triple {16360#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {16360#false} is VALID [2018-11-23 11:56:18,164 INFO L256 TraceCheckUtils]: 102: Hoare triple {16360#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {16360#false} is VALID [2018-11-23 11:56:18,164 INFO L273 TraceCheckUtils]: 103: Hoare triple {16360#false} ~cond := #in~cond; {16360#false} is VALID [2018-11-23 11:56:18,165 INFO L273 TraceCheckUtils]: 104: Hoare triple {16360#false} assume 0 == ~cond; {16360#false} is VALID [2018-11-23 11:56:18,165 INFO L273 TraceCheckUtils]: 105: Hoare triple {16360#false} assume !false; {16360#false} is VALID [2018-11-23 11:56:18,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:18,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:18,173 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:18,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:56:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:18,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:18,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:18,481 INFO L256 TraceCheckUtils]: 0: Hoare triple {16359#true} call ULTIMATE.init(); {16359#true} is VALID [2018-11-23 11:56:18,481 INFO L273 TraceCheckUtils]: 1: Hoare triple {16359#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16359#true} is VALID [2018-11-23 11:56:18,481 INFO L273 TraceCheckUtils]: 2: Hoare triple {16359#true} assume true; {16359#true} is VALID [2018-11-23 11:56:18,482 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16359#true} {16359#true} #55#return; {16359#true} is VALID [2018-11-23 11:56:18,482 INFO L256 TraceCheckUtils]: 4: Hoare triple {16359#true} call #t~ret4 := main(); {16359#true} is VALID [2018-11-23 11:56:18,482 INFO L273 TraceCheckUtils]: 5: Hoare triple {16359#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {16411#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:18,483 INFO L273 TraceCheckUtils]: 6: Hoare triple {16411#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16411#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:18,483 INFO L273 TraceCheckUtils]: 7: Hoare triple {16411#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16411#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:18,484 INFO L273 TraceCheckUtils]: 8: Hoare triple {16411#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {16362#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:18,484 INFO L273 TraceCheckUtils]: 9: Hoare triple {16362#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16362#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:18,485 INFO L273 TraceCheckUtils]: 10: Hoare triple {16362#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16362#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:18,485 INFO L273 TraceCheckUtils]: 11: Hoare triple {16362#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {16363#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:18,485 INFO L273 TraceCheckUtils]: 12: Hoare triple {16363#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16363#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:18,486 INFO L273 TraceCheckUtils]: 13: Hoare triple {16363#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16363#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:18,486 INFO L273 TraceCheckUtils]: 14: Hoare triple {16363#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {16364#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:18,486 INFO L273 TraceCheckUtils]: 15: Hoare triple {16364#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16364#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:18,487 INFO L273 TraceCheckUtils]: 16: Hoare triple {16364#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16364#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:18,487 INFO L273 TraceCheckUtils]: 17: Hoare triple {16364#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {16365#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:18,488 INFO L273 TraceCheckUtils]: 18: Hoare triple {16365#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16365#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:18,488 INFO L273 TraceCheckUtils]: 19: Hoare triple {16365#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16365#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:18,489 INFO L273 TraceCheckUtils]: 20: Hoare triple {16365#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {16366#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:18,490 INFO L273 TraceCheckUtils]: 21: Hoare triple {16366#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16366#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:18,490 INFO L273 TraceCheckUtils]: 22: Hoare triple {16366#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16366#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:18,491 INFO L273 TraceCheckUtils]: 23: Hoare triple {16366#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {16367#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:18,491 INFO L273 TraceCheckUtils]: 24: Hoare triple {16367#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16367#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:18,493 INFO L273 TraceCheckUtils]: 25: Hoare triple {16367#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16367#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:18,493 INFO L273 TraceCheckUtils]: 26: Hoare triple {16367#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {16368#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:18,494 INFO L273 TraceCheckUtils]: 27: Hoare triple {16368#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16368#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:18,494 INFO L273 TraceCheckUtils]: 28: Hoare triple {16368#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16368#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:18,495 INFO L273 TraceCheckUtils]: 29: Hoare triple {16368#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {16369#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:18,496 INFO L273 TraceCheckUtils]: 30: Hoare triple {16369#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16369#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:18,496 INFO L273 TraceCheckUtils]: 31: Hoare triple {16369#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16369#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:18,497 INFO L273 TraceCheckUtils]: 32: Hoare triple {16369#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {16370#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:18,497 INFO L273 TraceCheckUtils]: 33: Hoare triple {16370#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16370#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:18,498 INFO L273 TraceCheckUtils]: 34: Hoare triple {16370#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16370#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:18,499 INFO L273 TraceCheckUtils]: 35: Hoare triple {16370#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {16371#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:18,499 INFO L273 TraceCheckUtils]: 36: Hoare triple {16371#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16371#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:18,500 INFO L273 TraceCheckUtils]: 37: Hoare triple {16371#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16371#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:18,500 INFO L273 TraceCheckUtils]: 38: Hoare triple {16371#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {16372#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:18,501 INFO L273 TraceCheckUtils]: 39: Hoare triple {16372#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16372#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:18,501 INFO L273 TraceCheckUtils]: 40: Hoare triple {16372#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16372#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:18,502 INFO L273 TraceCheckUtils]: 41: Hoare triple {16372#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {16373#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:18,503 INFO L273 TraceCheckUtils]: 42: Hoare triple {16373#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16373#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:18,503 INFO L273 TraceCheckUtils]: 43: Hoare triple {16373#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16373#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:18,504 INFO L273 TraceCheckUtils]: 44: Hoare triple {16373#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {16374#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:18,504 INFO L273 TraceCheckUtils]: 45: Hoare triple {16374#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16374#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:18,505 INFO L273 TraceCheckUtils]: 46: Hoare triple {16374#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16374#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:18,505 INFO L273 TraceCheckUtils]: 47: Hoare triple {16374#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {16375#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:18,506 INFO L273 TraceCheckUtils]: 48: Hoare triple {16375#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16375#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:18,506 INFO L273 TraceCheckUtils]: 49: Hoare triple {16375#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16375#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:18,507 INFO L273 TraceCheckUtils]: 50: Hoare triple {16375#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {16376#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:18,508 INFO L273 TraceCheckUtils]: 51: Hoare triple {16376#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16376#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:18,508 INFO L273 TraceCheckUtils]: 52: Hoare triple {16376#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16376#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:18,509 INFO L273 TraceCheckUtils]: 53: Hoare triple {16376#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {16377#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:18,509 INFO L273 TraceCheckUtils]: 54: Hoare triple {16377#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16377#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:18,510 INFO L273 TraceCheckUtils]: 55: Hoare triple {16377#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16377#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:18,511 INFO L273 TraceCheckUtils]: 56: Hoare triple {16377#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {16378#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:18,511 INFO L273 TraceCheckUtils]: 57: Hoare triple {16378#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16378#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:18,512 INFO L273 TraceCheckUtils]: 58: Hoare triple {16378#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16378#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:18,512 INFO L273 TraceCheckUtils]: 59: Hoare triple {16378#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {16379#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:18,513 INFO L273 TraceCheckUtils]: 60: Hoare triple {16379#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16379#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:18,513 INFO L273 TraceCheckUtils]: 61: Hoare triple {16379#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16379#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:18,514 INFO L273 TraceCheckUtils]: 62: Hoare triple {16379#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {16380#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:18,515 INFO L273 TraceCheckUtils]: 63: Hoare triple {16380#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16380#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:18,515 INFO L273 TraceCheckUtils]: 64: Hoare triple {16380#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16380#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:18,516 INFO L273 TraceCheckUtils]: 65: Hoare triple {16380#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {16381#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:18,516 INFO L273 TraceCheckUtils]: 66: Hoare triple {16381#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16381#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:18,517 INFO L273 TraceCheckUtils]: 67: Hoare triple {16381#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16381#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:18,539 INFO L273 TraceCheckUtils]: 68: Hoare triple {16381#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {16382#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:18,547 INFO L273 TraceCheckUtils]: 69: Hoare triple {16382#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16382#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:18,548 INFO L273 TraceCheckUtils]: 70: Hoare triple {16382#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16382#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:18,549 INFO L273 TraceCheckUtils]: 71: Hoare triple {16382#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {16383#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:18,549 INFO L273 TraceCheckUtils]: 72: Hoare triple {16383#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16383#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:18,549 INFO L273 TraceCheckUtils]: 73: Hoare triple {16383#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16383#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:18,550 INFO L273 TraceCheckUtils]: 74: Hoare triple {16383#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {16384#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:18,550 INFO L273 TraceCheckUtils]: 75: Hoare triple {16384#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16384#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:18,550 INFO L273 TraceCheckUtils]: 76: Hoare triple {16384#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16384#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:18,551 INFO L273 TraceCheckUtils]: 77: Hoare triple {16384#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {16385#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:18,551 INFO L273 TraceCheckUtils]: 78: Hoare triple {16385#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16385#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:18,551 INFO L273 TraceCheckUtils]: 79: Hoare triple {16385#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16385#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:18,552 INFO L273 TraceCheckUtils]: 80: Hoare triple {16385#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {16386#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:18,552 INFO L273 TraceCheckUtils]: 81: Hoare triple {16386#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16386#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:18,552 INFO L273 TraceCheckUtils]: 82: Hoare triple {16386#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16386#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:18,553 INFO L273 TraceCheckUtils]: 83: Hoare triple {16386#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {16387#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:18,554 INFO L273 TraceCheckUtils]: 84: Hoare triple {16387#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16387#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:18,554 INFO L273 TraceCheckUtils]: 85: Hoare triple {16387#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16387#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:18,555 INFO L273 TraceCheckUtils]: 86: Hoare triple {16387#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {16388#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:18,555 INFO L273 TraceCheckUtils]: 87: Hoare triple {16388#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16388#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:18,556 INFO L273 TraceCheckUtils]: 88: Hoare triple {16388#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16388#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:18,557 INFO L273 TraceCheckUtils]: 89: Hoare triple {16388#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {16389#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:18,557 INFO L273 TraceCheckUtils]: 90: Hoare triple {16389#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16389#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:18,558 INFO L273 TraceCheckUtils]: 91: Hoare triple {16389#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16389#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:18,558 INFO L273 TraceCheckUtils]: 92: Hoare triple {16389#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {16390#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:18,559 INFO L273 TraceCheckUtils]: 93: Hoare triple {16390#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16390#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:18,559 INFO L273 TraceCheckUtils]: 94: Hoare triple {16390#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16390#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:18,560 INFO L273 TraceCheckUtils]: 95: Hoare triple {16390#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {16391#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:18,561 INFO L273 TraceCheckUtils]: 96: Hoare triple {16391#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16391#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:18,561 INFO L273 TraceCheckUtils]: 97: Hoare triple {16391#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {16391#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:18,562 INFO L273 TraceCheckUtils]: 98: Hoare triple {16391#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {16392#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:18,562 INFO L273 TraceCheckUtils]: 99: Hoare triple {16392#(<= main_~i~0 31)} assume !(~i~0 < 100000); {16360#false} is VALID [2018-11-23 11:56:18,563 INFO L273 TraceCheckUtils]: 100: Hoare triple {16360#false} havoc ~x~0;~x~0 := 0; {16360#false} is VALID [2018-11-23 11:56:18,563 INFO L273 TraceCheckUtils]: 101: Hoare triple {16360#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {16360#false} is VALID [2018-11-23 11:56:18,563 INFO L256 TraceCheckUtils]: 102: Hoare triple {16360#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {16360#false} is VALID [2018-11-23 11:56:18,563 INFO L273 TraceCheckUtils]: 103: Hoare triple {16360#false} ~cond := #in~cond; {16360#false} is VALID [2018-11-23 11:56:18,563 INFO L273 TraceCheckUtils]: 104: Hoare triple {16360#false} assume 0 == ~cond; {16360#false} is VALID [2018-11-23 11:56:18,564 INFO L273 TraceCheckUtils]: 105: Hoare triple {16360#false} assume !false; {16360#false} is VALID [2018-11-23 11:56:18,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:18,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:18,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-11-23 11:56:18,592 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 106 [2018-11-23 11:56:18,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:18,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 11:56:18,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:18,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 11:56:18,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 11:56:18,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 11:56:18,698 INFO L87 Difference]: Start difference. First operand 111 states and 143 transitions. Second operand 35 states. [2018-11-23 11:56:19,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:19,288 INFO L93 Difference]: Finished difference Result 127 states and 162 transitions. [2018-11-23 11:56:19,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 11:56:19,289 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 106 [2018-11-23 11:56:19,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:19,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 11:56:19,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 162 transitions. [2018-11-23 11:56:19,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 11:56:19,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 162 transitions. [2018-11-23 11:56:19,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 162 transitions. [2018-11-23 11:56:19,445 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:19,447 INFO L225 Difference]: With dead ends: 127 [2018-11-23 11:56:19,447 INFO L226 Difference]: Without dead ends: 116 [2018-11-23 11:56:19,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 11:56:19,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-23 11:56:19,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-11-23 11:56:19,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:19,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand 114 states. [2018-11-23 11:56:19,481 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 114 states. [2018-11-23 11:56:19,481 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 114 states. [2018-11-23 11:56:19,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:19,483 INFO L93 Difference]: Finished difference Result 116 states and 150 transitions. [2018-11-23 11:56:19,483 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 150 transitions. [2018-11-23 11:56:19,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:19,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:19,484 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 116 states. [2018-11-23 11:56:19,484 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 116 states. [2018-11-23 11:56:19,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:19,486 INFO L93 Difference]: Finished difference Result 116 states and 150 transitions. [2018-11-23 11:56:19,486 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 150 transitions. [2018-11-23 11:56:19,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:19,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:19,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:19,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:19,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-23 11:56:19,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 147 transitions. [2018-11-23 11:56:19,489 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 147 transitions. Word has length 106 [2018-11-23 11:56:19,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:19,489 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 147 transitions. [2018-11-23 11:56:19,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 11:56:19,489 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 147 transitions. [2018-11-23 11:56:19,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-23 11:56:19,489 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:19,489 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:19,490 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:19,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:19,490 INFO L82 PathProgramCache]: Analyzing trace with hash -728020807, now seen corresponding path program 32 times [2018-11-23 11:56:19,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:19,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:19,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:19,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:56:19,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:20,096 INFO L256 TraceCheckUtils]: 0: Hoare triple {17267#true} call ULTIMATE.init(); {17267#true} is VALID [2018-11-23 11:56:20,096 INFO L273 TraceCheckUtils]: 1: Hoare triple {17267#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17267#true} is VALID [2018-11-23 11:56:20,096 INFO L273 TraceCheckUtils]: 2: Hoare triple {17267#true} assume true; {17267#true} is VALID [2018-11-23 11:56:20,097 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17267#true} {17267#true} #55#return; {17267#true} is VALID [2018-11-23 11:56:20,097 INFO L256 TraceCheckUtils]: 4: Hoare triple {17267#true} call #t~ret4 := main(); {17267#true} is VALID [2018-11-23 11:56:20,097 INFO L273 TraceCheckUtils]: 5: Hoare triple {17267#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {17269#(= main_~i~0 0)} is VALID [2018-11-23 11:56:20,098 INFO L273 TraceCheckUtils]: 6: Hoare triple {17269#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17269#(= main_~i~0 0)} is VALID [2018-11-23 11:56:20,098 INFO L273 TraceCheckUtils]: 7: Hoare triple {17269#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17269#(= main_~i~0 0)} is VALID [2018-11-23 11:56:20,099 INFO L273 TraceCheckUtils]: 8: Hoare triple {17269#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {17270#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:20,100 INFO L273 TraceCheckUtils]: 9: Hoare triple {17270#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17270#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:20,100 INFO L273 TraceCheckUtils]: 10: Hoare triple {17270#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17270#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:20,101 INFO L273 TraceCheckUtils]: 11: Hoare triple {17270#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {17271#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:20,101 INFO L273 TraceCheckUtils]: 12: Hoare triple {17271#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17271#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:20,102 INFO L273 TraceCheckUtils]: 13: Hoare triple {17271#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17271#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:20,103 INFO L273 TraceCheckUtils]: 14: Hoare triple {17271#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {17272#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:20,103 INFO L273 TraceCheckUtils]: 15: Hoare triple {17272#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17272#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:20,104 INFO L273 TraceCheckUtils]: 16: Hoare triple {17272#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17272#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:20,104 INFO L273 TraceCheckUtils]: 17: Hoare triple {17272#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {17273#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:20,105 INFO L273 TraceCheckUtils]: 18: Hoare triple {17273#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17273#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:20,105 INFO L273 TraceCheckUtils]: 19: Hoare triple {17273#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17273#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:20,106 INFO L273 TraceCheckUtils]: 20: Hoare triple {17273#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {17274#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:20,107 INFO L273 TraceCheckUtils]: 21: Hoare triple {17274#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17274#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:20,107 INFO L273 TraceCheckUtils]: 22: Hoare triple {17274#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17274#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:20,108 INFO L273 TraceCheckUtils]: 23: Hoare triple {17274#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {17275#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:20,108 INFO L273 TraceCheckUtils]: 24: Hoare triple {17275#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17275#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:20,109 INFO L273 TraceCheckUtils]: 25: Hoare triple {17275#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17275#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:20,109 INFO L273 TraceCheckUtils]: 26: Hoare triple {17275#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {17276#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:20,110 INFO L273 TraceCheckUtils]: 27: Hoare triple {17276#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17276#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:20,110 INFO L273 TraceCheckUtils]: 28: Hoare triple {17276#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17276#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:20,111 INFO L273 TraceCheckUtils]: 29: Hoare triple {17276#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {17277#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:20,112 INFO L273 TraceCheckUtils]: 30: Hoare triple {17277#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17277#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:20,112 INFO L273 TraceCheckUtils]: 31: Hoare triple {17277#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17277#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:20,113 INFO L273 TraceCheckUtils]: 32: Hoare triple {17277#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {17278#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:20,113 INFO L273 TraceCheckUtils]: 33: Hoare triple {17278#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17278#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:20,114 INFO L273 TraceCheckUtils]: 34: Hoare triple {17278#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17278#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:20,115 INFO L273 TraceCheckUtils]: 35: Hoare triple {17278#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {17279#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:20,115 INFO L273 TraceCheckUtils]: 36: Hoare triple {17279#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17279#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:20,116 INFO L273 TraceCheckUtils]: 37: Hoare triple {17279#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17279#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:20,116 INFO L273 TraceCheckUtils]: 38: Hoare triple {17279#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {17280#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:20,117 INFO L273 TraceCheckUtils]: 39: Hoare triple {17280#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17280#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:20,117 INFO L273 TraceCheckUtils]: 40: Hoare triple {17280#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17280#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:20,118 INFO L273 TraceCheckUtils]: 41: Hoare triple {17280#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {17281#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:20,119 INFO L273 TraceCheckUtils]: 42: Hoare triple {17281#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17281#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:20,119 INFO L273 TraceCheckUtils]: 43: Hoare triple {17281#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17281#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:20,120 INFO L273 TraceCheckUtils]: 44: Hoare triple {17281#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {17282#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:20,120 INFO L273 TraceCheckUtils]: 45: Hoare triple {17282#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17282#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:20,121 INFO L273 TraceCheckUtils]: 46: Hoare triple {17282#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17282#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:20,121 INFO L273 TraceCheckUtils]: 47: Hoare triple {17282#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {17283#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:20,122 INFO L273 TraceCheckUtils]: 48: Hoare triple {17283#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17283#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:20,122 INFO L273 TraceCheckUtils]: 49: Hoare triple {17283#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17283#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:20,123 INFO L273 TraceCheckUtils]: 50: Hoare triple {17283#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {17284#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:20,124 INFO L273 TraceCheckUtils]: 51: Hoare triple {17284#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17284#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:20,124 INFO L273 TraceCheckUtils]: 52: Hoare triple {17284#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17284#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:20,125 INFO L273 TraceCheckUtils]: 53: Hoare triple {17284#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {17285#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:20,125 INFO L273 TraceCheckUtils]: 54: Hoare triple {17285#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17285#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:20,126 INFO L273 TraceCheckUtils]: 55: Hoare triple {17285#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17285#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:20,127 INFO L273 TraceCheckUtils]: 56: Hoare triple {17285#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {17286#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:20,127 INFO L273 TraceCheckUtils]: 57: Hoare triple {17286#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17286#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:20,128 INFO L273 TraceCheckUtils]: 58: Hoare triple {17286#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17286#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:20,128 INFO L273 TraceCheckUtils]: 59: Hoare triple {17286#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {17287#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:20,129 INFO L273 TraceCheckUtils]: 60: Hoare triple {17287#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17287#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:20,129 INFO L273 TraceCheckUtils]: 61: Hoare triple {17287#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17287#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:20,130 INFO L273 TraceCheckUtils]: 62: Hoare triple {17287#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {17288#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:20,131 INFO L273 TraceCheckUtils]: 63: Hoare triple {17288#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17288#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:20,131 INFO L273 TraceCheckUtils]: 64: Hoare triple {17288#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17288#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:20,132 INFO L273 TraceCheckUtils]: 65: Hoare triple {17288#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {17289#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:20,132 INFO L273 TraceCheckUtils]: 66: Hoare triple {17289#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17289#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:20,133 INFO L273 TraceCheckUtils]: 67: Hoare triple {17289#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17289#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:20,133 INFO L273 TraceCheckUtils]: 68: Hoare triple {17289#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {17290#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:20,134 INFO L273 TraceCheckUtils]: 69: Hoare triple {17290#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17290#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:20,134 INFO L273 TraceCheckUtils]: 70: Hoare triple {17290#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17290#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:20,135 INFO L273 TraceCheckUtils]: 71: Hoare triple {17290#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {17291#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:20,136 INFO L273 TraceCheckUtils]: 72: Hoare triple {17291#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17291#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:20,136 INFO L273 TraceCheckUtils]: 73: Hoare triple {17291#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17291#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:20,137 INFO L273 TraceCheckUtils]: 74: Hoare triple {17291#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {17292#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:20,140 INFO L273 TraceCheckUtils]: 75: Hoare triple {17292#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17292#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:20,140 INFO L273 TraceCheckUtils]: 76: Hoare triple {17292#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17292#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:20,141 INFO L273 TraceCheckUtils]: 77: Hoare triple {17292#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {17293#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:20,141 INFO L273 TraceCheckUtils]: 78: Hoare triple {17293#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17293#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:20,141 INFO L273 TraceCheckUtils]: 79: Hoare triple {17293#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17293#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:20,142 INFO L273 TraceCheckUtils]: 80: Hoare triple {17293#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {17294#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:20,142 INFO L273 TraceCheckUtils]: 81: Hoare triple {17294#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17294#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:20,142 INFO L273 TraceCheckUtils]: 82: Hoare triple {17294#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17294#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:20,143 INFO L273 TraceCheckUtils]: 83: Hoare triple {17294#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {17295#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:20,143 INFO L273 TraceCheckUtils]: 84: Hoare triple {17295#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17295#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:20,143 INFO L273 TraceCheckUtils]: 85: Hoare triple {17295#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17295#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:20,144 INFO L273 TraceCheckUtils]: 86: Hoare triple {17295#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {17296#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:20,144 INFO L273 TraceCheckUtils]: 87: Hoare triple {17296#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17296#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:20,145 INFO L273 TraceCheckUtils]: 88: Hoare triple {17296#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17296#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:20,145 INFO L273 TraceCheckUtils]: 89: Hoare triple {17296#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {17297#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:20,146 INFO L273 TraceCheckUtils]: 90: Hoare triple {17297#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17297#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:20,146 INFO L273 TraceCheckUtils]: 91: Hoare triple {17297#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17297#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:20,147 INFO L273 TraceCheckUtils]: 92: Hoare triple {17297#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {17298#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:20,147 INFO L273 TraceCheckUtils]: 93: Hoare triple {17298#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17298#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:20,148 INFO L273 TraceCheckUtils]: 94: Hoare triple {17298#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17298#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:20,149 INFO L273 TraceCheckUtils]: 95: Hoare triple {17298#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {17299#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:20,149 INFO L273 TraceCheckUtils]: 96: Hoare triple {17299#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17299#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:20,150 INFO L273 TraceCheckUtils]: 97: Hoare triple {17299#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17299#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:20,150 INFO L273 TraceCheckUtils]: 98: Hoare triple {17299#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {17300#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:20,151 INFO L273 TraceCheckUtils]: 99: Hoare triple {17300#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17300#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:20,151 INFO L273 TraceCheckUtils]: 100: Hoare triple {17300#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17300#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:20,152 INFO L273 TraceCheckUtils]: 101: Hoare triple {17300#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {17301#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:20,153 INFO L273 TraceCheckUtils]: 102: Hoare triple {17301#(<= main_~i~0 32)} assume !(~i~0 < 100000); {17268#false} is VALID [2018-11-23 11:56:20,153 INFO L273 TraceCheckUtils]: 103: Hoare triple {17268#false} havoc ~x~0;~x~0 := 0; {17268#false} is VALID [2018-11-23 11:56:20,153 INFO L273 TraceCheckUtils]: 104: Hoare triple {17268#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {17268#false} is VALID [2018-11-23 11:56:20,153 INFO L256 TraceCheckUtils]: 105: Hoare triple {17268#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {17268#false} is VALID [2018-11-23 11:56:20,154 INFO L273 TraceCheckUtils]: 106: Hoare triple {17268#false} ~cond := #in~cond; {17268#false} is VALID [2018-11-23 11:56:20,154 INFO L273 TraceCheckUtils]: 107: Hoare triple {17268#false} assume 0 == ~cond; {17268#false} is VALID [2018-11-23 11:56:20,154 INFO L273 TraceCheckUtils]: 108: Hoare triple {17268#false} assume !false; {17268#false} is VALID [2018-11-23 11:56:20,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:20,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:20,164 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:20,171 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:56:20,219 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:56:20,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:20,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:20,479 INFO L256 TraceCheckUtils]: 0: Hoare triple {17267#true} call ULTIMATE.init(); {17267#true} is VALID [2018-11-23 11:56:20,480 INFO L273 TraceCheckUtils]: 1: Hoare triple {17267#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17267#true} is VALID [2018-11-23 11:56:20,480 INFO L273 TraceCheckUtils]: 2: Hoare triple {17267#true} assume true; {17267#true} is VALID [2018-11-23 11:56:20,480 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17267#true} {17267#true} #55#return; {17267#true} is VALID [2018-11-23 11:56:20,480 INFO L256 TraceCheckUtils]: 4: Hoare triple {17267#true} call #t~ret4 := main(); {17267#true} is VALID [2018-11-23 11:56:20,481 INFO L273 TraceCheckUtils]: 5: Hoare triple {17267#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {17320#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:20,482 INFO L273 TraceCheckUtils]: 6: Hoare triple {17320#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17320#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:20,482 INFO L273 TraceCheckUtils]: 7: Hoare triple {17320#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17320#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:20,482 INFO L273 TraceCheckUtils]: 8: Hoare triple {17320#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {17270#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:20,483 INFO L273 TraceCheckUtils]: 9: Hoare triple {17270#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17270#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:20,483 INFO L273 TraceCheckUtils]: 10: Hoare triple {17270#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17270#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:20,483 INFO L273 TraceCheckUtils]: 11: Hoare triple {17270#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {17271#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:20,484 INFO L273 TraceCheckUtils]: 12: Hoare triple {17271#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17271#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:20,484 INFO L273 TraceCheckUtils]: 13: Hoare triple {17271#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17271#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:20,485 INFO L273 TraceCheckUtils]: 14: Hoare triple {17271#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {17272#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:20,486 INFO L273 TraceCheckUtils]: 15: Hoare triple {17272#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17272#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:20,486 INFO L273 TraceCheckUtils]: 16: Hoare triple {17272#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17272#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:20,487 INFO L273 TraceCheckUtils]: 17: Hoare triple {17272#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {17273#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:20,487 INFO L273 TraceCheckUtils]: 18: Hoare triple {17273#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17273#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:20,488 INFO L273 TraceCheckUtils]: 19: Hoare triple {17273#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17273#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:20,488 INFO L273 TraceCheckUtils]: 20: Hoare triple {17273#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {17274#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:20,489 INFO L273 TraceCheckUtils]: 21: Hoare triple {17274#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17274#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:20,489 INFO L273 TraceCheckUtils]: 22: Hoare triple {17274#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17274#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:20,490 INFO L273 TraceCheckUtils]: 23: Hoare triple {17274#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {17275#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:20,491 INFO L273 TraceCheckUtils]: 24: Hoare triple {17275#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17275#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:20,491 INFO L273 TraceCheckUtils]: 25: Hoare triple {17275#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17275#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:20,492 INFO L273 TraceCheckUtils]: 26: Hoare triple {17275#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {17276#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:20,492 INFO L273 TraceCheckUtils]: 27: Hoare triple {17276#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17276#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:20,493 INFO L273 TraceCheckUtils]: 28: Hoare triple {17276#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17276#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:20,494 INFO L273 TraceCheckUtils]: 29: Hoare triple {17276#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {17277#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:20,494 INFO L273 TraceCheckUtils]: 30: Hoare triple {17277#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17277#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:20,495 INFO L273 TraceCheckUtils]: 31: Hoare triple {17277#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17277#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:20,495 INFO L273 TraceCheckUtils]: 32: Hoare triple {17277#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {17278#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:20,496 INFO L273 TraceCheckUtils]: 33: Hoare triple {17278#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17278#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:20,496 INFO L273 TraceCheckUtils]: 34: Hoare triple {17278#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17278#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:20,497 INFO L273 TraceCheckUtils]: 35: Hoare triple {17278#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {17279#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:20,498 INFO L273 TraceCheckUtils]: 36: Hoare triple {17279#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17279#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:20,498 INFO L273 TraceCheckUtils]: 37: Hoare triple {17279#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17279#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:20,499 INFO L273 TraceCheckUtils]: 38: Hoare triple {17279#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {17280#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:20,499 INFO L273 TraceCheckUtils]: 39: Hoare triple {17280#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17280#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:20,500 INFO L273 TraceCheckUtils]: 40: Hoare triple {17280#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17280#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:20,500 INFO L273 TraceCheckUtils]: 41: Hoare triple {17280#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {17281#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:20,501 INFO L273 TraceCheckUtils]: 42: Hoare triple {17281#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17281#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:20,501 INFO L273 TraceCheckUtils]: 43: Hoare triple {17281#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17281#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:20,502 INFO L273 TraceCheckUtils]: 44: Hoare triple {17281#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {17282#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:20,503 INFO L273 TraceCheckUtils]: 45: Hoare triple {17282#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17282#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:20,503 INFO L273 TraceCheckUtils]: 46: Hoare triple {17282#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17282#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:20,504 INFO L273 TraceCheckUtils]: 47: Hoare triple {17282#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {17283#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:20,504 INFO L273 TraceCheckUtils]: 48: Hoare triple {17283#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17283#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:20,505 INFO L273 TraceCheckUtils]: 49: Hoare triple {17283#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17283#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:20,506 INFO L273 TraceCheckUtils]: 50: Hoare triple {17283#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {17284#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:20,506 INFO L273 TraceCheckUtils]: 51: Hoare triple {17284#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17284#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:20,507 INFO L273 TraceCheckUtils]: 52: Hoare triple {17284#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17284#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:20,507 INFO L273 TraceCheckUtils]: 53: Hoare triple {17284#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {17285#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:20,508 INFO L273 TraceCheckUtils]: 54: Hoare triple {17285#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17285#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:20,508 INFO L273 TraceCheckUtils]: 55: Hoare triple {17285#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17285#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:20,509 INFO L273 TraceCheckUtils]: 56: Hoare triple {17285#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {17286#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:20,510 INFO L273 TraceCheckUtils]: 57: Hoare triple {17286#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17286#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:20,510 INFO L273 TraceCheckUtils]: 58: Hoare triple {17286#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17286#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:20,511 INFO L273 TraceCheckUtils]: 59: Hoare triple {17286#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {17287#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:20,511 INFO L273 TraceCheckUtils]: 60: Hoare triple {17287#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17287#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:20,512 INFO L273 TraceCheckUtils]: 61: Hoare triple {17287#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17287#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:20,512 INFO L273 TraceCheckUtils]: 62: Hoare triple {17287#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {17288#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:20,513 INFO L273 TraceCheckUtils]: 63: Hoare triple {17288#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17288#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:20,513 INFO L273 TraceCheckUtils]: 64: Hoare triple {17288#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17288#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:20,514 INFO L273 TraceCheckUtils]: 65: Hoare triple {17288#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {17289#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:20,515 INFO L273 TraceCheckUtils]: 66: Hoare triple {17289#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17289#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:20,515 INFO L273 TraceCheckUtils]: 67: Hoare triple {17289#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17289#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:20,516 INFO L273 TraceCheckUtils]: 68: Hoare triple {17289#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {17290#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:20,516 INFO L273 TraceCheckUtils]: 69: Hoare triple {17290#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17290#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:20,517 INFO L273 TraceCheckUtils]: 70: Hoare triple {17290#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17290#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:20,522 INFO L273 TraceCheckUtils]: 71: Hoare triple {17290#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {17291#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:20,523 INFO L273 TraceCheckUtils]: 72: Hoare triple {17291#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17291#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:20,523 INFO L273 TraceCheckUtils]: 73: Hoare triple {17291#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17291#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:20,523 INFO L273 TraceCheckUtils]: 74: Hoare triple {17291#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {17292#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:20,524 INFO L273 TraceCheckUtils]: 75: Hoare triple {17292#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17292#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:20,524 INFO L273 TraceCheckUtils]: 76: Hoare triple {17292#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17292#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:20,524 INFO L273 TraceCheckUtils]: 77: Hoare triple {17292#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {17293#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:20,525 INFO L273 TraceCheckUtils]: 78: Hoare triple {17293#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17293#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:20,525 INFO L273 TraceCheckUtils]: 79: Hoare triple {17293#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17293#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:20,525 INFO L273 TraceCheckUtils]: 80: Hoare triple {17293#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {17294#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:20,526 INFO L273 TraceCheckUtils]: 81: Hoare triple {17294#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17294#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:20,526 INFO L273 TraceCheckUtils]: 82: Hoare triple {17294#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17294#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:20,527 INFO L273 TraceCheckUtils]: 83: Hoare triple {17294#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {17295#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:20,527 INFO L273 TraceCheckUtils]: 84: Hoare triple {17295#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17295#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:20,528 INFO L273 TraceCheckUtils]: 85: Hoare triple {17295#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17295#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:20,528 INFO L273 TraceCheckUtils]: 86: Hoare triple {17295#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {17296#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:20,529 INFO L273 TraceCheckUtils]: 87: Hoare triple {17296#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17296#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:20,529 INFO L273 TraceCheckUtils]: 88: Hoare triple {17296#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17296#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:20,530 INFO L273 TraceCheckUtils]: 89: Hoare triple {17296#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {17297#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:20,531 INFO L273 TraceCheckUtils]: 90: Hoare triple {17297#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17297#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:20,531 INFO L273 TraceCheckUtils]: 91: Hoare triple {17297#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17297#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:20,532 INFO L273 TraceCheckUtils]: 92: Hoare triple {17297#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {17298#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:20,532 INFO L273 TraceCheckUtils]: 93: Hoare triple {17298#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17298#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:20,533 INFO L273 TraceCheckUtils]: 94: Hoare triple {17298#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17298#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:20,534 INFO L273 TraceCheckUtils]: 95: Hoare triple {17298#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {17299#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:20,534 INFO L273 TraceCheckUtils]: 96: Hoare triple {17299#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17299#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:20,535 INFO L273 TraceCheckUtils]: 97: Hoare triple {17299#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17299#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:20,535 INFO L273 TraceCheckUtils]: 98: Hoare triple {17299#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {17300#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:20,536 INFO L273 TraceCheckUtils]: 99: Hoare triple {17300#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17300#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:20,536 INFO L273 TraceCheckUtils]: 100: Hoare triple {17300#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {17300#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:20,537 INFO L273 TraceCheckUtils]: 101: Hoare triple {17300#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {17301#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:20,538 INFO L273 TraceCheckUtils]: 102: Hoare triple {17301#(<= main_~i~0 32)} assume !(~i~0 < 100000); {17268#false} is VALID [2018-11-23 11:56:20,538 INFO L273 TraceCheckUtils]: 103: Hoare triple {17268#false} havoc ~x~0;~x~0 := 0; {17268#false} is VALID [2018-11-23 11:56:20,538 INFO L273 TraceCheckUtils]: 104: Hoare triple {17268#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {17268#false} is VALID [2018-11-23 11:56:20,538 INFO L256 TraceCheckUtils]: 105: Hoare triple {17268#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {17268#false} is VALID [2018-11-23 11:56:20,539 INFO L273 TraceCheckUtils]: 106: Hoare triple {17268#false} ~cond := #in~cond; {17268#false} is VALID [2018-11-23 11:56:20,539 INFO L273 TraceCheckUtils]: 107: Hoare triple {17268#false} assume 0 == ~cond; {17268#false} is VALID [2018-11-23 11:56:20,539 INFO L273 TraceCheckUtils]: 108: Hoare triple {17268#false} assume !false; {17268#false} is VALID [2018-11-23 11:56:20,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:20,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:20,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-23 11:56:20,567 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 109 [2018-11-23 11:56:20,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:20,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 11:56:20,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:20,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 11:56:20,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 11:56:20,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 11:56:20,679 INFO L87 Difference]: Start difference. First operand 114 states and 147 transitions. Second operand 36 states. [2018-11-23 11:56:21,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:21,270 INFO L93 Difference]: Finished difference Result 130 states and 166 transitions. [2018-11-23 11:56:21,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 11:56:21,270 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 109 [2018-11-23 11:56:21,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:21,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:56:21,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 166 transitions. [2018-11-23 11:56:21,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:56:21,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 166 transitions. [2018-11-23 11:56:21,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 166 transitions. [2018-11-23 11:56:21,426 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:21,428 INFO L225 Difference]: With dead ends: 130 [2018-11-23 11:56:21,428 INFO L226 Difference]: Without dead ends: 119 [2018-11-23 11:56:21,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 11:56:21,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-23 11:56:21,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-11-23 11:56:21,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:21,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 117 states. [2018-11-23 11:56:21,458 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 117 states. [2018-11-23 11:56:21,458 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 117 states. [2018-11-23 11:56:21,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:21,460 INFO L93 Difference]: Finished difference Result 119 states and 154 transitions. [2018-11-23 11:56:21,460 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 154 transitions. [2018-11-23 11:56:21,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:21,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:21,460 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 119 states. [2018-11-23 11:56:21,460 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 119 states. [2018-11-23 11:56:21,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:21,462 INFO L93 Difference]: Finished difference Result 119 states and 154 transitions. [2018-11-23 11:56:21,462 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 154 transitions. [2018-11-23 11:56:21,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:21,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:21,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:21,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:21,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-23 11:56:21,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 151 transitions. [2018-11-23 11:56:21,465 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 151 transitions. Word has length 109 [2018-11-23 11:56:21,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:21,465 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 151 transitions. [2018-11-23 11:56:21,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 11:56:21,466 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 151 transitions. [2018-11-23 11:56:21,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-23 11:56:21,466 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:21,466 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:21,467 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:21,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:21,467 INFO L82 PathProgramCache]: Analyzing trace with hash 162349283, now seen corresponding path program 33 times [2018-11-23 11:56:21,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:21,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:21,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:21,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:21,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:22,113 INFO L256 TraceCheckUtils]: 0: Hoare triple {18199#true} call ULTIMATE.init(); {18199#true} is VALID [2018-11-23 11:56:22,113 INFO L273 TraceCheckUtils]: 1: Hoare triple {18199#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18199#true} is VALID [2018-11-23 11:56:22,113 INFO L273 TraceCheckUtils]: 2: Hoare triple {18199#true} assume true; {18199#true} is VALID [2018-11-23 11:56:22,113 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18199#true} {18199#true} #55#return; {18199#true} is VALID [2018-11-23 11:56:22,114 INFO L256 TraceCheckUtils]: 4: Hoare triple {18199#true} call #t~ret4 := main(); {18199#true} is VALID [2018-11-23 11:56:22,114 INFO L273 TraceCheckUtils]: 5: Hoare triple {18199#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {18201#(= main_~i~0 0)} is VALID [2018-11-23 11:56:22,115 INFO L273 TraceCheckUtils]: 6: Hoare triple {18201#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18201#(= main_~i~0 0)} is VALID [2018-11-23 11:56:22,115 INFO L273 TraceCheckUtils]: 7: Hoare triple {18201#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18201#(= main_~i~0 0)} is VALID [2018-11-23 11:56:22,116 INFO L273 TraceCheckUtils]: 8: Hoare triple {18201#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {18202#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:22,116 INFO L273 TraceCheckUtils]: 9: Hoare triple {18202#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18202#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:22,116 INFO L273 TraceCheckUtils]: 10: Hoare triple {18202#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18202#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:22,117 INFO L273 TraceCheckUtils]: 11: Hoare triple {18202#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {18203#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:22,117 INFO L273 TraceCheckUtils]: 12: Hoare triple {18203#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18203#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:22,117 INFO L273 TraceCheckUtils]: 13: Hoare triple {18203#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18203#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:22,118 INFO L273 TraceCheckUtils]: 14: Hoare triple {18203#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {18204#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:22,118 INFO L273 TraceCheckUtils]: 15: Hoare triple {18204#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18204#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:22,118 INFO L273 TraceCheckUtils]: 16: Hoare triple {18204#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18204#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:22,119 INFO L273 TraceCheckUtils]: 17: Hoare triple {18204#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {18205#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:22,119 INFO L273 TraceCheckUtils]: 18: Hoare triple {18205#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18205#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:22,120 INFO L273 TraceCheckUtils]: 19: Hoare triple {18205#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18205#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:22,121 INFO L273 TraceCheckUtils]: 20: Hoare triple {18205#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {18206#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:22,121 INFO L273 TraceCheckUtils]: 21: Hoare triple {18206#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18206#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:22,122 INFO L273 TraceCheckUtils]: 22: Hoare triple {18206#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18206#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:22,122 INFO L273 TraceCheckUtils]: 23: Hoare triple {18206#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {18207#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:22,123 INFO L273 TraceCheckUtils]: 24: Hoare triple {18207#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18207#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:22,123 INFO L273 TraceCheckUtils]: 25: Hoare triple {18207#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18207#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:22,124 INFO L273 TraceCheckUtils]: 26: Hoare triple {18207#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {18208#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:22,124 INFO L273 TraceCheckUtils]: 27: Hoare triple {18208#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18208#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:22,125 INFO L273 TraceCheckUtils]: 28: Hoare triple {18208#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18208#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:22,126 INFO L273 TraceCheckUtils]: 29: Hoare triple {18208#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {18209#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:22,126 INFO L273 TraceCheckUtils]: 30: Hoare triple {18209#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18209#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:22,127 INFO L273 TraceCheckUtils]: 31: Hoare triple {18209#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18209#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:22,127 INFO L273 TraceCheckUtils]: 32: Hoare triple {18209#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {18210#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:22,128 INFO L273 TraceCheckUtils]: 33: Hoare triple {18210#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18210#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:22,128 INFO L273 TraceCheckUtils]: 34: Hoare triple {18210#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18210#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:22,129 INFO L273 TraceCheckUtils]: 35: Hoare triple {18210#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {18211#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:22,130 INFO L273 TraceCheckUtils]: 36: Hoare triple {18211#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18211#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:22,130 INFO L273 TraceCheckUtils]: 37: Hoare triple {18211#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18211#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:22,131 INFO L273 TraceCheckUtils]: 38: Hoare triple {18211#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {18212#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:22,131 INFO L273 TraceCheckUtils]: 39: Hoare triple {18212#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18212#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:22,134 INFO L273 TraceCheckUtils]: 40: Hoare triple {18212#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18212#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:22,135 INFO L273 TraceCheckUtils]: 41: Hoare triple {18212#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {18213#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:22,135 INFO L273 TraceCheckUtils]: 42: Hoare triple {18213#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18213#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:22,135 INFO L273 TraceCheckUtils]: 43: Hoare triple {18213#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18213#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:22,136 INFO L273 TraceCheckUtils]: 44: Hoare triple {18213#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {18214#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:22,136 INFO L273 TraceCheckUtils]: 45: Hoare triple {18214#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18214#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:22,136 INFO L273 TraceCheckUtils]: 46: Hoare triple {18214#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18214#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:22,137 INFO L273 TraceCheckUtils]: 47: Hoare triple {18214#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {18215#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:22,137 INFO L273 TraceCheckUtils]: 48: Hoare triple {18215#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18215#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:22,138 INFO L273 TraceCheckUtils]: 49: Hoare triple {18215#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18215#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:22,138 INFO L273 TraceCheckUtils]: 50: Hoare triple {18215#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {18216#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:22,139 INFO L273 TraceCheckUtils]: 51: Hoare triple {18216#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18216#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:22,139 INFO L273 TraceCheckUtils]: 52: Hoare triple {18216#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18216#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:22,140 INFO L273 TraceCheckUtils]: 53: Hoare triple {18216#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {18217#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:22,141 INFO L273 TraceCheckUtils]: 54: Hoare triple {18217#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18217#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:22,141 INFO L273 TraceCheckUtils]: 55: Hoare triple {18217#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18217#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:22,142 INFO L273 TraceCheckUtils]: 56: Hoare triple {18217#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {18218#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:22,142 INFO L273 TraceCheckUtils]: 57: Hoare triple {18218#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18218#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:22,143 INFO L273 TraceCheckUtils]: 58: Hoare triple {18218#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18218#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:22,144 INFO L273 TraceCheckUtils]: 59: Hoare triple {18218#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {18219#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:22,144 INFO L273 TraceCheckUtils]: 60: Hoare triple {18219#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18219#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:22,145 INFO L273 TraceCheckUtils]: 61: Hoare triple {18219#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18219#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:22,145 INFO L273 TraceCheckUtils]: 62: Hoare triple {18219#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {18220#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:22,146 INFO L273 TraceCheckUtils]: 63: Hoare triple {18220#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18220#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:22,146 INFO L273 TraceCheckUtils]: 64: Hoare triple {18220#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18220#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:22,147 INFO L273 TraceCheckUtils]: 65: Hoare triple {18220#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {18221#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:22,147 INFO L273 TraceCheckUtils]: 66: Hoare triple {18221#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18221#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:22,148 INFO L273 TraceCheckUtils]: 67: Hoare triple {18221#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18221#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:22,149 INFO L273 TraceCheckUtils]: 68: Hoare triple {18221#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {18222#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:22,149 INFO L273 TraceCheckUtils]: 69: Hoare triple {18222#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18222#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:22,150 INFO L273 TraceCheckUtils]: 70: Hoare triple {18222#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18222#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:22,150 INFO L273 TraceCheckUtils]: 71: Hoare triple {18222#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {18223#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:22,151 INFO L273 TraceCheckUtils]: 72: Hoare triple {18223#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18223#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:22,151 INFO L273 TraceCheckUtils]: 73: Hoare triple {18223#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18223#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:22,152 INFO L273 TraceCheckUtils]: 74: Hoare triple {18223#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {18224#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:22,153 INFO L273 TraceCheckUtils]: 75: Hoare triple {18224#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18224#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:22,153 INFO L273 TraceCheckUtils]: 76: Hoare triple {18224#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18224#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:22,154 INFO L273 TraceCheckUtils]: 77: Hoare triple {18224#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {18225#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:22,154 INFO L273 TraceCheckUtils]: 78: Hoare triple {18225#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18225#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:22,155 INFO L273 TraceCheckUtils]: 79: Hoare triple {18225#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18225#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:22,155 INFO L273 TraceCheckUtils]: 80: Hoare triple {18225#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {18226#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:22,156 INFO L273 TraceCheckUtils]: 81: Hoare triple {18226#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18226#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:22,156 INFO L273 TraceCheckUtils]: 82: Hoare triple {18226#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18226#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:22,157 INFO L273 TraceCheckUtils]: 83: Hoare triple {18226#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {18227#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:22,158 INFO L273 TraceCheckUtils]: 84: Hoare triple {18227#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18227#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:22,158 INFO L273 TraceCheckUtils]: 85: Hoare triple {18227#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18227#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:22,159 INFO L273 TraceCheckUtils]: 86: Hoare triple {18227#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {18228#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:22,159 INFO L273 TraceCheckUtils]: 87: Hoare triple {18228#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18228#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:22,160 INFO L273 TraceCheckUtils]: 88: Hoare triple {18228#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18228#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:22,161 INFO L273 TraceCheckUtils]: 89: Hoare triple {18228#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {18229#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:22,161 INFO L273 TraceCheckUtils]: 90: Hoare triple {18229#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18229#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:22,162 INFO L273 TraceCheckUtils]: 91: Hoare triple {18229#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18229#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:22,162 INFO L273 TraceCheckUtils]: 92: Hoare triple {18229#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {18230#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:22,163 INFO L273 TraceCheckUtils]: 93: Hoare triple {18230#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18230#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:22,163 INFO L273 TraceCheckUtils]: 94: Hoare triple {18230#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18230#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:22,164 INFO L273 TraceCheckUtils]: 95: Hoare triple {18230#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {18231#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:22,164 INFO L273 TraceCheckUtils]: 96: Hoare triple {18231#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18231#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:22,165 INFO L273 TraceCheckUtils]: 97: Hoare triple {18231#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18231#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:22,166 INFO L273 TraceCheckUtils]: 98: Hoare triple {18231#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {18232#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:22,166 INFO L273 TraceCheckUtils]: 99: Hoare triple {18232#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18232#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:22,167 INFO L273 TraceCheckUtils]: 100: Hoare triple {18232#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18232#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:22,167 INFO L273 TraceCheckUtils]: 101: Hoare triple {18232#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {18233#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:22,168 INFO L273 TraceCheckUtils]: 102: Hoare triple {18233#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18233#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:22,168 INFO L273 TraceCheckUtils]: 103: Hoare triple {18233#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18233#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:22,169 INFO L273 TraceCheckUtils]: 104: Hoare triple {18233#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {18234#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:22,170 INFO L273 TraceCheckUtils]: 105: Hoare triple {18234#(<= main_~i~0 33)} assume !(~i~0 < 100000); {18200#false} is VALID [2018-11-23 11:56:22,170 INFO L273 TraceCheckUtils]: 106: Hoare triple {18200#false} havoc ~x~0;~x~0 := 0; {18200#false} is VALID [2018-11-23 11:56:22,170 INFO L273 TraceCheckUtils]: 107: Hoare triple {18200#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {18200#false} is VALID [2018-11-23 11:56:22,170 INFO L256 TraceCheckUtils]: 108: Hoare triple {18200#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {18200#false} is VALID [2018-11-23 11:56:22,171 INFO L273 TraceCheckUtils]: 109: Hoare triple {18200#false} ~cond := #in~cond; {18200#false} is VALID [2018-11-23 11:56:22,171 INFO L273 TraceCheckUtils]: 110: Hoare triple {18200#false} assume 0 == ~cond; {18200#false} is VALID [2018-11-23 11:56:22,171 INFO L273 TraceCheckUtils]: 111: Hoare triple {18200#false} assume !false; {18200#false} is VALID [2018-11-23 11:56:22,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:22,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:22,181 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:22,189 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:56:22,262 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-11-23 11:56:22,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:22,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:22,541 INFO L256 TraceCheckUtils]: 0: Hoare triple {18199#true} call ULTIMATE.init(); {18199#true} is VALID [2018-11-23 11:56:22,542 INFO L273 TraceCheckUtils]: 1: Hoare triple {18199#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18199#true} is VALID [2018-11-23 11:56:22,542 INFO L273 TraceCheckUtils]: 2: Hoare triple {18199#true} assume true; {18199#true} is VALID [2018-11-23 11:56:22,542 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18199#true} {18199#true} #55#return; {18199#true} is VALID [2018-11-23 11:56:22,542 INFO L256 TraceCheckUtils]: 4: Hoare triple {18199#true} call #t~ret4 := main(); {18199#true} is VALID [2018-11-23 11:56:22,543 INFO L273 TraceCheckUtils]: 5: Hoare triple {18199#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {18253#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:22,544 INFO L273 TraceCheckUtils]: 6: Hoare triple {18253#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18253#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:22,544 INFO L273 TraceCheckUtils]: 7: Hoare triple {18253#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18253#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:22,544 INFO L273 TraceCheckUtils]: 8: Hoare triple {18253#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {18202#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:22,545 INFO L273 TraceCheckUtils]: 9: Hoare triple {18202#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18202#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:22,545 INFO L273 TraceCheckUtils]: 10: Hoare triple {18202#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18202#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:22,545 INFO L273 TraceCheckUtils]: 11: Hoare triple {18202#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {18203#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:22,546 INFO L273 TraceCheckUtils]: 12: Hoare triple {18203#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18203#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:22,546 INFO L273 TraceCheckUtils]: 13: Hoare triple {18203#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18203#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:22,547 INFO L273 TraceCheckUtils]: 14: Hoare triple {18203#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {18204#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:22,548 INFO L273 TraceCheckUtils]: 15: Hoare triple {18204#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18204#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:22,548 INFO L273 TraceCheckUtils]: 16: Hoare triple {18204#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18204#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:22,549 INFO L273 TraceCheckUtils]: 17: Hoare triple {18204#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {18205#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:22,549 INFO L273 TraceCheckUtils]: 18: Hoare triple {18205#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18205#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:22,550 INFO L273 TraceCheckUtils]: 19: Hoare triple {18205#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18205#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:22,551 INFO L273 TraceCheckUtils]: 20: Hoare triple {18205#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {18206#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:22,551 INFO L273 TraceCheckUtils]: 21: Hoare triple {18206#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18206#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:22,552 INFO L273 TraceCheckUtils]: 22: Hoare triple {18206#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18206#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:22,552 INFO L273 TraceCheckUtils]: 23: Hoare triple {18206#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {18207#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:22,553 INFO L273 TraceCheckUtils]: 24: Hoare triple {18207#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18207#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:22,553 INFO L273 TraceCheckUtils]: 25: Hoare triple {18207#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18207#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:22,554 INFO L273 TraceCheckUtils]: 26: Hoare triple {18207#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {18208#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:22,554 INFO L273 TraceCheckUtils]: 27: Hoare triple {18208#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18208#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:22,555 INFO L273 TraceCheckUtils]: 28: Hoare triple {18208#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18208#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:22,556 INFO L273 TraceCheckUtils]: 29: Hoare triple {18208#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {18209#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:22,556 INFO L273 TraceCheckUtils]: 30: Hoare triple {18209#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18209#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:22,557 INFO L273 TraceCheckUtils]: 31: Hoare triple {18209#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18209#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:22,557 INFO L273 TraceCheckUtils]: 32: Hoare triple {18209#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {18210#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:22,558 INFO L273 TraceCheckUtils]: 33: Hoare triple {18210#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18210#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:22,558 INFO L273 TraceCheckUtils]: 34: Hoare triple {18210#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18210#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:22,559 INFO L273 TraceCheckUtils]: 35: Hoare triple {18210#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {18211#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:22,560 INFO L273 TraceCheckUtils]: 36: Hoare triple {18211#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18211#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:22,560 INFO L273 TraceCheckUtils]: 37: Hoare triple {18211#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18211#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:22,561 INFO L273 TraceCheckUtils]: 38: Hoare triple {18211#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {18212#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:22,561 INFO L273 TraceCheckUtils]: 39: Hoare triple {18212#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18212#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:22,562 INFO L273 TraceCheckUtils]: 40: Hoare triple {18212#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18212#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:22,562 INFO L273 TraceCheckUtils]: 41: Hoare triple {18212#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {18213#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:22,563 INFO L273 TraceCheckUtils]: 42: Hoare triple {18213#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18213#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:22,563 INFO L273 TraceCheckUtils]: 43: Hoare triple {18213#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18213#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:22,564 INFO L273 TraceCheckUtils]: 44: Hoare triple {18213#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {18214#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:22,565 INFO L273 TraceCheckUtils]: 45: Hoare triple {18214#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18214#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:22,565 INFO L273 TraceCheckUtils]: 46: Hoare triple {18214#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18214#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:22,566 INFO L273 TraceCheckUtils]: 47: Hoare triple {18214#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {18215#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:22,566 INFO L273 TraceCheckUtils]: 48: Hoare triple {18215#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18215#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:22,567 INFO L273 TraceCheckUtils]: 49: Hoare triple {18215#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18215#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:22,568 INFO L273 TraceCheckUtils]: 50: Hoare triple {18215#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {18216#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:22,568 INFO L273 TraceCheckUtils]: 51: Hoare triple {18216#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18216#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:22,569 INFO L273 TraceCheckUtils]: 52: Hoare triple {18216#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18216#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:22,569 INFO L273 TraceCheckUtils]: 53: Hoare triple {18216#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {18217#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:22,570 INFO L273 TraceCheckUtils]: 54: Hoare triple {18217#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18217#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:22,570 INFO L273 TraceCheckUtils]: 55: Hoare triple {18217#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18217#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:22,571 INFO L273 TraceCheckUtils]: 56: Hoare triple {18217#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {18218#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:22,572 INFO L273 TraceCheckUtils]: 57: Hoare triple {18218#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18218#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:22,572 INFO L273 TraceCheckUtils]: 58: Hoare triple {18218#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18218#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:22,573 INFO L273 TraceCheckUtils]: 59: Hoare triple {18218#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {18219#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:22,573 INFO L273 TraceCheckUtils]: 60: Hoare triple {18219#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18219#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:22,574 INFO L273 TraceCheckUtils]: 61: Hoare triple {18219#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18219#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:22,575 INFO L273 TraceCheckUtils]: 62: Hoare triple {18219#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {18220#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:22,575 INFO L273 TraceCheckUtils]: 63: Hoare triple {18220#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18220#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:22,576 INFO L273 TraceCheckUtils]: 64: Hoare triple {18220#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18220#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:22,576 INFO L273 TraceCheckUtils]: 65: Hoare triple {18220#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {18221#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:22,577 INFO L273 TraceCheckUtils]: 66: Hoare triple {18221#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18221#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:22,577 INFO L273 TraceCheckUtils]: 67: Hoare triple {18221#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18221#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:22,578 INFO L273 TraceCheckUtils]: 68: Hoare triple {18221#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {18222#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:22,578 INFO L273 TraceCheckUtils]: 69: Hoare triple {18222#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18222#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:22,579 INFO L273 TraceCheckUtils]: 70: Hoare triple {18222#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18222#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:22,580 INFO L273 TraceCheckUtils]: 71: Hoare triple {18222#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {18223#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:22,580 INFO L273 TraceCheckUtils]: 72: Hoare triple {18223#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18223#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:22,581 INFO L273 TraceCheckUtils]: 73: Hoare triple {18223#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18223#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:22,581 INFO L273 TraceCheckUtils]: 74: Hoare triple {18223#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {18224#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:22,582 INFO L273 TraceCheckUtils]: 75: Hoare triple {18224#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18224#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:22,582 INFO L273 TraceCheckUtils]: 76: Hoare triple {18224#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18224#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:22,583 INFO L273 TraceCheckUtils]: 77: Hoare triple {18224#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {18225#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:22,584 INFO L273 TraceCheckUtils]: 78: Hoare triple {18225#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18225#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:22,584 INFO L273 TraceCheckUtils]: 79: Hoare triple {18225#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18225#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:22,585 INFO L273 TraceCheckUtils]: 80: Hoare triple {18225#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {18226#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:22,585 INFO L273 TraceCheckUtils]: 81: Hoare triple {18226#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18226#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:22,586 INFO L273 TraceCheckUtils]: 82: Hoare triple {18226#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18226#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:22,586 INFO L273 TraceCheckUtils]: 83: Hoare triple {18226#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {18227#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:22,587 INFO L273 TraceCheckUtils]: 84: Hoare triple {18227#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18227#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:22,587 INFO L273 TraceCheckUtils]: 85: Hoare triple {18227#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18227#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:22,588 INFO L273 TraceCheckUtils]: 86: Hoare triple {18227#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {18228#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:22,589 INFO L273 TraceCheckUtils]: 87: Hoare triple {18228#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18228#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:22,589 INFO L273 TraceCheckUtils]: 88: Hoare triple {18228#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18228#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:22,590 INFO L273 TraceCheckUtils]: 89: Hoare triple {18228#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {18229#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:22,590 INFO L273 TraceCheckUtils]: 90: Hoare triple {18229#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18229#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:22,591 INFO L273 TraceCheckUtils]: 91: Hoare triple {18229#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18229#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:22,592 INFO L273 TraceCheckUtils]: 92: Hoare triple {18229#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {18230#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:22,592 INFO L273 TraceCheckUtils]: 93: Hoare triple {18230#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18230#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:22,593 INFO L273 TraceCheckUtils]: 94: Hoare triple {18230#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18230#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:22,593 INFO L273 TraceCheckUtils]: 95: Hoare triple {18230#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {18231#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:22,594 INFO L273 TraceCheckUtils]: 96: Hoare triple {18231#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18231#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:22,594 INFO L273 TraceCheckUtils]: 97: Hoare triple {18231#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18231#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:22,595 INFO L273 TraceCheckUtils]: 98: Hoare triple {18231#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {18232#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:22,596 INFO L273 TraceCheckUtils]: 99: Hoare triple {18232#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18232#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:22,596 INFO L273 TraceCheckUtils]: 100: Hoare triple {18232#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18232#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:22,597 INFO L273 TraceCheckUtils]: 101: Hoare triple {18232#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {18233#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:22,597 INFO L273 TraceCheckUtils]: 102: Hoare triple {18233#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18233#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:22,598 INFO L273 TraceCheckUtils]: 103: Hoare triple {18233#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {18233#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:22,598 INFO L273 TraceCheckUtils]: 104: Hoare triple {18233#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {18234#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:22,599 INFO L273 TraceCheckUtils]: 105: Hoare triple {18234#(<= main_~i~0 33)} assume !(~i~0 < 100000); {18200#false} is VALID [2018-11-23 11:56:22,599 INFO L273 TraceCheckUtils]: 106: Hoare triple {18200#false} havoc ~x~0;~x~0 := 0; {18200#false} is VALID [2018-11-23 11:56:22,600 INFO L273 TraceCheckUtils]: 107: Hoare triple {18200#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {18200#false} is VALID [2018-11-23 11:56:22,600 INFO L256 TraceCheckUtils]: 108: Hoare triple {18200#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {18200#false} is VALID [2018-11-23 11:56:22,600 INFO L273 TraceCheckUtils]: 109: Hoare triple {18200#false} ~cond := #in~cond; {18200#false} is VALID [2018-11-23 11:56:22,600 INFO L273 TraceCheckUtils]: 110: Hoare triple {18200#false} assume 0 == ~cond; {18200#false} is VALID [2018-11-23 11:56:22,600 INFO L273 TraceCheckUtils]: 111: Hoare triple {18200#false} assume !false; {18200#false} is VALID [2018-11-23 11:56:22,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:22,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:22,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-11-23 11:56:22,629 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 112 [2018-11-23 11:56:22,630 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:22,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-23 11:56:22,742 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:22,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-23 11:56:22,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 11:56:22,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 11:56:22,743 INFO L87 Difference]: Start difference. First operand 117 states and 151 transitions. Second operand 37 states. [2018-11-23 11:56:23,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:23,518 INFO L93 Difference]: Finished difference Result 133 states and 170 transitions. [2018-11-23 11:56:23,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 11:56:23,518 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 112 [2018-11-23 11:56:23,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:23,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 11:56:23,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 170 transitions. [2018-11-23 11:56:23,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 11:56:23,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 170 transitions. [2018-11-23 11:56:23,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 170 transitions. [2018-11-23 11:56:23,681 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:23,683 INFO L225 Difference]: With dead ends: 133 [2018-11-23 11:56:23,683 INFO L226 Difference]: Without dead ends: 122 [2018-11-23 11:56:23,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 11:56:23,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-23 11:56:23,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-11-23 11:56:23,721 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:23,721 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 120 states. [2018-11-23 11:56:23,721 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 120 states. [2018-11-23 11:56:23,721 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 120 states. [2018-11-23 11:56:23,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:23,724 INFO L93 Difference]: Finished difference Result 122 states and 158 transitions. [2018-11-23 11:56:23,724 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 158 transitions. [2018-11-23 11:56:23,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:23,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:23,725 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 122 states. [2018-11-23 11:56:23,725 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 122 states. [2018-11-23 11:56:23,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:23,727 INFO L93 Difference]: Finished difference Result 122 states and 158 transitions. [2018-11-23 11:56:23,727 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 158 transitions. [2018-11-23 11:56:23,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:23,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:23,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:23,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:23,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-23 11:56:23,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 155 transitions. [2018-11-23 11:56:23,730 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 155 transitions. Word has length 112 [2018-11-23 11:56:23,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:23,730 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 155 transitions. [2018-11-23 11:56:23,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-23 11:56:23,730 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 155 transitions. [2018-11-23 11:56:23,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-23 11:56:23,731 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:23,731 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:23,732 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:23,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:23,732 INFO L82 PathProgramCache]: Analyzing trace with hash -540319623, now seen corresponding path program 34 times [2018-11-23 11:56:23,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:23,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:23,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:23,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:23,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:25,582 INFO L256 TraceCheckUtils]: 0: Hoare triple {19155#true} call ULTIMATE.init(); {19155#true} is VALID [2018-11-23 11:56:25,582 INFO L273 TraceCheckUtils]: 1: Hoare triple {19155#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19155#true} is VALID [2018-11-23 11:56:25,583 INFO L273 TraceCheckUtils]: 2: Hoare triple {19155#true} assume true; {19155#true} is VALID [2018-11-23 11:56:25,583 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19155#true} {19155#true} #55#return; {19155#true} is VALID [2018-11-23 11:56:25,583 INFO L256 TraceCheckUtils]: 4: Hoare triple {19155#true} call #t~ret4 := main(); {19155#true} is VALID [2018-11-23 11:56:25,583 INFO L273 TraceCheckUtils]: 5: Hoare triple {19155#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {19157#(= main_~i~0 0)} is VALID [2018-11-23 11:56:25,584 INFO L273 TraceCheckUtils]: 6: Hoare triple {19157#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19157#(= main_~i~0 0)} is VALID [2018-11-23 11:56:25,584 INFO L273 TraceCheckUtils]: 7: Hoare triple {19157#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19157#(= main_~i~0 0)} is VALID [2018-11-23 11:56:25,584 INFO L273 TraceCheckUtils]: 8: Hoare triple {19157#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {19158#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:25,585 INFO L273 TraceCheckUtils]: 9: Hoare triple {19158#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19158#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:25,585 INFO L273 TraceCheckUtils]: 10: Hoare triple {19158#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19158#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:25,586 INFO L273 TraceCheckUtils]: 11: Hoare triple {19158#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {19159#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:25,586 INFO L273 TraceCheckUtils]: 12: Hoare triple {19159#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19159#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:25,587 INFO L273 TraceCheckUtils]: 13: Hoare triple {19159#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19159#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:25,587 INFO L273 TraceCheckUtils]: 14: Hoare triple {19159#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {19160#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:25,588 INFO L273 TraceCheckUtils]: 15: Hoare triple {19160#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19160#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:25,588 INFO L273 TraceCheckUtils]: 16: Hoare triple {19160#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19160#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:25,589 INFO L273 TraceCheckUtils]: 17: Hoare triple {19160#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {19161#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:25,590 INFO L273 TraceCheckUtils]: 18: Hoare triple {19161#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19161#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:25,590 INFO L273 TraceCheckUtils]: 19: Hoare triple {19161#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19161#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:25,591 INFO L273 TraceCheckUtils]: 20: Hoare triple {19161#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {19162#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:25,591 INFO L273 TraceCheckUtils]: 21: Hoare triple {19162#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19162#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:25,592 INFO L273 TraceCheckUtils]: 22: Hoare triple {19162#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19162#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:25,593 INFO L273 TraceCheckUtils]: 23: Hoare triple {19162#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {19163#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:25,593 INFO L273 TraceCheckUtils]: 24: Hoare triple {19163#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19163#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:25,594 INFO L273 TraceCheckUtils]: 25: Hoare triple {19163#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19163#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:25,594 INFO L273 TraceCheckUtils]: 26: Hoare triple {19163#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {19164#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:25,595 INFO L273 TraceCheckUtils]: 27: Hoare triple {19164#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19164#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:25,595 INFO L273 TraceCheckUtils]: 28: Hoare triple {19164#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19164#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:25,596 INFO L273 TraceCheckUtils]: 29: Hoare triple {19164#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {19165#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:25,597 INFO L273 TraceCheckUtils]: 30: Hoare triple {19165#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19165#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:25,597 INFO L273 TraceCheckUtils]: 31: Hoare triple {19165#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19165#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:25,598 INFO L273 TraceCheckUtils]: 32: Hoare triple {19165#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {19166#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:25,598 INFO L273 TraceCheckUtils]: 33: Hoare triple {19166#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19166#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:25,599 INFO L273 TraceCheckUtils]: 34: Hoare triple {19166#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19166#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:25,599 INFO L273 TraceCheckUtils]: 35: Hoare triple {19166#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {19167#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:25,600 INFO L273 TraceCheckUtils]: 36: Hoare triple {19167#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19167#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:25,600 INFO L273 TraceCheckUtils]: 37: Hoare triple {19167#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19167#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:25,601 INFO L273 TraceCheckUtils]: 38: Hoare triple {19167#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {19168#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:25,602 INFO L273 TraceCheckUtils]: 39: Hoare triple {19168#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19168#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:25,602 INFO L273 TraceCheckUtils]: 40: Hoare triple {19168#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19168#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:25,603 INFO L273 TraceCheckUtils]: 41: Hoare triple {19168#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {19169#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:25,603 INFO L273 TraceCheckUtils]: 42: Hoare triple {19169#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19169#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:25,604 INFO L273 TraceCheckUtils]: 43: Hoare triple {19169#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19169#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:25,605 INFO L273 TraceCheckUtils]: 44: Hoare triple {19169#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {19170#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:25,605 INFO L273 TraceCheckUtils]: 45: Hoare triple {19170#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19170#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:25,606 INFO L273 TraceCheckUtils]: 46: Hoare triple {19170#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19170#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:25,606 INFO L273 TraceCheckUtils]: 47: Hoare triple {19170#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {19171#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:25,607 INFO L273 TraceCheckUtils]: 48: Hoare triple {19171#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19171#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:25,607 INFO L273 TraceCheckUtils]: 49: Hoare triple {19171#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19171#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:25,608 INFO L273 TraceCheckUtils]: 50: Hoare triple {19171#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {19172#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:25,609 INFO L273 TraceCheckUtils]: 51: Hoare triple {19172#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19172#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:25,609 INFO L273 TraceCheckUtils]: 52: Hoare triple {19172#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19172#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:25,610 INFO L273 TraceCheckUtils]: 53: Hoare triple {19172#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {19173#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:25,610 INFO L273 TraceCheckUtils]: 54: Hoare triple {19173#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19173#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:25,611 INFO L273 TraceCheckUtils]: 55: Hoare triple {19173#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19173#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:25,612 INFO L273 TraceCheckUtils]: 56: Hoare triple {19173#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {19174#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:25,612 INFO L273 TraceCheckUtils]: 57: Hoare triple {19174#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19174#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:25,613 INFO L273 TraceCheckUtils]: 58: Hoare triple {19174#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19174#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:25,613 INFO L273 TraceCheckUtils]: 59: Hoare triple {19174#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {19175#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:25,614 INFO L273 TraceCheckUtils]: 60: Hoare triple {19175#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19175#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:25,614 INFO L273 TraceCheckUtils]: 61: Hoare triple {19175#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19175#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:25,615 INFO L273 TraceCheckUtils]: 62: Hoare triple {19175#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {19176#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:25,615 INFO L273 TraceCheckUtils]: 63: Hoare triple {19176#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19176#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:25,616 INFO L273 TraceCheckUtils]: 64: Hoare triple {19176#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19176#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:25,617 INFO L273 TraceCheckUtils]: 65: Hoare triple {19176#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {19177#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:25,617 INFO L273 TraceCheckUtils]: 66: Hoare triple {19177#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19177#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:25,618 INFO L273 TraceCheckUtils]: 67: Hoare triple {19177#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19177#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:25,618 INFO L273 TraceCheckUtils]: 68: Hoare triple {19177#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {19178#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:25,619 INFO L273 TraceCheckUtils]: 69: Hoare triple {19178#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19178#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:25,619 INFO L273 TraceCheckUtils]: 70: Hoare triple {19178#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19178#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:25,620 INFO L273 TraceCheckUtils]: 71: Hoare triple {19178#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {19179#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:25,621 INFO L273 TraceCheckUtils]: 72: Hoare triple {19179#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19179#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:25,621 INFO L273 TraceCheckUtils]: 73: Hoare triple {19179#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19179#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:25,622 INFO L273 TraceCheckUtils]: 74: Hoare triple {19179#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {19180#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:25,622 INFO L273 TraceCheckUtils]: 75: Hoare triple {19180#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19180#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:25,623 INFO L273 TraceCheckUtils]: 76: Hoare triple {19180#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19180#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:25,623 INFO L273 TraceCheckUtils]: 77: Hoare triple {19180#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {19181#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:25,624 INFO L273 TraceCheckUtils]: 78: Hoare triple {19181#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19181#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:25,624 INFO L273 TraceCheckUtils]: 79: Hoare triple {19181#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19181#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:25,625 INFO L273 TraceCheckUtils]: 80: Hoare triple {19181#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {19182#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:25,626 INFO L273 TraceCheckUtils]: 81: Hoare triple {19182#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19182#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:25,626 INFO L273 TraceCheckUtils]: 82: Hoare triple {19182#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19182#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:25,627 INFO L273 TraceCheckUtils]: 83: Hoare triple {19182#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {19183#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:25,627 INFO L273 TraceCheckUtils]: 84: Hoare triple {19183#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19183#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:25,628 INFO L273 TraceCheckUtils]: 85: Hoare triple {19183#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19183#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:25,629 INFO L273 TraceCheckUtils]: 86: Hoare triple {19183#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {19184#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:25,629 INFO L273 TraceCheckUtils]: 87: Hoare triple {19184#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19184#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:25,630 INFO L273 TraceCheckUtils]: 88: Hoare triple {19184#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19184#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:25,630 INFO L273 TraceCheckUtils]: 89: Hoare triple {19184#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {19185#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:25,631 INFO L273 TraceCheckUtils]: 90: Hoare triple {19185#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19185#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:25,631 INFO L273 TraceCheckUtils]: 91: Hoare triple {19185#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19185#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:25,632 INFO L273 TraceCheckUtils]: 92: Hoare triple {19185#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {19186#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:25,633 INFO L273 TraceCheckUtils]: 93: Hoare triple {19186#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19186#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:25,633 INFO L273 TraceCheckUtils]: 94: Hoare triple {19186#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19186#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:25,634 INFO L273 TraceCheckUtils]: 95: Hoare triple {19186#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {19187#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:25,634 INFO L273 TraceCheckUtils]: 96: Hoare triple {19187#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19187#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:25,635 INFO L273 TraceCheckUtils]: 97: Hoare triple {19187#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19187#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:25,635 INFO L273 TraceCheckUtils]: 98: Hoare triple {19187#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {19188#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:25,636 INFO L273 TraceCheckUtils]: 99: Hoare triple {19188#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19188#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:25,636 INFO L273 TraceCheckUtils]: 100: Hoare triple {19188#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19188#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:25,637 INFO L273 TraceCheckUtils]: 101: Hoare triple {19188#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {19189#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:25,638 INFO L273 TraceCheckUtils]: 102: Hoare triple {19189#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19189#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:25,638 INFO L273 TraceCheckUtils]: 103: Hoare triple {19189#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19189#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:25,639 INFO L273 TraceCheckUtils]: 104: Hoare triple {19189#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {19190#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:25,639 INFO L273 TraceCheckUtils]: 105: Hoare triple {19190#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19190#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:25,640 INFO L273 TraceCheckUtils]: 106: Hoare triple {19190#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19190#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:25,641 INFO L273 TraceCheckUtils]: 107: Hoare triple {19190#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {19191#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:25,641 INFO L273 TraceCheckUtils]: 108: Hoare triple {19191#(<= main_~i~0 34)} assume !(~i~0 < 100000); {19156#false} is VALID [2018-11-23 11:56:25,642 INFO L273 TraceCheckUtils]: 109: Hoare triple {19156#false} havoc ~x~0;~x~0 := 0; {19156#false} is VALID [2018-11-23 11:56:25,642 INFO L273 TraceCheckUtils]: 110: Hoare triple {19156#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {19156#false} is VALID [2018-11-23 11:56:25,642 INFO L256 TraceCheckUtils]: 111: Hoare triple {19156#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {19156#false} is VALID [2018-11-23 11:56:25,642 INFO L273 TraceCheckUtils]: 112: Hoare triple {19156#false} ~cond := #in~cond; {19156#false} is VALID [2018-11-23 11:56:25,642 INFO L273 TraceCheckUtils]: 113: Hoare triple {19156#false} assume 0 == ~cond; {19156#false} is VALID [2018-11-23 11:56:25,642 INFO L273 TraceCheckUtils]: 114: Hoare triple {19156#false} assume !false; {19156#false} is VALID [2018-11-23 11:56:25,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:25,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:25,653 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:25,661 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:56:25,714 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:56:25,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:25,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:26,043 INFO L256 TraceCheckUtils]: 0: Hoare triple {19155#true} call ULTIMATE.init(); {19155#true} is VALID [2018-11-23 11:56:26,043 INFO L273 TraceCheckUtils]: 1: Hoare triple {19155#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19155#true} is VALID [2018-11-23 11:56:26,043 INFO L273 TraceCheckUtils]: 2: Hoare triple {19155#true} assume true; {19155#true} is VALID [2018-11-23 11:56:26,044 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19155#true} {19155#true} #55#return; {19155#true} is VALID [2018-11-23 11:56:26,044 INFO L256 TraceCheckUtils]: 4: Hoare triple {19155#true} call #t~ret4 := main(); {19155#true} is VALID [2018-11-23 11:56:26,045 INFO L273 TraceCheckUtils]: 5: Hoare triple {19155#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {19210#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:26,045 INFO L273 TraceCheckUtils]: 6: Hoare triple {19210#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19210#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:26,045 INFO L273 TraceCheckUtils]: 7: Hoare triple {19210#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19210#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:26,046 INFO L273 TraceCheckUtils]: 8: Hoare triple {19210#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {19158#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:26,046 INFO L273 TraceCheckUtils]: 9: Hoare triple {19158#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19158#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:26,047 INFO L273 TraceCheckUtils]: 10: Hoare triple {19158#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19158#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:26,047 INFO L273 TraceCheckUtils]: 11: Hoare triple {19158#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {19159#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:26,047 INFO L273 TraceCheckUtils]: 12: Hoare triple {19159#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19159#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:26,048 INFO L273 TraceCheckUtils]: 13: Hoare triple {19159#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19159#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:26,048 INFO L273 TraceCheckUtils]: 14: Hoare triple {19159#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {19160#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:26,048 INFO L273 TraceCheckUtils]: 15: Hoare triple {19160#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19160#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:26,049 INFO L273 TraceCheckUtils]: 16: Hoare triple {19160#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19160#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:26,050 INFO L273 TraceCheckUtils]: 17: Hoare triple {19160#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {19161#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:26,050 INFO L273 TraceCheckUtils]: 18: Hoare triple {19161#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19161#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:26,051 INFO L273 TraceCheckUtils]: 19: Hoare triple {19161#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19161#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:26,051 INFO L273 TraceCheckUtils]: 20: Hoare triple {19161#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {19162#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:26,052 INFO L273 TraceCheckUtils]: 21: Hoare triple {19162#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19162#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:26,052 INFO L273 TraceCheckUtils]: 22: Hoare triple {19162#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19162#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:26,053 INFO L273 TraceCheckUtils]: 23: Hoare triple {19162#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {19163#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:26,054 INFO L273 TraceCheckUtils]: 24: Hoare triple {19163#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19163#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:26,054 INFO L273 TraceCheckUtils]: 25: Hoare triple {19163#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19163#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:26,055 INFO L273 TraceCheckUtils]: 26: Hoare triple {19163#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {19164#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:26,055 INFO L273 TraceCheckUtils]: 27: Hoare triple {19164#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19164#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:26,056 INFO L273 TraceCheckUtils]: 28: Hoare triple {19164#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19164#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:26,057 INFO L273 TraceCheckUtils]: 29: Hoare triple {19164#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {19165#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:26,057 INFO L273 TraceCheckUtils]: 30: Hoare triple {19165#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19165#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:26,058 INFO L273 TraceCheckUtils]: 31: Hoare triple {19165#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19165#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:26,058 INFO L273 TraceCheckUtils]: 32: Hoare triple {19165#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {19166#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:26,059 INFO L273 TraceCheckUtils]: 33: Hoare triple {19166#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19166#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:26,059 INFO L273 TraceCheckUtils]: 34: Hoare triple {19166#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19166#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:26,060 INFO L273 TraceCheckUtils]: 35: Hoare triple {19166#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {19167#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:26,061 INFO L273 TraceCheckUtils]: 36: Hoare triple {19167#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19167#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:26,061 INFO L273 TraceCheckUtils]: 37: Hoare triple {19167#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19167#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:26,062 INFO L273 TraceCheckUtils]: 38: Hoare triple {19167#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {19168#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:26,062 INFO L273 TraceCheckUtils]: 39: Hoare triple {19168#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19168#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:26,063 INFO L273 TraceCheckUtils]: 40: Hoare triple {19168#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19168#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:26,064 INFO L273 TraceCheckUtils]: 41: Hoare triple {19168#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {19169#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:26,064 INFO L273 TraceCheckUtils]: 42: Hoare triple {19169#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19169#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:26,065 INFO L273 TraceCheckUtils]: 43: Hoare triple {19169#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19169#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:26,065 INFO L273 TraceCheckUtils]: 44: Hoare triple {19169#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {19170#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:26,066 INFO L273 TraceCheckUtils]: 45: Hoare triple {19170#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19170#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:26,066 INFO L273 TraceCheckUtils]: 46: Hoare triple {19170#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19170#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:26,067 INFO L273 TraceCheckUtils]: 47: Hoare triple {19170#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {19171#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:26,068 INFO L273 TraceCheckUtils]: 48: Hoare triple {19171#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19171#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:26,068 INFO L273 TraceCheckUtils]: 49: Hoare triple {19171#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19171#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:26,069 INFO L273 TraceCheckUtils]: 50: Hoare triple {19171#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {19172#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:26,069 INFO L273 TraceCheckUtils]: 51: Hoare triple {19172#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19172#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:26,070 INFO L273 TraceCheckUtils]: 52: Hoare triple {19172#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19172#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:26,071 INFO L273 TraceCheckUtils]: 53: Hoare triple {19172#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {19173#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:26,071 INFO L273 TraceCheckUtils]: 54: Hoare triple {19173#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19173#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:26,072 INFO L273 TraceCheckUtils]: 55: Hoare triple {19173#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19173#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:26,072 INFO L273 TraceCheckUtils]: 56: Hoare triple {19173#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {19174#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:26,073 INFO L273 TraceCheckUtils]: 57: Hoare triple {19174#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19174#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:26,073 INFO L273 TraceCheckUtils]: 58: Hoare triple {19174#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19174#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:26,074 INFO L273 TraceCheckUtils]: 59: Hoare triple {19174#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {19175#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:26,075 INFO L273 TraceCheckUtils]: 60: Hoare triple {19175#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19175#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:26,075 INFO L273 TraceCheckUtils]: 61: Hoare triple {19175#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19175#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:26,076 INFO L273 TraceCheckUtils]: 62: Hoare triple {19175#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {19176#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:26,076 INFO L273 TraceCheckUtils]: 63: Hoare triple {19176#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19176#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:26,077 INFO L273 TraceCheckUtils]: 64: Hoare triple {19176#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19176#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:26,077 INFO L273 TraceCheckUtils]: 65: Hoare triple {19176#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {19177#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:26,078 INFO L273 TraceCheckUtils]: 66: Hoare triple {19177#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19177#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:26,078 INFO L273 TraceCheckUtils]: 67: Hoare triple {19177#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19177#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:26,079 INFO L273 TraceCheckUtils]: 68: Hoare triple {19177#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {19178#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:26,080 INFO L273 TraceCheckUtils]: 69: Hoare triple {19178#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19178#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:26,080 INFO L273 TraceCheckUtils]: 70: Hoare triple {19178#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19178#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:26,081 INFO L273 TraceCheckUtils]: 71: Hoare triple {19178#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {19179#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:26,081 INFO L273 TraceCheckUtils]: 72: Hoare triple {19179#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19179#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:26,082 INFO L273 TraceCheckUtils]: 73: Hoare triple {19179#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19179#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:26,083 INFO L273 TraceCheckUtils]: 74: Hoare triple {19179#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {19180#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:26,083 INFO L273 TraceCheckUtils]: 75: Hoare triple {19180#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19180#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:26,084 INFO L273 TraceCheckUtils]: 76: Hoare triple {19180#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19180#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:26,084 INFO L273 TraceCheckUtils]: 77: Hoare triple {19180#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {19181#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:26,085 INFO L273 TraceCheckUtils]: 78: Hoare triple {19181#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19181#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:26,085 INFO L273 TraceCheckUtils]: 79: Hoare triple {19181#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19181#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:26,086 INFO L273 TraceCheckUtils]: 80: Hoare triple {19181#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {19182#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:26,087 INFO L273 TraceCheckUtils]: 81: Hoare triple {19182#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19182#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:26,087 INFO L273 TraceCheckUtils]: 82: Hoare triple {19182#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19182#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:26,088 INFO L273 TraceCheckUtils]: 83: Hoare triple {19182#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {19183#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:26,088 INFO L273 TraceCheckUtils]: 84: Hoare triple {19183#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19183#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:26,089 INFO L273 TraceCheckUtils]: 85: Hoare triple {19183#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19183#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:26,090 INFO L273 TraceCheckUtils]: 86: Hoare triple {19183#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {19184#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:26,090 INFO L273 TraceCheckUtils]: 87: Hoare triple {19184#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19184#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:26,091 INFO L273 TraceCheckUtils]: 88: Hoare triple {19184#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19184#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:26,091 INFO L273 TraceCheckUtils]: 89: Hoare triple {19184#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {19185#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:26,092 INFO L273 TraceCheckUtils]: 90: Hoare triple {19185#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19185#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:26,092 INFO L273 TraceCheckUtils]: 91: Hoare triple {19185#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19185#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:26,093 INFO L273 TraceCheckUtils]: 92: Hoare triple {19185#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {19186#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:26,093 INFO L273 TraceCheckUtils]: 93: Hoare triple {19186#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19186#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:26,094 INFO L273 TraceCheckUtils]: 94: Hoare triple {19186#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19186#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:26,095 INFO L273 TraceCheckUtils]: 95: Hoare triple {19186#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {19187#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:26,095 INFO L273 TraceCheckUtils]: 96: Hoare triple {19187#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19187#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:26,096 INFO L273 TraceCheckUtils]: 97: Hoare triple {19187#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19187#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:26,096 INFO L273 TraceCheckUtils]: 98: Hoare triple {19187#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {19188#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:26,097 INFO L273 TraceCheckUtils]: 99: Hoare triple {19188#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19188#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:26,097 INFO L273 TraceCheckUtils]: 100: Hoare triple {19188#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19188#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:26,098 INFO L273 TraceCheckUtils]: 101: Hoare triple {19188#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {19189#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:26,099 INFO L273 TraceCheckUtils]: 102: Hoare triple {19189#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19189#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:26,099 INFO L273 TraceCheckUtils]: 103: Hoare triple {19189#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19189#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:26,100 INFO L273 TraceCheckUtils]: 104: Hoare triple {19189#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {19190#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:26,100 INFO L273 TraceCheckUtils]: 105: Hoare triple {19190#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19190#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:26,101 INFO L273 TraceCheckUtils]: 106: Hoare triple {19190#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {19190#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:26,102 INFO L273 TraceCheckUtils]: 107: Hoare triple {19190#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {19191#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:26,102 INFO L273 TraceCheckUtils]: 108: Hoare triple {19191#(<= main_~i~0 34)} assume !(~i~0 < 100000); {19156#false} is VALID [2018-11-23 11:56:26,102 INFO L273 TraceCheckUtils]: 109: Hoare triple {19156#false} havoc ~x~0;~x~0 := 0; {19156#false} is VALID [2018-11-23 11:56:26,103 INFO L273 TraceCheckUtils]: 110: Hoare triple {19156#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {19156#false} is VALID [2018-11-23 11:56:26,103 INFO L256 TraceCheckUtils]: 111: Hoare triple {19156#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {19156#false} is VALID [2018-11-23 11:56:26,103 INFO L273 TraceCheckUtils]: 112: Hoare triple {19156#false} ~cond := #in~cond; {19156#false} is VALID [2018-11-23 11:56:26,103 INFO L273 TraceCheckUtils]: 113: Hoare triple {19156#false} assume 0 == ~cond; {19156#false} is VALID [2018-11-23 11:56:26,103 INFO L273 TraceCheckUtils]: 114: Hoare triple {19156#false} assume !false; {19156#false} is VALID [2018-11-23 11:56:26,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:26,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:26,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2018-11-23 11:56:26,133 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 115 [2018-11-23 11:56:26,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:26,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 11:56:26,247 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:26,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 11:56:26,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 11:56:26,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 11:56:26,248 INFO L87 Difference]: Start difference. First operand 120 states and 155 transitions. Second operand 38 states. [2018-11-23 11:56:26,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:26,972 INFO L93 Difference]: Finished difference Result 136 states and 174 transitions. [2018-11-23 11:56:26,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 11:56:26,973 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 115 [2018-11-23 11:56:26,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:26,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:56:26,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 174 transitions. [2018-11-23 11:56:26,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:56:26,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 174 transitions. [2018-11-23 11:56:26,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 174 transitions. [2018-11-23 11:56:27,395 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:27,398 INFO L225 Difference]: With dead ends: 136 [2018-11-23 11:56:27,398 INFO L226 Difference]: Without dead ends: 125 [2018-11-23 11:56:27,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 11:56:27,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-23 11:56:27,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-11-23 11:56:27,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:27,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 123 states. [2018-11-23 11:56:27,430 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 123 states. [2018-11-23 11:56:27,430 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 123 states. [2018-11-23 11:56:27,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:27,433 INFO L93 Difference]: Finished difference Result 125 states and 162 transitions. [2018-11-23 11:56:27,433 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 162 transitions. [2018-11-23 11:56:27,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:27,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:27,434 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 125 states. [2018-11-23 11:56:27,434 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 125 states. [2018-11-23 11:56:27,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:27,435 INFO L93 Difference]: Finished difference Result 125 states and 162 transitions. [2018-11-23 11:56:27,436 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 162 transitions. [2018-11-23 11:56:27,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:27,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:27,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:27,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:27,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-23 11:56:27,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 159 transitions. [2018-11-23 11:56:27,437 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 159 transitions. Word has length 115 [2018-11-23 11:56:27,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:27,438 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 159 transitions. [2018-11-23 11:56:27,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 11:56:27,438 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 159 transitions. [2018-11-23 11:56:27,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-23 11:56:27,438 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:27,439 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:27,439 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:27,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:27,439 INFO L82 PathProgramCache]: Analyzing trace with hash -79097565, now seen corresponding path program 35 times [2018-11-23 11:56:27,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:27,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:27,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:27,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:27,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:27,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:28,529 INFO L256 TraceCheckUtils]: 0: Hoare triple {20135#true} call ULTIMATE.init(); {20135#true} is VALID [2018-11-23 11:56:28,529 INFO L273 TraceCheckUtils]: 1: Hoare triple {20135#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20135#true} is VALID [2018-11-23 11:56:28,530 INFO L273 TraceCheckUtils]: 2: Hoare triple {20135#true} assume true; {20135#true} is VALID [2018-11-23 11:56:28,530 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20135#true} {20135#true} #55#return; {20135#true} is VALID [2018-11-23 11:56:28,530 INFO L256 TraceCheckUtils]: 4: Hoare triple {20135#true} call #t~ret4 := main(); {20135#true} is VALID [2018-11-23 11:56:28,530 INFO L273 TraceCheckUtils]: 5: Hoare triple {20135#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {20137#(= main_~i~0 0)} is VALID [2018-11-23 11:56:28,531 INFO L273 TraceCheckUtils]: 6: Hoare triple {20137#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20137#(= main_~i~0 0)} is VALID [2018-11-23 11:56:28,531 INFO L273 TraceCheckUtils]: 7: Hoare triple {20137#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20137#(= main_~i~0 0)} is VALID [2018-11-23 11:56:28,532 INFO L273 TraceCheckUtils]: 8: Hoare triple {20137#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {20138#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:28,532 INFO L273 TraceCheckUtils]: 9: Hoare triple {20138#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20138#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:28,533 INFO L273 TraceCheckUtils]: 10: Hoare triple {20138#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20138#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:28,534 INFO L273 TraceCheckUtils]: 11: Hoare triple {20138#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {20139#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:28,534 INFO L273 TraceCheckUtils]: 12: Hoare triple {20139#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20139#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:28,535 INFO L273 TraceCheckUtils]: 13: Hoare triple {20139#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20139#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:28,535 INFO L273 TraceCheckUtils]: 14: Hoare triple {20139#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {20140#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:28,536 INFO L273 TraceCheckUtils]: 15: Hoare triple {20140#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20140#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:28,536 INFO L273 TraceCheckUtils]: 16: Hoare triple {20140#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20140#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:28,537 INFO L273 TraceCheckUtils]: 17: Hoare triple {20140#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {20141#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:28,537 INFO L273 TraceCheckUtils]: 18: Hoare triple {20141#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20141#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:28,538 INFO L273 TraceCheckUtils]: 19: Hoare triple {20141#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20141#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:28,538 INFO L273 TraceCheckUtils]: 20: Hoare triple {20141#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {20142#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:28,539 INFO L273 TraceCheckUtils]: 21: Hoare triple {20142#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20142#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:28,539 INFO L273 TraceCheckUtils]: 22: Hoare triple {20142#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20142#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:28,540 INFO L273 TraceCheckUtils]: 23: Hoare triple {20142#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {20143#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:28,541 INFO L273 TraceCheckUtils]: 24: Hoare triple {20143#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20143#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:28,541 INFO L273 TraceCheckUtils]: 25: Hoare triple {20143#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20143#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:28,542 INFO L273 TraceCheckUtils]: 26: Hoare triple {20143#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {20144#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:28,542 INFO L273 TraceCheckUtils]: 27: Hoare triple {20144#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20144#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:28,543 INFO L273 TraceCheckUtils]: 28: Hoare triple {20144#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20144#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:28,543 INFO L273 TraceCheckUtils]: 29: Hoare triple {20144#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {20145#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:28,544 INFO L273 TraceCheckUtils]: 30: Hoare triple {20145#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20145#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:28,544 INFO L273 TraceCheckUtils]: 31: Hoare triple {20145#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20145#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:28,545 INFO L273 TraceCheckUtils]: 32: Hoare triple {20145#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {20146#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:28,545 INFO L273 TraceCheckUtils]: 33: Hoare triple {20146#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20146#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:28,546 INFO L273 TraceCheckUtils]: 34: Hoare triple {20146#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20146#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:28,546 INFO L273 TraceCheckUtils]: 35: Hoare triple {20146#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {20147#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:28,547 INFO L273 TraceCheckUtils]: 36: Hoare triple {20147#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20147#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:28,547 INFO L273 TraceCheckUtils]: 37: Hoare triple {20147#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20147#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:28,548 INFO L273 TraceCheckUtils]: 38: Hoare triple {20147#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {20148#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:28,549 INFO L273 TraceCheckUtils]: 39: Hoare triple {20148#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20148#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:28,549 INFO L273 TraceCheckUtils]: 40: Hoare triple {20148#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20148#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:28,550 INFO L273 TraceCheckUtils]: 41: Hoare triple {20148#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {20149#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:28,550 INFO L273 TraceCheckUtils]: 42: Hoare triple {20149#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20149#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:28,551 INFO L273 TraceCheckUtils]: 43: Hoare triple {20149#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20149#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:28,551 INFO L273 TraceCheckUtils]: 44: Hoare triple {20149#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {20150#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:28,552 INFO L273 TraceCheckUtils]: 45: Hoare triple {20150#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20150#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:28,552 INFO L273 TraceCheckUtils]: 46: Hoare triple {20150#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20150#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:28,553 INFO L273 TraceCheckUtils]: 47: Hoare triple {20150#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {20151#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:28,553 INFO L273 TraceCheckUtils]: 48: Hoare triple {20151#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20151#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:28,554 INFO L273 TraceCheckUtils]: 49: Hoare triple {20151#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20151#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:28,554 INFO L273 TraceCheckUtils]: 50: Hoare triple {20151#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {20152#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:28,555 INFO L273 TraceCheckUtils]: 51: Hoare triple {20152#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20152#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:28,555 INFO L273 TraceCheckUtils]: 52: Hoare triple {20152#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20152#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:28,556 INFO L273 TraceCheckUtils]: 53: Hoare triple {20152#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {20153#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:28,557 INFO L273 TraceCheckUtils]: 54: Hoare triple {20153#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20153#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:28,557 INFO L273 TraceCheckUtils]: 55: Hoare triple {20153#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20153#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:28,558 INFO L273 TraceCheckUtils]: 56: Hoare triple {20153#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {20154#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:28,558 INFO L273 TraceCheckUtils]: 57: Hoare triple {20154#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20154#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:28,559 INFO L273 TraceCheckUtils]: 58: Hoare triple {20154#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20154#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:28,559 INFO L273 TraceCheckUtils]: 59: Hoare triple {20154#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {20155#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:28,560 INFO L273 TraceCheckUtils]: 60: Hoare triple {20155#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20155#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:28,560 INFO L273 TraceCheckUtils]: 61: Hoare triple {20155#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20155#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:28,561 INFO L273 TraceCheckUtils]: 62: Hoare triple {20155#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {20156#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:28,561 INFO L273 TraceCheckUtils]: 63: Hoare triple {20156#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20156#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:28,562 INFO L273 TraceCheckUtils]: 64: Hoare triple {20156#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20156#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:28,563 INFO L273 TraceCheckUtils]: 65: Hoare triple {20156#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {20157#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:28,563 INFO L273 TraceCheckUtils]: 66: Hoare triple {20157#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20157#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:28,563 INFO L273 TraceCheckUtils]: 67: Hoare triple {20157#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20157#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:28,564 INFO L273 TraceCheckUtils]: 68: Hoare triple {20157#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {20158#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:28,565 INFO L273 TraceCheckUtils]: 69: Hoare triple {20158#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20158#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:28,565 INFO L273 TraceCheckUtils]: 70: Hoare triple {20158#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20158#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:28,566 INFO L273 TraceCheckUtils]: 71: Hoare triple {20158#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {20159#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:28,566 INFO L273 TraceCheckUtils]: 72: Hoare triple {20159#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20159#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:28,567 INFO L273 TraceCheckUtils]: 73: Hoare triple {20159#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20159#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:28,567 INFO L273 TraceCheckUtils]: 74: Hoare triple {20159#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {20160#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:28,568 INFO L273 TraceCheckUtils]: 75: Hoare triple {20160#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20160#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:28,568 INFO L273 TraceCheckUtils]: 76: Hoare triple {20160#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20160#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:28,569 INFO L273 TraceCheckUtils]: 77: Hoare triple {20160#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {20161#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:28,570 INFO L273 TraceCheckUtils]: 78: Hoare triple {20161#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20161#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:28,570 INFO L273 TraceCheckUtils]: 79: Hoare triple {20161#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20161#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:28,571 INFO L273 TraceCheckUtils]: 80: Hoare triple {20161#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {20162#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:28,571 INFO L273 TraceCheckUtils]: 81: Hoare triple {20162#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20162#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:28,572 INFO L273 TraceCheckUtils]: 82: Hoare triple {20162#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20162#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:28,573 INFO L273 TraceCheckUtils]: 83: Hoare triple {20162#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {20163#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:28,573 INFO L273 TraceCheckUtils]: 84: Hoare triple {20163#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20163#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:28,573 INFO L273 TraceCheckUtils]: 85: Hoare triple {20163#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20163#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:28,574 INFO L273 TraceCheckUtils]: 86: Hoare triple {20163#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {20164#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:28,575 INFO L273 TraceCheckUtils]: 87: Hoare triple {20164#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20164#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:28,575 INFO L273 TraceCheckUtils]: 88: Hoare triple {20164#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20164#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:28,576 INFO L273 TraceCheckUtils]: 89: Hoare triple {20164#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {20165#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:28,576 INFO L273 TraceCheckUtils]: 90: Hoare triple {20165#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20165#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:28,577 INFO L273 TraceCheckUtils]: 91: Hoare triple {20165#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20165#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:28,578 INFO L273 TraceCheckUtils]: 92: Hoare triple {20165#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {20166#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:28,578 INFO L273 TraceCheckUtils]: 93: Hoare triple {20166#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20166#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:28,579 INFO L273 TraceCheckUtils]: 94: Hoare triple {20166#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20166#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:28,579 INFO L273 TraceCheckUtils]: 95: Hoare triple {20166#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {20167#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:28,580 INFO L273 TraceCheckUtils]: 96: Hoare triple {20167#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20167#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:28,580 INFO L273 TraceCheckUtils]: 97: Hoare triple {20167#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20167#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:28,581 INFO L273 TraceCheckUtils]: 98: Hoare triple {20167#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {20168#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:28,582 INFO L273 TraceCheckUtils]: 99: Hoare triple {20168#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20168#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:28,582 INFO L273 TraceCheckUtils]: 100: Hoare triple {20168#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20168#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:28,583 INFO L273 TraceCheckUtils]: 101: Hoare triple {20168#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {20169#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:28,583 INFO L273 TraceCheckUtils]: 102: Hoare triple {20169#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20169#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:28,584 INFO L273 TraceCheckUtils]: 103: Hoare triple {20169#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20169#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:28,584 INFO L273 TraceCheckUtils]: 104: Hoare triple {20169#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {20170#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:28,585 INFO L273 TraceCheckUtils]: 105: Hoare triple {20170#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20170#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:28,585 INFO L273 TraceCheckUtils]: 106: Hoare triple {20170#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20170#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:28,586 INFO L273 TraceCheckUtils]: 107: Hoare triple {20170#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {20171#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:28,586 INFO L273 TraceCheckUtils]: 108: Hoare triple {20171#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20171#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:28,587 INFO L273 TraceCheckUtils]: 109: Hoare triple {20171#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20171#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:28,588 INFO L273 TraceCheckUtils]: 110: Hoare triple {20171#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {20172#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:28,588 INFO L273 TraceCheckUtils]: 111: Hoare triple {20172#(<= main_~i~0 35)} assume !(~i~0 < 100000); {20136#false} is VALID [2018-11-23 11:56:28,588 INFO L273 TraceCheckUtils]: 112: Hoare triple {20136#false} havoc ~x~0;~x~0 := 0; {20136#false} is VALID [2018-11-23 11:56:28,589 INFO L273 TraceCheckUtils]: 113: Hoare triple {20136#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {20136#false} is VALID [2018-11-23 11:56:28,589 INFO L256 TraceCheckUtils]: 114: Hoare triple {20136#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {20136#false} is VALID [2018-11-23 11:56:28,589 INFO L273 TraceCheckUtils]: 115: Hoare triple {20136#false} ~cond := #in~cond; {20136#false} is VALID [2018-11-23 11:56:28,589 INFO L273 TraceCheckUtils]: 116: Hoare triple {20136#false} assume 0 == ~cond; {20136#false} is VALID [2018-11-23 11:56:28,589 INFO L273 TraceCheckUtils]: 117: Hoare triple {20136#false} assume !false; {20136#false} is VALID [2018-11-23 11:56:28,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:28,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:28,599 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:28,607 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:56:28,682 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-11-23 11:56:28,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:28,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:28,961 INFO L256 TraceCheckUtils]: 0: Hoare triple {20135#true} call ULTIMATE.init(); {20135#true} is VALID [2018-11-23 11:56:28,961 INFO L273 TraceCheckUtils]: 1: Hoare triple {20135#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20135#true} is VALID [2018-11-23 11:56:28,961 INFO L273 TraceCheckUtils]: 2: Hoare triple {20135#true} assume true; {20135#true} is VALID [2018-11-23 11:56:28,962 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20135#true} {20135#true} #55#return; {20135#true} is VALID [2018-11-23 11:56:28,962 INFO L256 TraceCheckUtils]: 4: Hoare triple {20135#true} call #t~ret4 := main(); {20135#true} is VALID [2018-11-23 11:56:28,963 INFO L273 TraceCheckUtils]: 5: Hoare triple {20135#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {20191#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:28,963 INFO L273 TraceCheckUtils]: 6: Hoare triple {20191#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20191#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:28,964 INFO L273 TraceCheckUtils]: 7: Hoare triple {20191#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20191#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:28,964 INFO L273 TraceCheckUtils]: 8: Hoare triple {20191#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {20138#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:28,964 INFO L273 TraceCheckUtils]: 9: Hoare triple {20138#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20138#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:28,965 INFO L273 TraceCheckUtils]: 10: Hoare triple {20138#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20138#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:28,965 INFO L273 TraceCheckUtils]: 11: Hoare triple {20138#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {20139#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:28,965 INFO L273 TraceCheckUtils]: 12: Hoare triple {20139#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20139#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:28,966 INFO L273 TraceCheckUtils]: 13: Hoare triple {20139#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20139#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:28,966 INFO L273 TraceCheckUtils]: 14: Hoare triple {20139#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {20140#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:28,967 INFO L273 TraceCheckUtils]: 15: Hoare triple {20140#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20140#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:28,967 INFO L273 TraceCheckUtils]: 16: Hoare triple {20140#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20140#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:28,968 INFO L273 TraceCheckUtils]: 17: Hoare triple {20140#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {20141#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:28,969 INFO L273 TraceCheckUtils]: 18: Hoare triple {20141#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20141#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:28,969 INFO L273 TraceCheckUtils]: 19: Hoare triple {20141#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20141#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:28,970 INFO L273 TraceCheckUtils]: 20: Hoare triple {20141#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {20142#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:28,970 INFO L273 TraceCheckUtils]: 21: Hoare triple {20142#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20142#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:28,971 INFO L273 TraceCheckUtils]: 22: Hoare triple {20142#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20142#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:28,972 INFO L273 TraceCheckUtils]: 23: Hoare triple {20142#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {20143#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:28,972 INFO L273 TraceCheckUtils]: 24: Hoare triple {20143#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20143#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:28,973 INFO L273 TraceCheckUtils]: 25: Hoare triple {20143#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20143#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:28,973 INFO L273 TraceCheckUtils]: 26: Hoare triple {20143#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {20144#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:28,974 INFO L273 TraceCheckUtils]: 27: Hoare triple {20144#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20144#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:28,974 INFO L273 TraceCheckUtils]: 28: Hoare triple {20144#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20144#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:28,975 INFO L273 TraceCheckUtils]: 29: Hoare triple {20144#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {20145#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:28,976 INFO L273 TraceCheckUtils]: 30: Hoare triple {20145#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20145#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:28,976 INFO L273 TraceCheckUtils]: 31: Hoare triple {20145#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20145#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:28,977 INFO L273 TraceCheckUtils]: 32: Hoare triple {20145#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {20146#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:28,977 INFO L273 TraceCheckUtils]: 33: Hoare triple {20146#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20146#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:28,978 INFO L273 TraceCheckUtils]: 34: Hoare triple {20146#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20146#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:28,978 INFO L273 TraceCheckUtils]: 35: Hoare triple {20146#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {20147#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:28,979 INFO L273 TraceCheckUtils]: 36: Hoare triple {20147#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20147#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:28,979 INFO L273 TraceCheckUtils]: 37: Hoare triple {20147#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20147#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:28,980 INFO L273 TraceCheckUtils]: 38: Hoare triple {20147#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {20148#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:28,981 INFO L273 TraceCheckUtils]: 39: Hoare triple {20148#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20148#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:28,981 INFO L273 TraceCheckUtils]: 40: Hoare triple {20148#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20148#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:28,982 INFO L273 TraceCheckUtils]: 41: Hoare triple {20148#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {20149#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:28,982 INFO L273 TraceCheckUtils]: 42: Hoare triple {20149#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20149#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:28,983 INFO L273 TraceCheckUtils]: 43: Hoare triple {20149#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20149#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:28,984 INFO L273 TraceCheckUtils]: 44: Hoare triple {20149#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {20150#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:28,984 INFO L273 TraceCheckUtils]: 45: Hoare triple {20150#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20150#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:28,985 INFO L273 TraceCheckUtils]: 46: Hoare triple {20150#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20150#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:28,985 INFO L273 TraceCheckUtils]: 47: Hoare triple {20150#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {20151#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:28,986 INFO L273 TraceCheckUtils]: 48: Hoare triple {20151#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20151#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:28,986 INFO L273 TraceCheckUtils]: 49: Hoare triple {20151#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20151#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:28,987 INFO L273 TraceCheckUtils]: 50: Hoare triple {20151#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {20152#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:28,988 INFO L273 TraceCheckUtils]: 51: Hoare triple {20152#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20152#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:28,988 INFO L273 TraceCheckUtils]: 52: Hoare triple {20152#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20152#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:28,989 INFO L273 TraceCheckUtils]: 53: Hoare triple {20152#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {20153#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:28,989 INFO L273 TraceCheckUtils]: 54: Hoare triple {20153#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20153#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:28,990 INFO L273 TraceCheckUtils]: 55: Hoare triple {20153#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20153#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:28,990 INFO L273 TraceCheckUtils]: 56: Hoare triple {20153#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {20154#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:28,991 INFO L273 TraceCheckUtils]: 57: Hoare triple {20154#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20154#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:28,991 INFO L273 TraceCheckUtils]: 58: Hoare triple {20154#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20154#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:28,992 INFO L273 TraceCheckUtils]: 59: Hoare triple {20154#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {20155#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:28,993 INFO L273 TraceCheckUtils]: 60: Hoare triple {20155#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20155#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:28,993 INFO L273 TraceCheckUtils]: 61: Hoare triple {20155#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20155#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:28,994 INFO L273 TraceCheckUtils]: 62: Hoare triple {20155#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {20156#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:28,994 INFO L273 TraceCheckUtils]: 63: Hoare triple {20156#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20156#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:28,995 INFO L273 TraceCheckUtils]: 64: Hoare triple {20156#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20156#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:28,996 INFO L273 TraceCheckUtils]: 65: Hoare triple {20156#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {20157#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:28,996 INFO L273 TraceCheckUtils]: 66: Hoare triple {20157#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20157#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:28,997 INFO L273 TraceCheckUtils]: 67: Hoare triple {20157#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20157#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:28,997 INFO L273 TraceCheckUtils]: 68: Hoare triple {20157#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {20158#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:28,998 INFO L273 TraceCheckUtils]: 69: Hoare triple {20158#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20158#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:28,998 INFO L273 TraceCheckUtils]: 70: Hoare triple {20158#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20158#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:28,999 INFO L273 TraceCheckUtils]: 71: Hoare triple {20158#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {20159#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:29,000 INFO L273 TraceCheckUtils]: 72: Hoare triple {20159#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20159#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:29,000 INFO L273 TraceCheckUtils]: 73: Hoare triple {20159#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20159#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:29,001 INFO L273 TraceCheckUtils]: 74: Hoare triple {20159#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {20160#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:29,001 INFO L273 TraceCheckUtils]: 75: Hoare triple {20160#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20160#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:29,002 INFO L273 TraceCheckUtils]: 76: Hoare triple {20160#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20160#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:29,002 INFO L273 TraceCheckUtils]: 77: Hoare triple {20160#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {20161#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:29,003 INFO L273 TraceCheckUtils]: 78: Hoare triple {20161#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20161#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:29,003 INFO L273 TraceCheckUtils]: 79: Hoare triple {20161#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20161#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:29,004 INFO L273 TraceCheckUtils]: 80: Hoare triple {20161#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {20162#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:29,005 INFO L273 TraceCheckUtils]: 81: Hoare triple {20162#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20162#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:29,005 INFO L273 TraceCheckUtils]: 82: Hoare triple {20162#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20162#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:29,006 INFO L273 TraceCheckUtils]: 83: Hoare triple {20162#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {20163#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:29,007 INFO L273 TraceCheckUtils]: 84: Hoare triple {20163#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20163#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:29,007 INFO L273 TraceCheckUtils]: 85: Hoare triple {20163#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20163#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:29,008 INFO L273 TraceCheckUtils]: 86: Hoare triple {20163#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {20164#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:29,008 INFO L273 TraceCheckUtils]: 87: Hoare triple {20164#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20164#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:29,009 INFO L273 TraceCheckUtils]: 88: Hoare triple {20164#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20164#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:29,009 INFO L273 TraceCheckUtils]: 89: Hoare triple {20164#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {20165#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:29,010 INFO L273 TraceCheckUtils]: 90: Hoare triple {20165#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20165#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:29,010 INFO L273 TraceCheckUtils]: 91: Hoare triple {20165#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20165#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:29,011 INFO L273 TraceCheckUtils]: 92: Hoare triple {20165#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {20166#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:29,012 INFO L273 TraceCheckUtils]: 93: Hoare triple {20166#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20166#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:29,012 INFO L273 TraceCheckUtils]: 94: Hoare triple {20166#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20166#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:29,013 INFO L273 TraceCheckUtils]: 95: Hoare triple {20166#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {20167#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:29,013 INFO L273 TraceCheckUtils]: 96: Hoare triple {20167#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20167#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:29,014 INFO L273 TraceCheckUtils]: 97: Hoare triple {20167#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20167#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:29,015 INFO L273 TraceCheckUtils]: 98: Hoare triple {20167#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {20168#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:29,015 INFO L273 TraceCheckUtils]: 99: Hoare triple {20168#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20168#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:29,016 INFO L273 TraceCheckUtils]: 100: Hoare triple {20168#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20168#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:29,016 INFO L273 TraceCheckUtils]: 101: Hoare triple {20168#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {20169#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:29,017 INFO L273 TraceCheckUtils]: 102: Hoare triple {20169#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20169#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:29,017 INFO L273 TraceCheckUtils]: 103: Hoare triple {20169#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20169#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:29,018 INFO L273 TraceCheckUtils]: 104: Hoare triple {20169#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {20170#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:29,019 INFO L273 TraceCheckUtils]: 105: Hoare triple {20170#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20170#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:29,019 INFO L273 TraceCheckUtils]: 106: Hoare triple {20170#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20170#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:29,020 INFO L273 TraceCheckUtils]: 107: Hoare triple {20170#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {20171#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:29,020 INFO L273 TraceCheckUtils]: 108: Hoare triple {20171#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20171#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:29,021 INFO L273 TraceCheckUtils]: 109: Hoare triple {20171#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {20171#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:29,021 INFO L273 TraceCheckUtils]: 110: Hoare triple {20171#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {20172#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:29,022 INFO L273 TraceCheckUtils]: 111: Hoare triple {20172#(<= main_~i~0 35)} assume !(~i~0 < 100000); {20136#false} is VALID [2018-11-23 11:56:29,022 INFO L273 TraceCheckUtils]: 112: Hoare triple {20136#false} havoc ~x~0;~x~0 := 0; {20136#false} is VALID [2018-11-23 11:56:29,023 INFO L273 TraceCheckUtils]: 113: Hoare triple {20136#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {20136#false} is VALID [2018-11-23 11:56:29,023 INFO L256 TraceCheckUtils]: 114: Hoare triple {20136#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {20136#false} is VALID [2018-11-23 11:56:29,023 INFO L273 TraceCheckUtils]: 115: Hoare triple {20136#false} ~cond := #in~cond; {20136#false} is VALID [2018-11-23 11:56:29,023 INFO L273 TraceCheckUtils]: 116: Hoare triple {20136#false} assume 0 == ~cond; {20136#false} is VALID [2018-11-23 11:56:29,023 INFO L273 TraceCheckUtils]: 117: Hoare triple {20136#false} assume !false; {20136#false} is VALID [2018-11-23 11:56:29,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:29,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:29,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2018-11-23 11:56:29,054 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 118 [2018-11-23 11:56:29,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:29,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2018-11-23 11:56:29,199 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:29,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-23 11:56:29,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 11:56:29,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 11:56:29,200 INFO L87 Difference]: Start difference. First operand 123 states and 159 transitions. Second operand 39 states. [2018-11-23 11:56:29,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:29,933 INFO L93 Difference]: Finished difference Result 139 states and 178 transitions. [2018-11-23 11:56:29,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 11:56:29,933 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 118 [2018-11-23 11:56:29,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:29,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 11:56:29,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 178 transitions. [2018-11-23 11:56:29,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 11:56:29,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 178 transitions. [2018-11-23 11:56:29,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 178 transitions. [2018-11-23 11:56:30,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:30,125 INFO L225 Difference]: With dead ends: 139 [2018-11-23 11:56:30,125 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 11:56:30,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 11:56:30,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 11:56:30,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-11-23 11:56:30,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:30,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 126 states. [2018-11-23 11:56:30,477 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 126 states. [2018-11-23 11:56:30,477 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 126 states. [2018-11-23 11:56:30,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:30,479 INFO L93 Difference]: Finished difference Result 128 states and 166 transitions. [2018-11-23 11:56:30,479 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 166 transitions. [2018-11-23 11:56:30,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:30,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:30,479 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 128 states. [2018-11-23 11:56:30,479 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 128 states. [2018-11-23 11:56:30,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:30,481 INFO L93 Difference]: Finished difference Result 128 states and 166 transitions. [2018-11-23 11:56:30,481 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 166 transitions. [2018-11-23 11:56:30,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:30,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:30,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:30,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:30,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-23 11:56:30,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 163 transitions. [2018-11-23 11:56:30,484 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 163 transitions. Word has length 118 [2018-11-23 11:56:30,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:30,484 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 163 transitions. [2018-11-23 11:56:30,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-23 11:56:30,485 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 163 transitions. [2018-11-23 11:56:30,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-23 11:56:30,485 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:30,485 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:30,486 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:30,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:30,486 INFO L82 PathProgramCache]: Analyzing trace with hash 586852409, now seen corresponding path program 36 times [2018-11-23 11:56:30,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:30,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:30,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:30,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:30,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:31,324 INFO L256 TraceCheckUtils]: 0: Hoare triple {21139#true} call ULTIMATE.init(); {21139#true} is VALID [2018-11-23 11:56:31,324 INFO L273 TraceCheckUtils]: 1: Hoare triple {21139#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21139#true} is VALID [2018-11-23 11:56:31,325 INFO L273 TraceCheckUtils]: 2: Hoare triple {21139#true} assume true; {21139#true} is VALID [2018-11-23 11:56:31,325 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21139#true} {21139#true} #55#return; {21139#true} is VALID [2018-11-23 11:56:31,325 INFO L256 TraceCheckUtils]: 4: Hoare triple {21139#true} call #t~ret4 := main(); {21139#true} is VALID [2018-11-23 11:56:31,326 INFO L273 TraceCheckUtils]: 5: Hoare triple {21139#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {21141#(= main_~i~0 0)} is VALID [2018-11-23 11:56:31,326 INFO L273 TraceCheckUtils]: 6: Hoare triple {21141#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21141#(= main_~i~0 0)} is VALID [2018-11-23 11:56:31,327 INFO L273 TraceCheckUtils]: 7: Hoare triple {21141#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21141#(= main_~i~0 0)} is VALID [2018-11-23 11:56:31,327 INFO L273 TraceCheckUtils]: 8: Hoare triple {21141#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {21142#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:31,328 INFO L273 TraceCheckUtils]: 9: Hoare triple {21142#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21142#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:31,328 INFO L273 TraceCheckUtils]: 10: Hoare triple {21142#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21142#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:31,329 INFO L273 TraceCheckUtils]: 11: Hoare triple {21142#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {21143#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:31,330 INFO L273 TraceCheckUtils]: 12: Hoare triple {21143#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21143#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:31,330 INFO L273 TraceCheckUtils]: 13: Hoare triple {21143#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21143#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:31,331 INFO L273 TraceCheckUtils]: 14: Hoare triple {21143#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {21144#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:31,331 INFO L273 TraceCheckUtils]: 15: Hoare triple {21144#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21144#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:31,332 INFO L273 TraceCheckUtils]: 16: Hoare triple {21144#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21144#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:31,333 INFO L273 TraceCheckUtils]: 17: Hoare triple {21144#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {21145#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:31,333 INFO L273 TraceCheckUtils]: 18: Hoare triple {21145#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21145#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:31,334 INFO L273 TraceCheckUtils]: 19: Hoare triple {21145#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21145#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:31,334 INFO L273 TraceCheckUtils]: 20: Hoare triple {21145#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {21146#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:31,335 INFO L273 TraceCheckUtils]: 21: Hoare triple {21146#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21146#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:31,335 INFO L273 TraceCheckUtils]: 22: Hoare triple {21146#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21146#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:31,336 INFO L273 TraceCheckUtils]: 23: Hoare triple {21146#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {21147#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:31,336 INFO L273 TraceCheckUtils]: 24: Hoare triple {21147#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21147#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:31,337 INFO L273 TraceCheckUtils]: 25: Hoare triple {21147#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21147#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:31,338 INFO L273 TraceCheckUtils]: 26: Hoare triple {21147#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {21148#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:31,338 INFO L273 TraceCheckUtils]: 27: Hoare triple {21148#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21148#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:31,339 INFO L273 TraceCheckUtils]: 28: Hoare triple {21148#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21148#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:31,339 INFO L273 TraceCheckUtils]: 29: Hoare triple {21148#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {21149#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:31,340 INFO L273 TraceCheckUtils]: 30: Hoare triple {21149#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21149#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:31,341 INFO L273 TraceCheckUtils]: 31: Hoare triple {21149#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21149#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:31,341 INFO L273 TraceCheckUtils]: 32: Hoare triple {21149#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {21150#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:31,342 INFO L273 TraceCheckUtils]: 33: Hoare triple {21150#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21150#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:31,343 INFO L273 TraceCheckUtils]: 34: Hoare triple {21150#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21150#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:31,343 INFO L273 TraceCheckUtils]: 35: Hoare triple {21150#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {21151#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:31,344 INFO L273 TraceCheckUtils]: 36: Hoare triple {21151#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21151#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:31,345 INFO L273 TraceCheckUtils]: 37: Hoare triple {21151#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21151#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:31,345 INFO L273 TraceCheckUtils]: 38: Hoare triple {21151#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {21152#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:31,346 INFO L273 TraceCheckUtils]: 39: Hoare triple {21152#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21152#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:31,347 INFO L273 TraceCheckUtils]: 40: Hoare triple {21152#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21152#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:31,347 INFO L273 TraceCheckUtils]: 41: Hoare triple {21152#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {21153#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:31,348 INFO L273 TraceCheckUtils]: 42: Hoare triple {21153#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21153#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:31,349 INFO L273 TraceCheckUtils]: 43: Hoare triple {21153#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21153#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:31,349 INFO L273 TraceCheckUtils]: 44: Hoare triple {21153#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {21154#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:31,350 INFO L273 TraceCheckUtils]: 45: Hoare triple {21154#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21154#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:31,351 INFO L273 TraceCheckUtils]: 46: Hoare triple {21154#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21154#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:31,352 INFO L273 TraceCheckUtils]: 47: Hoare triple {21154#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {21155#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:31,352 INFO L273 TraceCheckUtils]: 48: Hoare triple {21155#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21155#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:31,353 INFO L273 TraceCheckUtils]: 49: Hoare triple {21155#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21155#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:31,354 INFO L273 TraceCheckUtils]: 50: Hoare triple {21155#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {21156#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:31,354 INFO L273 TraceCheckUtils]: 51: Hoare triple {21156#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21156#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:31,355 INFO L273 TraceCheckUtils]: 52: Hoare triple {21156#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21156#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:31,356 INFO L273 TraceCheckUtils]: 53: Hoare triple {21156#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {21157#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:31,356 INFO L273 TraceCheckUtils]: 54: Hoare triple {21157#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21157#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:31,357 INFO L273 TraceCheckUtils]: 55: Hoare triple {21157#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21157#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:31,358 INFO L273 TraceCheckUtils]: 56: Hoare triple {21157#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {21158#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:31,358 INFO L273 TraceCheckUtils]: 57: Hoare triple {21158#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21158#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:31,359 INFO L273 TraceCheckUtils]: 58: Hoare triple {21158#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21158#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:31,360 INFO L273 TraceCheckUtils]: 59: Hoare triple {21158#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {21159#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:31,360 INFO L273 TraceCheckUtils]: 60: Hoare triple {21159#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21159#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:31,361 INFO L273 TraceCheckUtils]: 61: Hoare triple {21159#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21159#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:31,362 INFO L273 TraceCheckUtils]: 62: Hoare triple {21159#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {21160#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:31,362 INFO L273 TraceCheckUtils]: 63: Hoare triple {21160#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21160#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:31,363 INFO L273 TraceCheckUtils]: 64: Hoare triple {21160#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21160#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:31,364 INFO L273 TraceCheckUtils]: 65: Hoare triple {21160#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {21161#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:31,364 INFO L273 TraceCheckUtils]: 66: Hoare triple {21161#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21161#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:31,365 INFO L273 TraceCheckUtils]: 67: Hoare triple {21161#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21161#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:31,366 INFO L273 TraceCheckUtils]: 68: Hoare triple {21161#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {21162#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:31,366 INFO L273 TraceCheckUtils]: 69: Hoare triple {21162#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21162#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:31,367 INFO L273 TraceCheckUtils]: 70: Hoare triple {21162#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21162#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:31,368 INFO L273 TraceCheckUtils]: 71: Hoare triple {21162#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {21163#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:31,368 INFO L273 TraceCheckUtils]: 72: Hoare triple {21163#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21163#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:31,369 INFO L273 TraceCheckUtils]: 73: Hoare triple {21163#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21163#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:31,370 INFO L273 TraceCheckUtils]: 74: Hoare triple {21163#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {21164#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:31,370 INFO L273 TraceCheckUtils]: 75: Hoare triple {21164#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21164#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:31,371 INFO L273 TraceCheckUtils]: 76: Hoare triple {21164#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21164#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:31,372 INFO L273 TraceCheckUtils]: 77: Hoare triple {21164#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {21165#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:31,372 INFO L273 TraceCheckUtils]: 78: Hoare triple {21165#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21165#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:31,373 INFO L273 TraceCheckUtils]: 79: Hoare triple {21165#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21165#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:31,374 INFO L273 TraceCheckUtils]: 80: Hoare triple {21165#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {21166#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:31,374 INFO L273 TraceCheckUtils]: 81: Hoare triple {21166#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21166#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:31,375 INFO L273 TraceCheckUtils]: 82: Hoare triple {21166#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21166#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:31,376 INFO L273 TraceCheckUtils]: 83: Hoare triple {21166#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {21167#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:31,376 INFO L273 TraceCheckUtils]: 84: Hoare triple {21167#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21167#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:31,377 INFO L273 TraceCheckUtils]: 85: Hoare triple {21167#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21167#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:31,378 INFO L273 TraceCheckUtils]: 86: Hoare triple {21167#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {21168#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:31,378 INFO L273 TraceCheckUtils]: 87: Hoare triple {21168#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21168#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:31,379 INFO L273 TraceCheckUtils]: 88: Hoare triple {21168#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21168#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:31,380 INFO L273 TraceCheckUtils]: 89: Hoare triple {21168#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {21169#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:31,380 INFO L273 TraceCheckUtils]: 90: Hoare triple {21169#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21169#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:31,381 INFO L273 TraceCheckUtils]: 91: Hoare triple {21169#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21169#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:31,382 INFO L273 TraceCheckUtils]: 92: Hoare triple {21169#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {21170#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:31,382 INFO L273 TraceCheckUtils]: 93: Hoare triple {21170#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21170#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:31,383 INFO L273 TraceCheckUtils]: 94: Hoare triple {21170#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21170#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:31,384 INFO L273 TraceCheckUtils]: 95: Hoare triple {21170#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {21171#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:31,384 INFO L273 TraceCheckUtils]: 96: Hoare triple {21171#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21171#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:31,385 INFO L273 TraceCheckUtils]: 97: Hoare triple {21171#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21171#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:31,386 INFO L273 TraceCheckUtils]: 98: Hoare triple {21171#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {21172#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:31,386 INFO L273 TraceCheckUtils]: 99: Hoare triple {21172#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21172#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:31,387 INFO L273 TraceCheckUtils]: 100: Hoare triple {21172#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21172#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:31,388 INFO L273 TraceCheckUtils]: 101: Hoare triple {21172#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {21173#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:31,388 INFO L273 TraceCheckUtils]: 102: Hoare triple {21173#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21173#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:31,389 INFO L273 TraceCheckUtils]: 103: Hoare triple {21173#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21173#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:31,390 INFO L273 TraceCheckUtils]: 104: Hoare triple {21173#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {21174#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:31,391 INFO L273 TraceCheckUtils]: 105: Hoare triple {21174#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21174#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:31,391 INFO L273 TraceCheckUtils]: 106: Hoare triple {21174#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21174#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:31,392 INFO L273 TraceCheckUtils]: 107: Hoare triple {21174#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {21175#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:31,393 INFO L273 TraceCheckUtils]: 108: Hoare triple {21175#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21175#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:31,393 INFO L273 TraceCheckUtils]: 109: Hoare triple {21175#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21175#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:31,394 INFO L273 TraceCheckUtils]: 110: Hoare triple {21175#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {21176#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:31,395 INFO L273 TraceCheckUtils]: 111: Hoare triple {21176#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21176#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:31,395 INFO L273 TraceCheckUtils]: 112: Hoare triple {21176#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21176#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:31,396 INFO L273 TraceCheckUtils]: 113: Hoare triple {21176#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {21177#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:31,397 INFO L273 TraceCheckUtils]: 114: Hoare triple {21177#(<= main_~i~0 36)} assume !(~i~0 < 100000); {21140#false} is VALID [2018-11-23 11:56:31,397 INFO L273 TraceCheckUtils]: 115: Hoare triple {21140#false} havoc ~x~0;~x~0 := 0; {21140#false} is VALID [2018-11-23 11:56:31,397 INFO L273 TraceCheckUtils]: 116: Hoare triple {21140#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {21140#false} is VALID [2018-11-23 11:56:31,397 INFO L256 TraceCheckUtils]: 117: Hoare triple {21140#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {21140#false} is VALID [2018-11-23 11:56:31,398 INFO L273 TraceCheckUtils]: 118: Hoare triple {21140#false} ~cond := #in~cond; {21140#false} is VALID [2018-11-23 11:56:31,398 INFO L273 TraceCheckUtils]: 119: Hoare triple {21140#false} assume 0 == ~cond; {21140#false} is VALID [2018-11-23 11:56:31,398 INFO L273 TraceCheckUtils]: 120: Hoare triple {21140#false} assume !false; {21140#false} is VALID [2018-11-23 11:56:31,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:31,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:31,418 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:31,446 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:56:31,530 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-11-23 11:56:31,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:31,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:32,254 INFO L256 TraceCheckUtils]: 0: Hoare triple {21139#true} call ULTIMATE.init(); {21139#true} is VALID [2018-11-23 11:56:32,254 INFO L273 TraceCheckUtils]: 1: Hoare triple {21139#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21139#true} is VALID [2018-11-23 11:56:32,255 INFO L273 TraceCheckUtils]: 2: Hoare triple {21139#true} assume true; {21139#true} is VALID [2018-11-23 11:56:32,255 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21139#true} {21139#true} #55#return; {21139#true} is VALID [2018-11-23 11:56:32,255 INFO L256 TraceCheckUtils]: 4: Hoare triple {21139#true} call #t~ret4 := main(); {21139#true} is VALID [2018-11-23 11:56:32,256 INFO L273 TraceCheckUtils]: 5: Hoare triple {21139#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {21196#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:32,257 INFO L273 TraceCheckUtils]: 6: Hoare triple {21196#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21196#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:32,257 INFO L273 TraceCheckUtils]: 7: Hoare triple {21196#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21196#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:32,257 INFO L273 TraceCheckUtils]: 8: Hoare triple {21196#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {21142#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:32,258 INFO L273 TraceCheckUtils]: 9: Hoare triple {21142#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21142#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:32,258 INFO L273 TraceCheckUtils]: 10: Hoare triple {21142#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21142#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:32,259 INFO L273 TraceCheckUtils]: 11: Hoare triple {21142#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {21143#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:32,259 INFO L273 TraceCheckUtils]: 12: Hoare triple {21143#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21143#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:32,259 INFO L273 TraceCheckUtils]: 13: Hoare triple {21143#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21143#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:32,260 INFO L273 TraceCheckUtils]: 14: Hoare triple {21143#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {21144#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:32,261 INFO L273 TraceCheckUtils]: 15: Hoare triple {21144#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21144#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:32,261 INFO L273 TraceCheckUtils]: 16: Hoare triple {21144#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21144#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:32,262 INFO L273 TraceCheckUtils]: 17: Hoare triple {21144#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {21145#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:32,262 INFO L273 TraceCheckUtils]: 18: Hoare triple {21145#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21145#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:32,263 INFO L273 TraceCheckUtils]: 19: Hoare triple {21145#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21145#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:32,263 INFO L273 TraceCheckUtils]: 20: Hoare triple {21145#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {21146#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:32,264 INFO L273 TraceCheckUtils]: 21: Hoare triple {21146#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21146#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:32,264 INFO L273 TraceCheckUtils]: 22: Hoare triple {21146#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21146#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:32,265 INFO L273 TraceCheckUtils]: 23: Hoare triple {21146#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {21147#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:32,266 INFO L273 TraceCheckUtils]: 24: Hoare triple {21147#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21147#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:32,266 INFO L273 TraceCheckUtils]: 25: Hoare triple {21147#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21147#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:32,267 INFO L273 TraceCheckUtils]: 26: Hoare triple {21147#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {21148#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:32,267 INFO L273 TraceCheckUtils]: 27: Hoare triple {21148#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21148#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:32,268 INFO L273 TraceCheckUtils]: 28: Hoare triple {21148#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21148#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:32,269 INFO L273 TraceCheckUtils]: 29: Hoare triple {21148#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {21149#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:32,269 INFO L273 TraceCheckUtils]: 30: Hoare triple {21149#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21149#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:32,270 INFO L273 TraceCheckUtils]: 31: Hoare triple {21149#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21149#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:32,270 INFO L273 TraceCheckUtils]: 32: Hoare triple {21149#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {21150#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:32,271 INFO L273 TraceCheckUtils]: 33: Hoare triple {21150#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21150#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:32,271 INFO L273 TraceCheckUtils]: 34: Hoare triple {21150#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21150#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:32,272 INFO L273 TraceCheckUtils]: 35: Hoare triple {21150#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {21151#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:32,273 INFO L273 TraceCheckUtils]: 36: Hoare triple {21151#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21151#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:32,273 INFO L273 TraceCheckUtils]: 37: Hoare triple {21151#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21151#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:32,274 INFO L273 TraceCheckUtils]: 38: Hoare triple {21151#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {21152#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:32,274 INFO L273 TraceCheckUtils]: 39: Hoare triple {21152#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21152#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:32,275 INFO L273 TraceCheckUtils]: 40: Hoare triple {21152#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21152#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:32,276 INFO L273 TraceCheckUtils]: 41: Hoare triple {21152#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {21153#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:32,276 INFO L273 TraceCheckUtils]: 42: Hoare triple {21153#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21153#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:32,277 INFO L273 TraceCheckUtils]: 43: Hoare triple {21153#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21153#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:32,277 INFO L273 TraceCheckUtils]: 44: Hoare triple {21153#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {21154#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:32,278 INFO L273 TraceCheckUtils]: 45: Hoare triple {21154#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21154#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:32,278 INFO L273 TraceCheckUtils]: 46: Hoare triple {21154#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21154#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:32,279 INFO L273 TraceCheckUtils]: 47: Hoare triple {21154#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {21155#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:32,279 INFO L273 TraceCheckUtils]: 48: Hoare triple {21155#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21155#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:32,280 INFO L273 TraceCheckUtils]: 49: Hoare triple {21155#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21155#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:32,281 INFO L273 TraceCheckUtils]: 50: Hoare triple {21155#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {21156#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:32,281 INFO L273 TraceCheckUtils]: 51: Hoare triple {21156#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21156#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:32,282 INFO L273 TraceCheckUtils]: 52: Hoare triple {21156#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21156#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:32,282 INFO L273 TraceCheckUtils]: 53: Hoare triple {21156#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {21157#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:32,283 INFO L273 TraceCheckUtils]: 54: Hoare triple {21157#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21157#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:32,283 INFO L273 TraceCheckUtils]: 55: Hoare triple {21157#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21157#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:32,284 INFO L273 TraceCheckUtils]: 56: Hoare triple {21157#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {21158#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:32,285 INFO L273 TraceCheckUtils]: 57: Hoare triple {21158#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21158#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:32,285 INFO L273 TraceCheckUtils]: 58: Hoare triple {21158#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21158#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:32,286 INFO L273 TraceCheckUtils]: 59: Hoare triple {21158#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {21159#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:32,286 INFO L273 TraceCheckUtils]: 60: Hoare triple {21159#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21159#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:32,287 INFO L273 TraceCheckUtils]: 61: Hoare triple {21159#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21159#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:32,288 INFO L273 TraceCheckUtils]: 62: Hoare triple {21159#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {21160#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:32,288 INFO L273 TraceCheckUtils]: 63: Hoare triple {21160#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21160#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:32,289 INFO L273 TraceCheckUtils]: 64: Hoare triple {21160#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21160#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:32,289 INFO L273 TraceCheckUtils]: 65: Hoare triple {21160#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {21161#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:32,290 INFO L273 TraceCheckUtils]: 66: Hoare triple {21161#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21161#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:32,290 INFO L273 TraceCheckUtils]: 67: Hoare triple {21161#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21161#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:32,291 INFO L273 TraceCheckUtils]: 68: Hoare triple {21161#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {21162#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:32,291 INFO L273 TraceCheckUtils]: 69: Hoare triple {21162#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21162#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:32,292 INFO L273 TraceCheckUtils]: 70: Hoare triple {21162#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21162#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:32,293 INFO L273 TraceCheckUtils]: 71: Hoare triple {21162#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {21163#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:32,293 INFO L273 TraceCheckUtils]: 72: Hoare triple {21163#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21163#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:32,294 INFO L273 TraceCheckUtils]: 73: Hoare triple {21163#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21163#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:32,294 INFO L273 TraceCheckUtils]: 74: Hoare triple {21163#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {21164#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:32,295 INFO L273 TraceCheckUtils]: 75: Hoare triple {21164#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21164#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:32,295 INFO L273 TraceCheckUtils]: 76: Hoare triple {21164#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21164#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:32,296 INFO L273 TraceCheckUtils]: 77: Hoare triple {21164#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {21165#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:32,297 INFO L273 TraceCheckUtils]: 78: Hoare triple {21165#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21165#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:32,297 INFO L273 TraceCheckUtils]: 79: Hoare triple {21165#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21165#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:32,298 INFO L273 TraceCheckUtils]: 80: Hoare triple {21165#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {21166#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:32,298 INFO L273 TraceCheckUtils]: 81: Hoare triple {21166#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21166#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:32,299 INFO L273 TraceCheckUtils]: 82: Hoare triple {21166#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21166#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:32,300 INFO L273 TraceCheckUtils]: 83: Hoare triple {21166#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {21167#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:32,300 INFO L273 TraceCheckUtils]: 84: Hoare triple {21167#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21167#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:32,301 INFO L273 TraceCheckUtils]: 85: Hoare triple {21167#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21167#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:32,301 INFO L273 TraceCheckUtils]: 86: Hoare triple {21167#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {21168#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:32,302 INFO L273 TraceCheckUtils]: 87: Hoare triple {21168#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21168#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:32,302 INFO L273 TraceCheckUtils]: 88: Hoare triple {21168#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21168#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:32,303 INFO L273 TraceCheckUtils]: 89: Hoare triple {21168#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {21169#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:32,304 INFO L273 TraceCheckUtils]: 90: Hoare triple {21169#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21169#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:32,304 INFO L273 TraceCheckUtils]: 91: Hoare triple {21169#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21169#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:32,305 INFO L273 TraceCheckUtils]: 92: Hoare triple {21169#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {21170#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:32,305 INFO L273 TraceCheckUtils]: 93: Hoare triple {21170#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21170#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:32,306 INFO L273 TraceCheckUtils]: 94: Hoare triple {21170#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21170#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:32,306 INFO L273 TraceCheckUtils]: 95: Hoare triple {21170#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {21171#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:32,307 INFO L273 TraceCheckUtils]: 96: Hoare triple {21171#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21171#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:32,307 INFO L273 TraceCheckUtils]: 97: Hoare triple {21171#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21171#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:32,308 INFO L273 TraceCheckUtils]: 98: Hoare triple {21171#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {21172#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:32,309 INFO L273 TraceCheckUtils]: 99: Hoare triple {21172#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21172#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:32,309 INFO L273 TraceCheckUtils]: 100: Hoare triple {21172#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21172#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:32,310 INFO L273 TraceCheckUtils]: 101: Hoare triple {21172#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {21173#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:32,310 INFO L273 TraceCheckUtils]: 102: Hoare triple {21173#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21173#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:32,311 INFO L273 TraceCheckUtils]: 103: Hoare triple {21173#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21173#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:32,312 INFO L273 TraceCheckUtils]: 104: Hoare triple {21173#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {21174#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:32,312 INFO L273 TraceCheckUtils]: 105: Hoare triple {21174#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21174#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:32,313 INFO L273 TraceCheckUtils]: 106: Hoare triple {21174#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21174#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:32,313 INFO L273 TraceCheckUtils]: 107: Hoare triple {21174#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {21175#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:32,314 INFO L273 TraceCheckUtils]: 108: Hoare triple {21175#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21175#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:32,314 INFO L273 TraceCheckUtils]: 109: Hoare triple {21175#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21175#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:32,315 INFO L273 TraceCheckUtils]: 110: Hoare triple {21175#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {21176#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:32,316 INFO L273 TraceCheckUtils]: 111: Hoare triple {21176#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21176#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:32,316 INFO L273 TraceCheckUtils]: 112: Hoare triple {21176#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {21176#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:32,317 INFO L273 TraceCheckUtils]: 113: Hoare triple {21176#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {21177#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:32,317 INFO L273 TraceCheckUtils]: 114: Hoare triple {21177#(<= main_~i~0 36)} assume !(~i~0 < 100000); {21140#false} is VALID [2018-11-23 11:56:32,318 INFO L273 TraceCheckUtils]: 115: Hoare triple {21140#false} havoc ~x~0;~x~0 := 0; {21140#false} is VALID [2018-11-23 11:56:32,318 INFO L273 TraceCheckUtils]: 116: Hoare triple {21140#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {21140#false} is VALID [2018-11-23 11:56:32,318 INFO L256 TraceCheckUtils]: 117: Hoare triple {21140#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {21140#false} is VALID [2018-11-23 11:56:32,318 INFO L273 TraceCheckUtils]: 118: Hoare triple {21140#false} ~cond := #in~cond; {21140#false} is VALID [2018-11-23 11:56:32,318 INFO L273 TraceCheckUtils]: 119: Hoare triple {21140#false} assume 0 == ~cond; {21140#false} is VALID [2018-11-23 11:56:32,319 INFO L273 TraceCheckUtils]: 120: Hoare triple {21140#false} assume !false; {21140#false} is VALID [2018-11-23 11:56:32,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:32,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:32,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2018-11-23 11:56:32,349 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 121 [2018-11-23 11:56:32,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:32,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-23 11:56:32,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:32,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 11:56:32,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 11:56:32,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 11:56:32,471 INFO L87 Difference]: Start difference. First operand 126 states and 163 transitions. Second operand 40 states. [2018-11-23 11:56:33,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:33,252 INFO L93 Difference]: Finished difference Result 142 states and 182 transitions. [2018-11-23 11:56:33,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 11:56:33,252 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 121 [2018-11-23 11:56:33,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:33,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:56:33,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 182 transitions. [2018-11-23 11:56:33,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:56:33,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 182 transitions. [2018-11-23 11:56:33,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 182 transitions. [2018-11-23 11:56:33,425 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:33,428 INFO L225 Difference]: With dead ends: 142 [2018-11-23 11:56:33,428 INFO L226 Difference]: Without dead ends: 131 [2018-11-23 11:56:33,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 11:56:33,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-23 11:56:33,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2018-11-23 11:56:33,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:33,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand 129 states. [2018-11-23 11:56:33,502 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 129 states. [2018-11-23 11:56:33,502 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 129 states. [2018-11-23 11:56:33,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:33,504 INFO L93 Difference]: Finished difference Result 131 states and 170 transitions. [2018-11-23 11:56:33,504 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 170 transitions. [2018-11-23 11:56:33,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:33,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:33,505 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 131 states. [2018-11-23 11:56:33,505 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 131 states. [2018-11-23 11:56:33,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:33,506 INFO L93 Difference]: Finished difference Result 131 states and 170 transitions. [2018-11-23 11:56:33,507 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 170 transitions. [2018-11-23 11:56:33,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:33,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:33,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:33,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:33,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-23 11:56:33,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 167 transitions. [2018-11-23 11:56:33,509 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 167 transitions. Word has length 121 [2018-11-23 11:56:33,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:33,510 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 167 transitions. [2018-11-23 11:56:33,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 11:56:33,510 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 167 transitions. [2018-11-23 11:56:33,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-23 11:56:33,511 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:33,511 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:33,511 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:33,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:33,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1448587619, now seen corresponding path program 37 times [2018-11-23 11:56:33,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:33,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:33,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:33,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:33,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:34,721 INFO L256 TraceCheckUtils]: 0: Hoare triple {22167#true} call ULTIMATE.init(); {22167#true} is VALID [2018-11-23 11:56:34,721 INFO L273 TraceCheckUtils]: 1: Hoare triple {22167#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22167#true} is VALID [2018-11-23 11:56:34,721 INFO L273 TraceCheckUtils]: 2: Hoare triple {22167#true} assume true; {22167#true} is VALID [2018-11-23 11:56:34,722 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22167#true} {22167#true} #55#return; {22167#true} is VALID [2018-11-23 11:56:34,722 INFO L256 TraceCheckUtils]: 4: Hoare triple {22167#true} call #t~ret4 := main(); {22167#true} is VALID [2018-11-23 11:56:34,722 INFO L273 TraceCheckUtils]: 5: Hoare triple {22167#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {22169#(= main_~i~0 0)} is VALID [2018-11-23 11:56:34,723 INFO L273 TraceCheckUtils]: 6: Hoare triple {22169#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22169#(= main_~i~0 0)} is VALID [2018-11-23 11:56:34,723 INFO L273 TraceCheckUtils]: 7: Hoare triple {22169#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22169#(= main_~i~0 0)} is VALID [2018-11-23 11:56:34,724 INFO L273 TraceCheckUtils]: 8: Hoare triple {22169#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {22170#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:34,724 INFO L273 TraceCheckUtils]: 9: Hoare triple {22170#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22170#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:34,725 INFO L273 TraceCheckUtils]: 10: Hoare triple {22170#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22170#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:34,726 INFO L273 TraceCheckUtils]: 11: Hoare triple {22170#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {22171#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:34,726 INFO L273 TraceCheckUtils]: 12: Hoare triple {22171#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22171#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:34,727 INFO L273 TraceCheckUtils]: 13: Hoare triple {22171#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22171#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:34,727 INFO L273 TraceCheckUtils]: 14: Hoare triple {22171#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {22172#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:34,728 INFO L273 TraceCheckUtils]: 15: Hoare triple {22172#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22172#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:34,728 INFO L273 TraceCheckUtils]: 16: Hoare triple {22172#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22172#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:34,729 INFO L273 TraceCheckUtils]: 17: Hoare triple {22172#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {22173#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:34,730 INFO L273 TraceCheckUtils]: 18: Hoare triple {22173#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22173#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:34,730 INFO L273 TraceCheckUtils]: 19: Hoare triple {22173#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22173#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:34,731 INFO L273 TraceCheckUtils]: 20: Hoare triple {22173#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {22174#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:34,731 INFO L273 TraceCheckUtils]: 21: Hoare triple {22174#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22174#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:34,732 INFO L273 TraceCheckUtils]: 22: Hoare triple {22174#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22174#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:34,733 INFO L273 TraceCheckUtils]: 23: Hoare triple {22174#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {22175#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:34,733 INFO L273 TraceCheckUtils]: 24: Hoare triple {22175#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22175#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:34,734 INFO L273 TraceCheckUtils]: 25: Hoare triple {22175#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22175#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:34,734 INFO L273 TraceCheckUtils]: 26: Hoare triple {22175#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {22176#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:34,735 INFO L273 TraceCheckUtils]: 27: Hoare triple {22176#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22176#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:34,735 INFO L273 TraceCheckUtils]: 28: Hoare triple {22176#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22176#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:34,736 INFO L273 TraceCheckUtils]: 29: Hoare triple {22176#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {22177#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:34,737 INFO L273 TraceCheckUtils]: 30: Hoare triple {22177#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22177#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:34,737 INFO L273 TraceCheckUtils]: 31: Hoare triple {22177#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22177#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:34,738 INFO L273 TraceCheckUtils]: 32: Hoare triple {22177#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {22178#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:34,738 INFO L273 TraceCheckUtils]: 33: Hoare triple {22178#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22178#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:34,739 INFO L273 TraceCheckUtils]: 34: Hoare triple {22178#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22178#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:34,740 INFO L273 TraceCheckUtils]: 35: Hoare triple {22178#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {22179#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:34,740 INFO L273 TraceCheckUtils]: 36: Hoare triple {22179#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22179#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:34,741 INFO L273 TraceCheckUtils]: 37: Hoare triple {22179#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22179#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:34,741 INFO L273 TraceCheckUtils]: 38: Hoare triple {22179#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {22180#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:34,742 INFO L273 TraceCheckUtils]: 39: Hoare triple {22180#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22180#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:34,742 INFO L273 TraceCheckUtils]: 40: Hoare triple {22180#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22180#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:34,743 INFO L273 TraceCheckUtils]: 41: Hoare triple {22180#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {22181#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:34,743 INFO L273 TraceCheckUtils]: 42: Hoare triple {22181#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22181#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:34,744 INFO L273 TraceCheckUtils]: 43: Hoare triple {22181#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22181#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:34,745 INFO L273 TraceCheckUtils]: 44: Hoare triple {22181#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {22182#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:34,745 INFO L273 TraceCheckUtils]: 45: Hoare triple {22182#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22182#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:34,746 INFO L273 TraceCheckUtils]: 46: Hoare triple {22182#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22182#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:34,746 INFO L273 TraceCheckUtils]: 47: Hoare triple {22182#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {22183#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:34,747 INFO L273 TraceCheckUtils]: 48: Hoare triple {22183#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22183#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:34,747 INFO L273 TraceCheckUtils]: 49: Hoare triple {22183#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22183#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:34,748 INFO L273 TraceCheckUtils]: 50: Hoare triple {22183#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {22184#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:34,749 INFO L273 TraceCheckUtils]: 51: Hoare triple {22184#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22184#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:34,749 INFO L273 TraceCheckUtils]: 52: Hoare triple {22184#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22184#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:34,750 INFO L273 TraceCheckUtils]: 53: Hoare triple {22184#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {22185#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:34,750 INFO L273 TraceCheckUtils]: 54: Hoare triple {22185#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22185#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:34,751 INFO L273 TraceCheckUtils]: 55: Hoare triple {22185#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22185#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:34,752 INFO L273 TraceCheckUtils]: 56: Hoare triple {22185#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {22186#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:34,752 INFO L273 TraceCheckUtils]: 57: Hoare triple {22186#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22186#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:34,753 INFO L273 TraceCheckUtils]: 58: Hoare triple {22186#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22186#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:34,753 INFO L273 TraceCheckUtils]: 59: Hoare triple {22186#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {22187#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:34,754 INFO L273 TraceCheckUtils]: 60: Hoare triple {22187#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22187#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:34,754 INFO L273 TraceCheckUtils]: 61: Hoare triple {22187#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22187#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:34,755 INFO L273 TraceCheckUtils]: 62: Hoare triple {22187#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {22188#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:34,756 INFO L273 TraceCheckUtils]: 63: Hoare triple {22188#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22188#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:34,756 INFO L273 TraceCheckUtils]: 64: Hoare triple {22188#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22188#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:34,757 INFO L273 TraceCheckUtils]: 65: Hoare triple {22188#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {22189#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:34,757 INFO L273 TraceCheckUtils]: 66: Hoare triple {22189#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22189#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:34,758 INFO L273 TraceCheckUtils]: 67: Hoare triple {22189#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22189#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:34,759 INFO L273 TraceCheckUtils]: 68: Hoare triple {22189#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {22190#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:34,759 INFO L273 TraceCheckUtils]: 69: Hoare triple {22190#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22190#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:34,760 INFO L273 TraceCheckUtils]: 70: Hoare triple {22190#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22190#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:34,760 INFO L273 TraceCheckUtils]: 71: Hoare triple {22190#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {22191#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:34,761 INFO L273 TraceCheckUtils]: 72: Hoare triple {22191#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22191#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:34,761 INFO L273 TraceCheckUtils]: 73: Hoare triple {22191#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22191#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:34,762 INFO L273 TraceCheckUtils]: 74: Hoare triple {22191#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {22192#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:34,762 INFO L273 TraceCheckUtils]: 75: Hoare triple {22192#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22192#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:34,763 INFO L273 TraceCheckUtils]: 76: Hoare triple {22192#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22192#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:34,764 INFO L273 TraceCheckUtils]: 77: Hoare triple {22192#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {22193#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:34,764 INFO L273 TraceCheckUtils]: 78: Hoare triple {22193#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22193#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:34,765 INFO L273 TraceCheckUtils]: 79: Hoare triple {22193#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22193#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:34,765 INFO L273 TraceCheckUtils]: 80: Hoare triple {22193#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {22194#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:34,766 INFO L273 TraceCheckUtils]: 81: Hoare triple {22194#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22194#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:34,766 INFO L273 TraceCheckUtils]: 82: Hoare triple {22194#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22194#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:34,767 INFO L273 TraceCheckUtils]: 83: Hoare triple {22194#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {22195#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:34,768 INFO L273 TraceCheckUtils]: 84: Hoare triple {22195#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22195#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:34,768 INFO L273 TraceCheckUtils]: 85: Hoare triple {22195#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22195#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:34,769 INFO L273 TraceCheckUtils]: 86: Hoare triple {22195#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {22196#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:34,769 INFO L273 TraceCheckUtils]: 87: Hoare triple {22196#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22196#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:34,770 INFO L273 TraceCheckUtils]: 88: Hoare triple {22196#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22196#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:34,771 INFO L273 TraceCheckUtils]: 89: Hoare triple {22196#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {22197#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:34,771 INFO L273 TraceCheckUtils]: 90: Hoare triple {22197#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22197#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:34,772 INFO L273 TraceCheckUtils]: 91: Hoare triple {22197#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22197#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:34,772 INFO L273 TraceCheckUtils]: 92: Hoare triple {22197#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {22198#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:34,773 INFO L273 TraceCheckUtils]: 93: Hoare triple {22198#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22198#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:34,773 INFO L273 TraceCheckUtils]: 94: Hoare triple {22198#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22198#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:34,774 INFO L273 TraceCheckUtils]: 95: Hoare triple {22198#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {22199#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:34,775 INFO L273 TraceCheckUtils]: 96: Hoare triple {22199#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22199#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:34,775 INFO L273 TraceCheckUtils]: 97: Hoare triple {22199#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22199#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:34,776 INFO L273 TraceCheckUtils]: 98: Hoare triple {22199#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {22200#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:34,776 INFO L273 TraceCheckUtils]: 99: Hoare triple {22200#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22200#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:34,777 INFO L273 TraceCheckUtils]: 100: Hoare triple {22200#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22200#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:34,778 INFO L273 TraceCheckUtils]: 101: Hoare triple {22200#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {22201#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:34,778 INFO L273 TraceCheckUtils]: 102: Hoare triple {22201#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22201#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:34,779 INFO L273 TraceCheckUtils]: 103: Hoare triple {22201#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22201#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:34,779 INFO L273 TraceCheckUtils]: 104: Hoare triple {22201#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {22202#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:34,780 INFO L273 TraceCheckUtils]: 105: Hoare triple {22202#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22202#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:34,780 INFO L273 TraceCheckUtils]: 106: Hoare triple {22202#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22202#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:34,781 INFO L273 TraceCheckUtils]: 107: Hoare triple {22202#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {22203#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:34,782 INFO L273 TraceCheckUtils]: 108: Hoare triple {22203#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22203#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:34,782 INFO L273 TraceCheckUtils]: 109: Hoare triple {22203#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22203#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:34,783 INFO L273 TraceCheckUtils]: 110: Hoare triple {22203#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {22204#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:34,783 INFO L273 TraceCheckUtils]: 111: Hoare triple {22204#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22204#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:34,784 INFO L273 TraceCheckUtils]: 112: Hoare triple {22204#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22204#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:34,784 INFO L273 TraceCheckUtils]: 113: Hoare triple {22204#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {22205#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:34,785 INFO L273 TraceCheckUtils]: 114: Hoare triple {22205#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22205#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:34,785 INFO L273 TraceCheckUtils]: 115: Hoare triple {22205#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22205#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:34,786 INFO L273 TraceCheckUtils]: 116: Hoare triple {22205#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {22206#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:34,787 INFO L273 TraceCheckUtils]: 117: Hoare triple {22206#(<= main_~i~0 37)} assume !(~i~0 < 100000); {22168#false} is VALID [2018-11-23 11:56:34,787 INFO L273 TraceCheckUtils]: 118: Hoare triple {22168#false} havoc ~x~0;~x~0 := 0; {22168#false} is VALID [2018-11-23 11:56:34,787 INFO L273 TraceCheckUtils]: 119: Hoare triple {22168#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {22168#false} is VALID [2018-11-23 11:56:34,787 INFO L256 TraceCheckUtils]: 120: Hoare triple {22168#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {22168#false} is VALID [2018-11-23 11:56:34,788 INFO L273 TraceCheckUtils]: 121: Hoare triple {22168#false} ~cond := #in~cond; {22168#false} is VALID [2018-11-23 11:56:34,788 INFO L273 TraceCheckUtils]: 122: Hoare triple {22168#false} assume 0 == ~cond; {22168#false} is VALID [2018-11-23 11:56:34,788 INFO L273 TraceCheckUtils]: 123: Hoare triple {22168#false} assume !false; {22168#false} is VALID [2018-11-23 11:56:34,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:34,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:34,800 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:34,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:56:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:34,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:35,166 INFO L256 TraceCheckUtils]: 0: Hoare triple {22167#true} call ULTIMATE.init(); {22167#true} is VALID [2018-11-23 11:56:35,166 INFO L273 TraceCheckUtils]: 1: Hoare triple {22167#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22167#true} is VALID [2018-11-23 11:56:35,166 INFO L273 TraceCheckUtils]: 2: Hoare triple {22167#true} assume true; {22167#true} is VALID [2018-11-23 11:56:35,167 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22167#true} {22167#true} #55#return; {22167#true} is VALID [2018-11-23 11:56:35,167 INFO L256 TraceCheckUtils]: 4: Hoare triple {22167#true} call #t~ret4 := main(); {22167#true} is VALID [2018-11-23 11:56:35,168 INFO L273 TraceCheckUtils]: 5: Hoare triple {22167#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {22225#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:35,168 INFO L273 TraceCheckUtils]: 6: Hoare triple {22225#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22225#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:35,169 INFO L273 TraceCheckUtils]: 7: Hoare triple {22225#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22225#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:35,169 INFO L273 TraceCheckUtils]: 8: Hoare triple {22225#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {22170#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:35,169 INFO L273 TraceCheckUtils]: 9: Hoare triple {22170#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22170#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:35,170 INFO L273 TraceCheckUtils]: 10: Hoare triple {22170#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22170#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:35,170 INFO L273 TraceCheckUtils]: 11: Hoare triple {22170#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {22171#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:35,170 INFO L273 TraceCheckUtils]: 12: Hoare triple {22171#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22171#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:35,171 INFO L273 TraceCheckUtils]: 13: Hoare triple {22171#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22171#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:35,172 INFO L273 TraceCheckUtils]: 14: Hoare triple {22171#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {22172#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:35,172 INFO L273 TraceCheckUtils]: 15: Hoare triple {22172#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22172#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:35,173 INFO L273 TraceCheckUtils]: 16: Hoare triple {22172#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22172#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:35,173 INFO L273 TraceCheckUtils]: 17: Hoare triple {22172#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {22173#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:35,174 INFO L273 TraceCheckUtils]: 18: Hoare triple {22173#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22173#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:35,174 INFO L273 TraceCheckUtils]: 19: Hoare triple {22173#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22173#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:35,175 INFO L273 TraceCheckUtils]: 20: Hoare triple {22173#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {22174#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:35,175 INFO L273 TraceCheckUtils]: 21: Hoare triple {22174#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22174#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:35,176 INFO L273 TraceCheckUtils]: 22: Hoare triple {22174#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22174#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:35,177 INFO L273 TraceCheckUtils]: 23: Hoare triple {22174#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {22175#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:35,177 INFO L273 TraceCheckUtils]: 24: Hoare triple {22175#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22175#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:35,178 INFO L273 TraceCheckUtils]: 25: Hoare triple {22175#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22175#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:35,178 INFO L273 TraceCheckUtils]: 26: Hoare triple {22175#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {22176#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:35,179 INFO L273 TraceCheckUtils]: 27: Hoare triple {22176#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22176#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:35,179 INFO L273 TraceCheckUtils]: 28: Hoare triple {22176#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22176#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:35,180 INFO L273 TraceCheckUtils]: 29: Hoare triple {22176#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {22177#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:35,181 INFO L273 TraceCheckUtils]: 30: Hoare triple {22177#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22177#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:35,181 INFO L273 TraceCheckUtils]: 31: Hoare triple {22177#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22177#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:35,182 INFO L273 TraceCheckUtils]: 32: Hoare triple {22177#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {22178#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:35,182 INFO L273 TraceCheckUtils]: 33: Hoare triple {22178#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22178#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:35,183 INFO L273 TraceCheckUtils]: 34: Hoare triple {22178#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22178#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:35,183 INFO L273 TraceCheckUtils]: 35: Hoare triple {22178#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {22179#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:35,184 INFO L273 TraceCheckUtils]: 36: Hoare triple {22179#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22179#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:35,184 INFO L273 TraceCheckUtils]: 37: Hoare triple {22179#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22179#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:35,185 INFO L273 TraceCheckUtils]: 38: Hoare triple {22179#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {22180#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:35,186 INFO L273 TraceCheckUtils]: 39: Hoare triple {22180#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22180#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:35,186 INFO L273 TraceCheckUtils]: 40: Hoare triple {22180#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22180#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:35,187 INFO L273 TraceCheckUtils]: 41: Hoare triple {22180#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {22181#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:35,187 INFO L273 TraceCheckUtils]: 42: Hoare triple {22181#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22181#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:35,188 INFO L273 TraceCheckUtils]: 43: Hoare triple {22181#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22181#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:35,189 INFO L273 TraceCheckUtils]: 44: Hoare triple {22181#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {22182#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:35,189 INFO L273 TraceCheckUtils]: 45: Hoare triple {22182#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22182#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:35,190 INFO L273 TraceCheckUtils]: 46: Hoare triple {22182#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22182#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:35,190 INFO L273 TraceCheckUtils]: 47: Hoare triple {22182#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {22183#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:35,191 INFO L273 TraceCheckUtils]: 48: Hoare triple {22183#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22183#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:35,191 INFO L273 TraceCheckUtils]: 49: Hoare triple {22183#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22183#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:35,192 INFO L273 TraceCheckUtils]: 50: Hoare triple {22183#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {22184#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:35,193 INFO L273 TraceCheckUtils]: 51: Hoare triple {22184#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22184#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:35,193 INFO L273 TraceCheckUtils]: 52: Hoare triple {22184#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22184#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:35,194 INFO L273 TraceCheckUtils]: 53: Hoare triple {22184#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {22185#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:35,194 INFO L273 TraceCheckUtils]: 54: Hoare triple {22185#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22185#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:35,195 INFO L273 TraceCheckUtils]: 55: Hoare triple {22185#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22185#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:35,195 INFO L273 TraceCheckUtils]: 56: Hoare triple {22185#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {22186#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:35,196 INFO L273 TraceCheckUtils]: 57: Hoare triple {22186#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22186#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:35,196 INFO L273 TraceCheckUtils]: 58: Hoare triple {22186#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22186#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:35,197 INFO L273 TraceCheckUtils]: 59: Hoare triple {22186#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {22187#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:35,198 INFO L273 TraceCheckUtils]: 60: Hoare triple {22187#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22187#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:35,198 INFO L273 TraceCheckUtils]: 61: Hoare triple {22187#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22187#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:35,199 INFO L273 TraceCheckUtils]: 62: Hoare triple {22187#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {22188#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:35,199 INFO L273 TraceCheckUtils]: 63: Hoare triple {22188#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22188#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:35,200 INFO L273 TraceCheckUtils]: 64: Hoare triple {22188#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22188#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:35,201 INFO L273 TraceCheckUtils]: 65: Hoare triple {22188#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {22189#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:35,201 INFO L273 TraceCheckUtils]: 66: Hoare triple {22189#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22189#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:35,202 INFO L273 TraceCheckUtils]: 67: Hoare triple {22189#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22189#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:35,202 INFO L273 TraceCheckUtils]: 68: Hoare triple {22189#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {22190#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:35,203 INFO L273 TraceCheckUtils]: 69: Hoare triple {22190#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22190#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:35,203 INFO L273 TraceCheckUtils]: 70: Hoare triple {22190#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22190#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:35,204 INFO L273 TraceCheckUtils]: 71: Hoare triple {22190#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {22191#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:35,205 INFO L273 TraceCheckUtils]: 72: Hoare triple {22191#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22191#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:35,205 INFO L273 TraceCheckUtils]: 73: Hoare triple {22191#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22191#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:35,206 INFO L273 TraceCheckUtils]: 74: Hoare triple {22191#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {22192#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:35,206 INFO L273 TraceCheckUtils]: 75: Hoare triple {22192#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22192#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:35,207 INFO L273 TraceCheckUtils]: 76: Hoare triple {22192#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22192#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:35,207 INFO L273 TraceCheckUtils]: 77: Hoare triple {22192#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {22193#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:35,208 INFO L273 TraceCheckUtils]: 78: Hoare triple {22193#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22193#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:35,208 INFO L273 TraceCheckUtils]: 79: Hoare triple {22193#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22193#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:35,209 INFO L273 TraceCheckUtils]: 80: Hoare triple {22193#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {22194#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:35,210 INFO L273 TraceCheckUtils]: 81: Hoare triple {22194#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22194#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:35,210 INFO L273 TraceCheckUtils]: 82: Hoare triple {22194#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22194#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:35,211 INFO L273 TraceCheckUtils]: 83: Hoare triple {22194#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {22195#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:35,211 INFO L273 TraceCheckUtils]: 84: Hoare triple {22195#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22195#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:35,212 INFO L273 TraceCheckUtils]: 85: Hoare triple {22195#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22195#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:35,213 INFO L273 TraceCheckUtils]: 86: Hoare triple {22195#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {22196#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:35,213 INFO L273 TraceCheckUtils]: 87: Hoare triple {22196#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22196#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:35,214 INFO L273 TraceCheckUtils]: 88: Hoare triple {22196#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22196#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:35,214 INFO L273 TraceCheckUtils]: 89: Hoare triple {22196#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {22197#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:35,215 INFO L273 TraceCheckUtils]: 90: Hoare triple {22197#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22197#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:35,215 INFO L273 TraceCheckUtils]: 91: Hoare triple {22197#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22197#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:35,216 INFO L273 TraceCheckUtils]: 92: Hoare triple {22197#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {22198#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:35,216 INFO L273 TraceCheckUtils]: 93: Hoare triple {22198#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22198#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:35,217 INFO L273 TraceCheckUtils]: 94: Hoare triple {22198#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22198#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:35,218 INFO L273 TraceCheckUtils]: 95: Hoare triple {22198#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {22199#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:35,218 INFO L273 TraceCheckUtils]: 96: Hoare triple {22199#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22199#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:35,219 INFO L273 TraceCheckUtils]: 97: Hoare triple {22199#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22199#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:35,219 INFO L273 TraceCheckUtils]: 98: Hoare triple {22199#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {22200#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:35,220 INFO L273 TraceCheckUtils]: 99: Hoare triple {22200#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22200#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:35,220 INFO L273 TraceCheckUtils]: 100: Hoare triple {22200#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22200#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:35,221 INFO L273 TraceCheckUtils]: 101: Hoare triple {22200#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {22201#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:35,222 INFO L273 TraceCheckUtils]: 102: Hoare triple {22201#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22201#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:35,222 INFO L273 TraceCheckUtils]: 103: Hoare triple {22201#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22201#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:35,223 INFO L273 TraceCheckUtils]: 104: Hoare triple {22201#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {22202#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:35,223 INFO L273 TraceCheckUtils]: 105: Hoare triple {22202#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22202#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:35,224 INFO L273 TraceCheckUtils]: 106: Hoare triple {22202#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22202#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:35,225 INFO L273 TraceCheckUtils]: 107: Hoare triple {22202#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {22203#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:35,225 INFO L273 TraceCheckUtils]: 108: Hoare triple {22203#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22203#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:35,226 INFO L273 TraceCheckUtils]: 109: Hoare triple {22203#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22203#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:35,226 INFO L273 TraceCheckUtils]: 110: Hoare triple {22203#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {22204#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:35,227 INFO L273 TraceCheckUtils]: 111: Hoare triple {22204#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22204#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:35,227 INFO L273 TraceCheckUtils]: 112: Hoare triple {22204#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22204#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:35,228 INFO L273 TraceCheckUtils]: 113: Hoare triple {22204#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {22205#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:35,228 INFO L273 TraceCheckUtils]: 114: Hoare triple {22205#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22205#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:35,229 INFO L273 TraceCheckUtils]: 115: Hoare triple {22205#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {22205#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:35,230 INFO L273 TraceCheckUtils]: 116: Hoare triple {22205#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {22206#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:35,230 INFO L273 TraceCheckUtils]: 117: Hoare triple {22206#(<= main_~i~0 37)} assume !(~i~0 < 100000); {22168#false} is VALID [2018-11-23 11:56:35,231 INFO L273 TraceCheckUtils]: 118: Hoare triple {22168#false} havoc ~x~0;~x~0 := 0; {22168#false} is VALID [2018-11-23 11:56:35,231 INFO L273 TraceCheckUtils]: 119: Hoare triple {22168#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {22168#false} is VALID [2018-11-23 11:56:35,231 INFO L256 TraceCheckUtils]: 120: Hoare triple {22168#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {22168#false} is VALID [2018-11-23 11:56:35,231 INFO L273 TraceCheckUtils]: 121: Hoare triple {22168#false} ~cond := #in~cond; {22168#false} is VALID [2018-11-23 11:56:35,231 INFO L273 TraceCheckUtils]: 122: Hoare triple {22168#false} assume 0 == ~cond; {22168#false} is VALID [2018-11-23 11:56:35,231 INFO L273 TraceCheckUtils]: 123: Hoare triple {22168#false} assume !false; {22168#false} is VALID [2018-11-23 11:56:35,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:35,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:35,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-11-23 11:56:35,262 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 124 [2018-11-23 11:56:35,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:35,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 11:56:35,403 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:35,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 11:56:35,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 11:56:35,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 11:56:35,404 INFO L87 Difference]: Start difference. First operand 129 states and 167 transitions. Second operand 41 states. [2018-11-23 11:56:36,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:36,212 INFO L93 Difference]: Finished difference Result 145 states and 186 transitions. [2018-11-23 11:56:36,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 11:56:36,212 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 124 [2018-11-23 11:56:36,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:36,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 11:56:36,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 186 transitions. [2018-11-23 11:56:36,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 11:56:36,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 186 transitions. [2018-11-23 11:56:36,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 186 transitions. [2018-11-23 11:56:36,397 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:36,400 INFO L225 Difference]: With dead ends: 145 [2018-11-23 11:56:36,400 INFO L226 Difference]: Without dead ends: 134 [2018-11-23 11:56:36,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 11:56:36,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-23 11:56:36,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2018-11-23 11:56:36,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:36,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand 132 states. [2018-11-23 11:56:36,429 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 132 states. [2018-11-23 11:56:36,429 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 132 states. [2018-11-23 11:56:36,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:36,431 INFO L93 Difference]: Finished difference Result 134 states and 174 transitions. [2018-11-23 11:56:36,431 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 174 transitions. [2018-11-23 11:56:36,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:36,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:36,432 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 134 states. [2018-11-23 11:56:36,432 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 134 states. [2018-11-23 11:56:36,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:36,434 INFO L93 Difference]: Finished difference Result 134 states and 174 transitions. [2018-11-23 11:56:36,435 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 174 transitions. [2018-11-23 11:56:36,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:36,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:36,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:36,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:36,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-23 11:56:36,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 171 transitions. [2018-11-23 11:56:36,437 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 171 transitions. Word has length 124 [2018-11-23 11:56:36,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:36,438 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 171 transitions. [2018-11-23 11:56:36,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 11:56:36,438 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 171 transitions. [2018-11-23 11:56:36,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-23 11:56:36,438 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:36,439 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:36,439 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:36,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:36,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1912266759, now seen corresponding path program 38 times [2018-11-23 11:56:36,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:36,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:36,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:36,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:56:36,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:38,030 INFO L256 TraceCheckUtils]: 0: Hoare triple {23219#true} call ULTIMATE.init(); {23219#true} is VALID [2018-11-23 11:56:38,031 INFO L273 TraceCheckUtils]: 1: Hoare triple {23219#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23219#true} is VALID [2018-11-23 11:56:38,031 INFO L273 TraceCheckUtils]: 2: Hoare triple {23219#true} assume true; {23219#true} is VALID [2018-11-23 11:56:38,031 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23219#true} {23219#true} #55#return; {23219#true} is VALID [2018-11-23 11:56:38,031 INFO L256 TraceCheckUtils]: 4: Hoare triple {23219#true} call #t~ret4 := main(); {23219#true} is VALID [2018-11-23 11:56:38,032 INFO L273 TraceCheckUtils]: 5: Hoare triple {23219#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {23221#(= main_~i~0 0)} is VALID [2018-11-23 11:56:38,032 INFO L273 TraceCheckUtils]: 6: Hoare triple {23221#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23221#(= main_~i~0 0)} is VALID [2018-11-23 11:56:38,033 INFO L273 TraceCheckUtils]: 7: Hoare triple {23221#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23221#(= main_~i~0 0)} is VALID [2018-11-23 11:56:38,033 INFO L273 TraceCheckUtils]: 8: Hoare triple {23221#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {23222#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:38,034 INFO L273 TraceCheckUtils]: 9: Hoare triple {23222#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23222#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:38,034 INFO L273 TraceCheckUtils]: 10: Hoare triple {23222#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23222#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:38,035 INFO L273 TraceCheckUtils]: 11: Hoare triple {23222#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {23223#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:38,036 INFO L273 TraceCheckUtils]: 12: Hoare triple {23223#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23223#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:38,036 INFO L273 TraceCheckUtils]: 13: Hoare triple {23223#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23223#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:38,037 INFO L273 TraceCheckUtils]: 14: Hoare triple {23223#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {23224#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:38,037 INFO L273 TraceCheckUtils]: 15: Hoare triple {23224#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23224#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:38,038 INFO L273 TraceCheckUtils]: 16: Hoare triple {23224#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23224#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:38,038 INFO L273 TraceCheckUtils]: 17: Hoare triple {23224#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {23225#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:38,039 INFO L273 TraceCheckUtils]: 18: Hoare triple {23225#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23225#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:38,039 INFO L273 TraceCheckUtils]: 19: Hoare triple {23225#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23225#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:38,040 INFO L273 TraceCheckUtils]: 20: Hoare triple {23225#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {23226#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:38,041 INFO L273 TraceCheckUtils]: 21: Hoare triple {23226#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23226#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:38,041 INFO L273 TraceCheckUtils]: 22: Hoare triple {23226#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23226#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:38,042 INFO L273 TraceCheckUtils]: 23: Hoare triple {23226#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {23227#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:38,042 INFO L273 TraceCheckUtils]: 24: Hoare triple {23227#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23227#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:38,043 INFO L273 TraceCheckUtils]: 25: Hoare triple {23227#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23227#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:38,044 INFO L273 TraceCheckUtils]: 26: Hoare triple {23227#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {23228#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:38,044 INFO L273 TraceCheckUtils]: 27: Hoare triple {23228#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23228#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:38,045 INFO L273 TraceCheckUtils]: 28: Hoare triple {23228#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23228#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:38,045 INFO L273 TraceCheckUtils]: 29: Hoare triple {23228#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {23229#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:38,046 INFO L273 TraceCheckUtils]: 30: Hoare triple {23229#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23229#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:38,046 INFO L273 TraceCheckUtils]: 31: Hoare triple {23229#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23229#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:38,047 INFO L273 TraceCheckUtils]: 32: Hoare triple {23229#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {23230#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:38,048 INFO L273 TraceCheckUtils]: 33: Hoare triple {23230#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23230#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:38,048 INFO L273 TraceCheckUtils]: 34: Hoare triple {23230#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23230#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:38,049 INFO L273 TraceCheckUtils]: 35: Hoare triple {23230#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {23231#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:38,049 INFO L273 TraceCheckUtils]: 36: Hoare triple {23231#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23231#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:38,050 INFO L273 TraceCheckUtils]: 37: Hoare triple {23231#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23231#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:38,050 INFO L273 TraceCheckUtils]: 38: Hoare triple {23231#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {23232#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:38,051 INFO L273 TraceCheckUtils]: 39: Hoare triple {23232#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23232#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:38,051 INFO L273 TraceCheckUtils]: 40: Hoare triple {23232#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23232#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:38,052 INFO L273 TraceCheckUtils]: 41: Hoare triple {23232#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {23233#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:38,053 INFO L273 TraceCheckUtils]: 42: Hoare triple {23233#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23233#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:38,053 INFO L273 TraceCheckUtils]: 43: Hoare triple {23233#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23233#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:38,054 INFO L273 TraceCheckUtils]: 44: Hoare triple {23233#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {23234#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:38,054 INFO L273 TraceCheckUtils]: 45: Hoare triple {23234#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23234#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:38,055 INFO L273 TraceCheckUtils]: 46: Hoare triple {23234#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23234#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:38,056 INFO L273 TraceCheckUtils]: 47: Hoare triple {23234#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {23235#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:38,056 INFO L273 TraceCheckUtils]: 48: Hoare triple {23235#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23235#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:38,057 INFO L273 TraceCheckUtils]: 49: Hoare triple {23235#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23235#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:38,057 INFO L273 TraceCheckUtils]: 50: Hoare triple {23235#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {23236#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:38,058 INFO L273 TraceCheckUtils]: 51: Hoare triple {23236#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23236#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:38,058 INFO L273 TraceCheckUtils]: 52: Hoare triple {23236#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23236#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:38,059 INFO L273 TraceCheckUtils]: 53: Hoare triple {23236#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {23237#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:38,060 INFO L273 TraceCheckUtils]: 54: Hoare triple {23237#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23237#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:38,060 INFO L273 TraceCheckUtils]: 55: Hoare triple {23237#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23237#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:38,061 INFO L273 TraceCheckUtils]: 56: Hoare triple {23237#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {23238#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:38,061 INFO L273 TraceCheckUtils]: 57: Hoare triple {23238#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23238#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:38,062 INFO L273 TraceCheckUtils]: 58: Hoare triple {23238#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23238#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:38,063 INFO L273 TraceCheckUtils]: 59: Hoare triple {23238#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {23239#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:38,063 INFO L273 TraceCheckUtils]: 60: Hoare triple {23239#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23239#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:38,064 INFO L273 TraceCheckUtils]: 61: Hoare triple {23239#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23239#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:38,064 INFO L273 TraceCheckUtils]: 62: Hoare triple {23239#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {23240#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:38,065 INFO L273 TraceCheckUtils]: 63: Hoare triple {23240#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23240#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:38,065 INFO L273 TraceCheckUtils]: 64: Hoare triple {23240#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23240#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:38,066 INFO L273 TraceCheckUtils]: 65: Hoare triple {23240#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {23241#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:38,067 INFO L273 TraceCheckUtils]: 66: Hoare triple {23241#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23241#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:38,067 INFO L273 TraceCheckUtils]: 67: Hoare triple {23241#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23241#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:38,068 INFO L273 TraceCheckUtils]: 68: Hoare triple {23241#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {23242#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:38,068 INFO L273 TraceCheckUtils]: 69: Hoare triple {23242#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23242#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:38,069 INFO L273 TraceCheckUtils]: 70: Hoare triple {23242#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23242#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:38,069 INFO L273 TraceCheckUtils]: 71: Hoare triple {23242#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {23243#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:38,070 INFO L273 TraceCheckUtils]: 72: Hoare triple {23243#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23243#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:38,070 INFO L273 TraceCheckUtils]: 73: Hoare triple {23243#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23243#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:38,071 INFO L273 TraceCheckUtils]: 74: Hoare triple {23243#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {23244#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:38,072 INFO L273 TraceCheckUtils]: 75: Hoare triple {23244#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23244#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:38,072 INFO L273 TraceCheckUtils]: 76: Hoare triple {23244#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23244#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:38,073 INFO L273 TraceCheckUtils]: 77: Hoare triple {23244#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {23245#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:38,073 INFO L273 TraceCheckUtils]: 78: Hoare triple {23245#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23245#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:38,074 INFO L273 TraceCheckUtils]: 79: Hoare triple {23245#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23245#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:38,075 INFO L273 TraceCheckUtils]: 80: Hoare triple {23245#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {23246#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:38,075 INFO L273 TraceCheckUtils]: 81: Hoare triple {23246#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23246#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:38,076 INFO L273 TraceCheckUtils]: 82: Hoare triple {23246#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23246#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:38,076 INFO L273 TraceCheckUtils]: 83: Hoare triple {23246#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {23247#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:38,077 INFO L273 TraceCheckUtils]: 84: Hoare triple {23247#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23247#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:38,077 INFO L273 TraceCheckUtils]: 85: Hoare triple {23247#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23247#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:38,078 INFO L273 TraceCheckUtils]: 86: Hoare triple {23247#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {23248#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:38,079 INFO L273 TraceCheckUtils]: 87: Hoare triple {23248#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23248#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:38,079 INFO L273 TraceCheckUtils]: 88: Hoare triple {23248#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23248#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:38,080 INFO L273 TraceCheckUtils]: 89: Hoare triple {23248#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {23249#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:38,080 INFO L273 TraceCheckUtils]: 90: Hoare triple {23249#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23249#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:38,081 INFO L273 TraceCheckUtils]: 91: Hoare triple {23249#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23249#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:38,081 INFO L273 TraceCheckUtils]: 92: Hoare triple {23249#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {23250#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:38,082 INFO L273 TraceCheckUtils]: 93: Hoare triple {23250#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23250#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:38,082 INFO L273 TraceCheckUtils]: 94: Hoare triple {23250#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23250#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:38,083 INFO L273 TraceCheckUtils]: 95: Hoare triple {23250#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {23251#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:38,084 INFO L273 TraceCheckUtils]: 96: Hoare triple {23251#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23251#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:38,084 INFO L273 TraceCheckUtils]: 97: Hoare triple {23251#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23251#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:38,085 INFO L273 TraceCheckUtils]: 98: Hoare triple {23251#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {23252#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:38,085 INFO L273 TraceCheckUtils]: 99: Hoare triple {23252#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23252#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:38,086 INFO L273 TraceCheckUtils]: 100: Hoare triple {23252#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23252#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:38,087 INFO L273 TraceCheckUtils]: 101: Hoare triple {23252#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {23253#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:38,087 INFO L273 TraceCheckUtils]: 102: Hoare triple {23253#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23253#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:38,088 INFO L273 TraceCheckUtils]: 103: Hoare triple {23253#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23253#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:38,088 INFO L273 TraceCheckUtils]: 104: Hoare triple {23253#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {23254#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:38,089 INFO L273 TraceCheckUtils]: 105: Hoare triple {23254#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23254#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:38,089 INFO L273 TraceCheckUtils]: 106: Hoare triple {23254#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23254#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:38,090 INFO L273 TraceCheckUtils]: 107: Hoare triple {23254#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {23255#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:38,091 INFO L273 TraceCheckUtils]: 108: Hoare triple {23255#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23255#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:38,091 INFO L273 TraceCheckUtils]: 109: Hoare triple {23255#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23255#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:38,092 INFO L273 TraceCheckUtils]: 110: Hoare triple {23255#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {23256#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:38,092 INFO L273 TraceCheckUtils]: 111: Hoare triple {23256#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23256#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:38,093 INFO L273 TraceCheckUtils]: 112: Hoare triple {23256#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23256#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:38,094 INFO L273 TraceCheckUtils]: 113: Hoare triple {23256#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {23257#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:38,094 INFO L273 TraceCheckUtils]: 114: Hoare triple {23257#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23257#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:38,095 INFO L273 TraceCheckUtils]: 115: Hoare triple {23257#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23257#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:38,095 INFO L273 TraceCheckUtils]: 116: Hoare triple {23257#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {23258#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:38,096 INFO L273 TraceCheckUtils]: 117: Hoare triple {23258#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23258#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:38,096 INFO L273 TraceCheckUtils]: 118: Hoare triple {23258#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23258#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:38,097 INFO L273 TraceCheckUtils]: 119: Hoare triple {23258#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {23259#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:38,098 INFO L273 TraceCheckUtils]: 120: Hoare triple {23259#(<= main_~i~0 38)} assume !(~i~0 < 100000); {23220#false} is VALID [2018-11-23 11:56:38,098 INFO L273 TraceCheckUtils]: 121: Hoare triple {23220#false} havoc ~x~0;~x~0 := 0; {23220#false} is VALID [2018-11-23 11:56:38,098 INFO L273 TraceCheckUtils]: 122: Hoare triple {23220#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {23220#false} is VALID [2018-11-23 11:56:38,098 INFO L256 TraceCheckUtils]: 123: Hoare triple {23220#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {23220#false} is VALID [2018-11-23 11:56:38,098 INFO L273 TraceCheckUtils]: 124: Hoare triple {23220#false} ~cond := #in~cond; {23220#false} is VALID [2018-11-23 11:56:38,099 INFO L273 TraceCheckUtils]: 125: Hoare triple {23220#false} assume 0 == ~cond; {23220#false} is VALID [2018-11-23 11:56:38,099 INFO L273 TraceCheckUtils]: 126: Hoare triple {23220#false} assume !false; {23220#false} is VALID [2018-11-23 11:56:38,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:38,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:38,111 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:38,120 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:56:38,169 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:56:38,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:38,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:38,498 INFO L256 TraceCheckUtils]: 0: Hoare triple {23219#true} call ULTIMATE.init(); {23219#true} is VALID [2018-11-23 11:56:38,498 INFO L273 TraceCheckUtils]: 1: Hoare triple {23219#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23219#true} is VALID [2018-11-23 11:56:38,498 INFO L273 TraceCheckUtils]: 2: Hoare triple {23219#true} assume true; {23219#true} is VALID [2018-11-23 11:56:38,499 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23219#true} {23219#true} #55#return; {23219#true} is VALID [2018-11-23 11:56:38,499 INFO L256 TraceCheckUtils]: 4: Hoare triple {23219#true} call #t~ret4 := main(); {23219#true} is VALID [2018-11-23 11:56:38,500 INFO L273 TraceCheckUtils]: 5: Hoare triple {23219#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {23278#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:38,500 INFO L273 TraceCheckUtils]: 6: Hoare triple {23278#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23278#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:38,500 INFO L273 TraceCheckUtils]: 7: Hoare triple {23278#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23278#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:38,501 INFO L273 TraceCheckUtils]: 8: Hoare triple {23278#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {23222#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:38,501 INFO L273 TraceCheckUtils]: 9: Hoare triple {23222#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23222#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:38,503 INFO L273 TraceCheckUtils]: 10: Hoare triple {23222#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23222#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:38,504 INFO L273 TraceCheckUtils]: 11: Hoare triple {23222#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {23223#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:38,504 INFO L273 TraceCheckUtils]: 12: Hoare triple {23223#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23223#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:38,505 INFO L273 TraceCheckUtils]: 13: Hoare triple {23223#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23223#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:38,505 INFO L273 TraceCheckUtils]: 14: Hoare triple {23223#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {23224#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:38,506 INFO L273 TraceCheckUtils]: 15: Hoare triple {23224#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23224#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:38,506 INFO L273 TraceCheckUtils]: 16: Hoare triple {23224#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23224#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:38,507 INFO L273 TraceCheckUtils]: 17: Hoare triple {23224#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {23225#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:38,508 INFO L273 TraceCheckUtils]: 18: Hoare triple {23225#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23225#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:38,508 INFO L273 TraceCheckUtils]: 19: Hoare triple {23225#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23225#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:38,509 INFO L273 TraceCheckUtils]: 20: Hoare triple {23225#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {23226#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:38,509 INFO L273 TraceCheckUtils]: 21: Hoare triple {23226#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23226#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:38,510 INFO L273 TraceCheckUtils]: 22: Hoare triple {23226#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23226#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:38,511 INFO L273 TraceCheckUtils]: 23: Hoare triple {23226#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {23227#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:38,511 INFO L273 TraceCheckUtils]: 24: Hoare triple {23227#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23227#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:38,512 INFO L273 TraceCheckUtils]: 25: Hoare triple {23227#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23227#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:38,512 INFO L273 TraceCheckUtils]: 26: Hoare triple {23227#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {23228#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:38,513 INFO L273 TraceCheckUtils]: 27: Hoare triple {23228#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23228#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:38,513 INFO L273 TraceCheckUtils]: 28: Hoare triple {23228#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23228#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:38,514 INFO L273 TraceCheckUtils]: 29: Hoare triple {23228#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {23229#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:38,515 INFO L273 TraceCheckUtils]: 30: Hoare triple {23229#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23229#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:38,515 INFO L273 TraceCheckUtils]: 31: Hoare triple {23229#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23229#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:38,516 INFO L273 TraceCheckUtils]: 32: Hoare triple {23229#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {23230#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:38,516 INFO L273 TraceCheckUtils]: 33: Hoare triple {23230#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23230#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:38,517 INFO L273 TraceCheckUtils]: 34: Hoare triple {23230#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23230#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:38,517 INFO L273 TraceCheckUtils]: 35: Hoare triple {23230#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {23231#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:38,518 INFO L273 TraceCheckUtils]: 36: Hoare triple {23231#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23231#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:38,518 INFO L273 TraceCheckUtils]: 37: Hoare triple {23231#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23231#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:38,519 INFO L273 TraceCheckUtils]: 38: Hoare triple {23231#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {23232#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:38,520 INFO L273 TraceCheckUtils]: 39: Hoare triple {23232#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23232#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:38,520 INFO L273 TraceCheckUtils]: 40: Hoare triple {23232#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23232#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:38,521 INFO L273 TraceCheckUtils]: 41: Hoare triple {23232#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {23233#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:38,541 INFO L273 TraceCheckUtils]: 42: Hoare triple {23233#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23233#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:38,555 INFO L273 TraceCheckUtils]: 43: Hoare triple {23233#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23233#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:38,564 INFO L273 TraceCheckUtils]: 44: Hoare triple {23233#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {23234#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:38,577 INFO L273 TraceCheckUtils]: 45: Hoare triple {23234#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23234#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:38,580 INFO L273 TraceCheckUtils]: 46: Hoare triple {23234#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23234#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:38,580 INFO L273 TraceCheckUtils]: 47: Hoare triple {23234#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {23235#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:38,583 INFO L273 TraceCheckUtils]: 48: Hoare triple {23235#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23235#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:38,583 INFO L273 TraceCheckUtils]: 49: Hoare triple {23235#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23235#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:38,585 INFO L273 TraceCheckUtils]: 50: Hoare triple {23235#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {23236#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:38,585 INFO L273 TraceCheckUtils]: 51: Hoare triple {23236#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23236#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:38,585 INFO L273 TraceCheckUtils]: 52: Hoare triple {23236#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23236#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:38,586 INFO L273 TraceCheckUtils]: 53: Hoare triple {23236#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {23237#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:38,586 INFO L273 TraceCheckUtils]: 54: Hoare triple {23237#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23237#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:38,586 INFO L273 TraceCheckUtils]: 55: Hoare triple {23237#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23237#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:38,587 INFO L273 TraceCheckUtils]: 56: Hoare triple {23237#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {23238#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:38,587 INFO L273 TraceCheckUtils]: 57: Hoare triple {23238#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23238#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:38,587 INFO L273 TraceCheckUtils]: 58: Hoare triple {23238#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23238#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:38,588 INFO L273 TraceCheckUtils]: 59: Hoare triple {23238#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {23239#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:38,588 INFO L273 TraceCheckUtils]: 60: Hoare triple {23239#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23239#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:38,588 INFO L273 TraceCheckUtils]: 61: Hoare triple {23239#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23239#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:38,589 INFO L273 TraceCheckUtils]: 62: Hoare triple {23239#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {23240#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:38,589 INFO L273 TraceCheckUtils]: 63: Hoare triple {23240#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23240#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:38,590 INFO L273 TraceCheckUtils]: 64: Hoare triple {23240#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23240#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:38,590 INFO L273 TraceCheckUtils]: 65: Hoare triple {23240#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {23241#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:38,591 INFO L273 TraceCheckUtils]: 66: Hoare triple {23241#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23241#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:38,591 INFO L273 TraceCheckUtils]: 67: Hoare triple {23241#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23241#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:38,592 INFO L273 TraceCheckUtils]: 68: Hoare triple {23241#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {23242#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:38,593 INFO L273 TraceCheckUtils]: 69: Hoare triple {23242#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23242#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:38,593 INFO L273 TraceCheckUtils]: 70: Hoare triple {23242#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23242#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:38,594 INFO L273 TraceCheckUtils]: 71: Hoare triple {23242#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {23243#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:38,594 INFO L273 TraceCheckUtils]: 72: Hoare triple {23243#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23243#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:38,595 INFO L273 TraceCheckUtils]: 73: Hoare triple {23243#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23243#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:38,596 INFO L273 TraceCheckUtils]: 74: Hoare triple {23243#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {23244#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:38,596 INFO L273 TraceCheckUtils]: 75: Hoare triple {23244#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23244#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:38,597 INFO L273 TraceCheckUtils]: 76: Hoare triple {23244#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23244#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:38,597 INFO L273 TraceCheckUtils]: 77: Hoare triple {23244#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {23245#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:38,598 INFO L273 TraceCheckUtils]: 78: Hoare triple {23245#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23245#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:38,598 INFO L273 TraceCheckUtils]: 79: Hoare triple {23245#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23245#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:38,599 INFO L273 TraceCheckUtils]: 80: Hoare triple {23245#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {23246#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:38,599 INFO L273 TraceCheckUtils]: 81: Hoare triple {23246#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23246#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:38,600 INFO L273 TraceCheckUtils]: 82: Hoare triple {23246#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23246#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:38,601 INFO L273 TraceCheckUtils]: 83: Hoare triple {23246#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {23247#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:38,601 INFO L273 TraceCheckUtils]: 84: Hoare triple {23247#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23247#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:38,602 INFO L273 TraceCheckUtils]: 85: Hoare triple {23247#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23247#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:38,602 INFO L273 TraceCheckUtils]: 86: Hoare triple {23247#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {23248#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:38,603 INFO L273 TraceCheckUtils]: 87: Hoare triple {23248#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23248#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:38,603 INFO L273 TraceCheckUtils]: 88: Hoare triple {23248#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23248#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:38,604 INFO L273 TraceCheckUtils]: 89: Hoare triple {23248#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {23249#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:38,605 INFO L273 TraceCheckUtils]: 90: Hoare triple {23249#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23249#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:38,605 INFO L273 TraceCheckUtils]: 91: Hoare triple {23249#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23249#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:38,606 INFO L273 TraceCheckUtils]: 92: Hoare triple {23249#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {23250#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:38,606 INFO L273 TraceCheckUtils]: 93: Hoare triple {23250#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23250#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:38,607 INFO L273 TraceCheckUtils]: 94: Hoare triple {23250#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23250#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:38,608 INFO L273 TraceCheckUtils]: 95: Hoare triple {23250#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {23251#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:38,608 INFO L273 TraceCheckUtils]: 96: Hoare triple {23251#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23251#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:38,609 INFO L273 TraceCheckUtils]: 97: Hoare triple {23251#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23251#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:38,609 INFO L273 TraceCheckUtils]: 98: Hoare triple {23251#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {23252#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:38,610 INFO L273 TraceCheckUtils]: 99: Hoare triple {23252#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23252#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:38,610 INFO L273 TraceCheckUtils]: 100: Hoare triple {23252#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23252#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:38,611 INFO L273 TraceCheckUtils]: 101: Hoare triple {23252#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {23253#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:38,611 INFO L273 TraceCheckUtils]: 102: Hoare triple {23253#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23253#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:38,612 INFO L273 TraceCheckUtils]: 103: Hoare triple {23253#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23253#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:38,613 INFO L273 TraceCheckUtils]: 104: Hoare triple {23253#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {23254#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:38,613 INFO L273 TraceCheckUtils]: 105: Hoare triple {23254#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23254#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:38,614 INFO L273 TraceCheckUtils]: 106: Hoare triple {23254#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23254#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:38,614 INFO L273 TraceCheckUtils]: 107: Hoare triple {23254#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {23255#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:38,615 INFO L273 TraceCheckUtils]: 108: Hoare triple {23255#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23255#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:38,615 INFO L273 TraceCheckUtils]: 109: Hoare triple {23255#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23255#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:38,616 INFO L273 TraceCheckUtils]: 110: Hoare triple {23255#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {23256#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:38,617 INFO L273 TraceCheckUtils]: 111: Hoare triple {23256#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23256#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:38,617 INFO L273 TraceCheckUtils]: 112: Hoare triple {23256#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23256#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:38,618 INFO L273 TraceCheckUtils]: 113: Hoare triple {23256#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {23257#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:38,618 INFO L273 TraceCheckUtils]: 114: Hoare triple {23257#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23257#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:38,619 INFO L273 TraceCheckUtils]: 115: Hoare triple {23257#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23257#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:38,620 INFO L273 TraceCheckUtils]: 116: Hoare triple {23257#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {23258#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:38,620 INFO L273 TraceCheckUtils]: 117: Hoare triple {23258#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23258#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:38,621 INFO L273 TraceCheckUtils]: 118: Hoare triple {23258#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {23258#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:38,621 INFO L273 TraceCheckUtils]: 119: Hoare triple {23258#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {23259#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:38,622 INFO L273 TraceCheckUtils]: 120: Hoare triple {23259#(<= main_~i~0 38)} assume !(~i~0 < 100000); {23220#false} is VALID [2018-11-23 11:56:38,622 INFO L273 TraceCheckUtils]: 121: Hoare triple {23220#false} havoc ~x~0;~x~0 := 0; {23220#false} is VALID [2018-11-23 11:56:38,622 INFO L273 TraceCheckUtils]: 122: Hoare triple {23220#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {23220#false} is VALID [2018-11-23 11:56:38,623 INFO L256 TraceCheckUtils]: 123: Hoare triple {23220#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {23220#false} is VALID [2018-11-23 11:56:38,623 INFO L273 TraceCheckUtils]: 124: Hoare triple {23220#false} ~cond := #in~cond; {23220#false} is VALID [2018-11-23 11:56:38,623 INFO L273 TraceCheckUtils]: 125: Hoare triple {23220#false} assume 0 == ~cond; {23220#false} is VALID [2018-11-23 11:56:38,623 INFO L273 TraceCheckUtils]: 126: Hoare triple {23220#false} assume !false; {23220#false} is VALID [2018-11-23 11:56:38,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:38,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:38,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2018-11-23 11:56:38,657 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 127 [2018-11-23 11:56:38,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:38,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 11:56:38,839 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:38,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 11:56:38,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 11:56:38,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 11:56:38,840 INFO L87 Difference]: Start difference. First operand 132 states and 171 transitions. Second operand 42 states. [2018-11-23 11:56:39,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:39,670 INFO L93 Difference]: Finished difference Result 148 states and 190 transitions. [2018-11-23 11:56:39,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 11:56:39,671 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 127 [2018-11-23 11:56:39,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:39,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:56:39,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 190 transitions. [2018-11-23 11:56:39,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:56:39,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 190 transitions. [2018-11-23 11:56:39,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 190 transitions. [2018-11-23 11:56:39,884 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:39,887 INFO L225 Difference]: With dead ends: 148 [2018-11-23 11:56:39,887 INFO L226 Difference]: Without dead ends: 137 [2018-11-23 11:56:39,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 11:56:39,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-23 11:56:39,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-11-23 11:56:39,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:39,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand 135 states. [2018-11-23 11:56:39,921 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 135 states. [2018-11-23 11:56:39,921 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 135 states. [2018-11-23 11:56:39,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:39,923 INFO L93 Difference]: Finished difference Result 137 states and 178 transitions. [2018-11-23 11:56:39,923 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 178 transitions. [2018-11-23 11:56:39,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:39,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:39,924 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 137 states. [2018-11-23 11:56:39,924 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 137 states. [2018-11-23 11:56:39,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:39,926 INFO L93 Difference]: Finished difference Result 137 states and 178 transitions. [2018-11-23 11:56:39,926 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 178 transitions. [2018-11-23 11:56:39,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:39,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:39,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:39,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:39,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 11:56:39,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 175 transitions. [2018-11-23 11:56:39,928 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 175 transitions. Word has length 127 [2018-11-23 11:56:39,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:39,928 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 175 transitions. [2018-11-23 11:56:39,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 11:56:39,928 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 175 transitions. [2018-11-23 11:56:39,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-23 11:56:39,929 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:39,929 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:39,929 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:39,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:39,929 INFO L82 PathProgramCache]: Analyzing trace with hash -847437405, now seen corresponding path program 39 times [2018-11-23 11:56:39,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:39,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:39,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:39,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:39,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:40,799 INFO L256 TraceCheckUtils]: 0: Hoare triple {24295#true} call ULTIMATE.init(); {24295#true} is VALID [2018-11-23 11:56:40,799 INFO L273 TraceCheckUtils]: 1: Hoare triple {24295#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24295#true} is VALID [2018-11-23 11:56:40,799 INFO L273 TraceCheckUtils]: 2: Hoare triple {24295#true} assume true; {24295#true} is VALID [2018-11-23 11:56:40,800 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24295#true} {24295#true} #55#return; {24295#true} is VALID [2018-11-23 11:56:40,800 INFO L256 TraceCheckUtils]: 4: Hoare triple {24295#true} call #t~ret4 := main(); {24295#true} is VALID [2018-11-23 11:56:40,800 INFO L273 TraceCheckUtils]: 5: Hoare triple {24295#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {24297#(= main_~i~0 0)} is VALID [2018-11-23 11:56:40,801 INFO L273 TraceCheckUtils]: 6: Hoare triple {24297#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24297#(= main_~i~0 0)} is VALID [2018-11-23 11:56:40,801 INFO L273 TraceCheckUtils]: 7: Hoare triple {24297#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24297#(= main_~i~0 0)} is VALID [2018-11-23 11:56:40,802 INFO L273 TraceCheckUtils]: 8: Hoare triple {24297#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {24298#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:40,802 INFO L273 TraceCheckUtils]: 9: Hoare triple {24298#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24298#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:40,803 INFO L273 TraceCheckUtils]: 10: Hoare triple {24298#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24298#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:40,803 INFO L273 TraceCheckUtils]: 11: Hoare triple {24298#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {24299#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:40,803 INFO L273 TraceCheckUtils]: 12: Hoare triple {24299#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24299#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:40,804 INFO L273 TraceCheckUtils]: 13: Hoare triple {24299#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24299#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:40,804 INFO L273 TraceCheckUtils]: 14: Hoare triple {24299#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {24300#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:40,805 INFO L273 TraceCheckUtils]: 15: Hoare triple {24300#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24300#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:40,805 INFO L273 TraceCheckUtils]: 16: Hoare triple {24300#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24300#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:40,806 INFO L273 TraceCheckUtils]: 17: Hoare triple {24300#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {24301#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:40,806 INFO L273 TraceCheckUtils]: 18: Hoare triple {24301#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24301#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:40,807 INFO L273 TraceCheckUtils]: 19: Hoare triple {24301#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24301#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:40,807 INFO L273 TraceCheckUtils]: 20: Hoare triple {24301#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {24302#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:40,808 INFO L273 TraceCheckUtils]: 21: Hoare triple {24302#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24302#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:40,808 INFO L273 TraceCheckUtils]: 22: Hoare triple {24302#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24302#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:40,809 INFO L273 TraceCheckUtils]: 23: Hoare triple {24302#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {24303#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:40,810 INFO L273 TraceCheckUtils]: 24: Hoare triple {24303#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24303#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:40,810 INFO L273 TraceCheckUtils]: 25: Hoare triple {24303#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24303#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:40,811 INFO L273 TraceCheckUtils]: 26: Hoare triple {24303#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {24304#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:40,811 INFO L273 TraceCheckUtils]: 27: Hoare triple {24304#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24304#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:40,812 INFO L273 TraceCheckUtils]: 28: Hoare triple {24304#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24304#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:40,813 INFO L273 TraceCheckUtils]: 29: Hoare triple {24304#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {24305#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:40,813 INFO L273 TraceCheckUtils]: 30: Hoare triple {24305#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24305#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:40,814 INFO L273 TraceCheckUtils]: 31: Hoare triple {24305#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24305#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:40,814 INFO L273 TraceCheckUtils]: 32: Hoare triple {24305#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {24306#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:40,815 INFO L273 TraceCheckUtils]: 33: Hoare triple {24306#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24306#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:40,815 INFO L273 TraceCheckUtils]: 34: Hoare triple {24306#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24306#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:40,816 INFO L273 TraceCheckUtils]: 35: Hoare triple {24306#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {24307#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:40,817 INFO L273 TraceCheckUtils]: 36: Hoare triple {24307#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24307#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:40,817 INFO L273 TraceCheckUtils]: 37: Hoare triple {24307#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24307#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:40,818 INFO L273 TraceCheckUtils]: 38: Hoare triple {24307#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {24308#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:40,818 INFO L273 TraceCheckUtils]: 39: Hoare triple {24308#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24308#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:40,819 INFO L273 TraceCheckUtils]: 40: Hoare triple {24308#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24308#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:40,820 INFO L273 TraceCheckUtils]: 41: Hoare triple {24308#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {24309#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:40,820 INFO L273 TraceCheckUtils]: 42: Hoare triple {24309#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24309#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:40,821 INFO L273 TraceCheckUtils]: 43: Hoare triple {24309#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24309#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:40,822 INFO L273 TraceCheckUtils]: 44: Hoare triple {24309#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {24310#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:40,823 INFO L273 TraceCheckUtils]: 45: Hoare triple {24310#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24310#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:40,823 INFO L273 TraceCheckUtils]: 46: Hoare triple {24310#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24310#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:40,824 INFO L273 TraceCheckUtils]: 47: Hoare triple {24310#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {24311#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:40,825 INFO L273 TraceCheckUtils]: 48: Hoare triple {24311#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24311#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:40,825 INFO L273 TraceCheckUtils]: 49: Hoare triple {24311#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24311#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:40,826 INFO L273 TraceCheckUtils]: 50: Hoare triple {24311#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {24312#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:40,826 INFO L273 TraceCheckUtils]: 51: Hoare triple {24312#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24312#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:40,827 INFO L273 TraceCheckUtils]: 52: Hoare triple {24312#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24312#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:40,827 INFO L273 TraceCheckUtils]: 53: Hoare triple {24312#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {24313#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:40,828 INFO L273 TraceCheckUtils]: 54: Hoare triple {24313#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24313#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:40,828 INFO L273 TraceCheckUtils]: 55: Hoare triple {24313#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24313#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:40,829 INFO L273 TraceCheckUtils]: 56: Hoare triple {24313#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {24314#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:40,830 INFO L273 TraceCheckUtils]: 57: Hoare triple {24314#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24314#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:40,830 INFO L273 TraceCheckUtils]: 58: Hoare triple {24314#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24314#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:40,831 INFO L273 TraceCheckUtils]: 59: Hoare triple {24314#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {24315#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:40,831 INFO L273 TraceCheckUtils]: 60: Hoare triple {24315#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24315#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:40,832 INFO L273 TraceCheckUtils]: 61: Hoare triple {24315#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24315#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:40,833 INFO L273 TraceCheckUtils]: 62: Hoare triple {24315#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {24316#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:40,833 INFO L273 TraceCheckUtils]: 63: Hoare triple {24316#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24316#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:40,834 INFO L273 TraceCheckUtils]: 64: Hoare triple {24316#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24316#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:40,834 INFO L273 TraceCheckUtils]: 65: Hoare triple {24316#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {24317#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:40,835 INFO L273 TraceCheckUtils]: 66: Hoare triple {24317#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24317#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:40,835 INFO L273 TraceCheckUtils]: 67: Hoare triple {24317#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24317#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:40,836 INFO L273 TraceCheckUtils]: 68: Hoare triple {24317#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {24318#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:40,837 INFO L273 TraceCheckUtils]: 69: Hoare triple {24318#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24318#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:40,837 INFO L273 TraceCheckUtils]: 70: Hoare triple {24318#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24318#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:40,838 INFO L273 TraceCheckUtils]: 71: Hoare triple {24318#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {24319#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:40,838 INFO L273 TraceCheckUtils]: 72: Hoare triple {24319#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24319#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:40,839 INFO L273 TraceCheckUtils]: 73: Hoare triple {24319#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24319#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:40,840 INFO L273 TraceCheckUtils]: 74: Hoare triple {24319#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {24320#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:40,840 INFO L273 TraceCheckUtils]: 75: Hoare triple {24320#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24320#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:40,841 INFO L273 TraceCheckUtils]: 76: Hoare triple {24320#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24320#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:40,841 INFO L273 TraceCheckUtils]: 77: Hoare triple {24320#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {24321#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:40,842 INFO L273 TraceCheckUtils]: 78: Hoare triple {24321#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24321#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:40,842 INFO L273 TraceCheckUtils]: 79: Hoare triple {24321#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24321#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:40,843 INFO L273 TraceCheckUtils]: 80: Hoare triple {24321#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {24322#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:40,844 INFO L273 TraceCheckUtils]: 81: Hoare triple {24322#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24322#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:40,844 INFO L273 TraceCheckUtils]: 82: Hoare triple {24322#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24322#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:40,845 INFO L273 TraceCheckUtils]: 83: Hoare triple {24322#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {24323#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:40,845 INFO L273 TraceCheckUtils]: 84: Hoare triple {24323#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24323#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:40,846 INFO L273 TraceCheckUtils]: 85: Hoare triple {24323#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24323#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:40,846 INFO L273 TraceCheckUtils]: 86: Hoare triple {24323#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {24324#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:40,847 INFO L273 TraceCheckUtils]: 87: Hoare triple {24324#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24324#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:40,847 INFO L273 TraceCheckUtils]: 88: Hoare triple {24324#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24324#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:40,848 INFO L273 TraceCheckUtils]: 89: Hoare triple {24324#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {24325#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:40,849 INFO L273 TraceCheckUtils]: 90: Hoare triple {24325#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24325#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:40,849 INFO L273 TraceCheckUtils]: 91: Hoare triple {24325#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24325#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:40,850 INFO L273 TraceCheckUtils]: 92: Hoare triple {24325#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {24326#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:40,850 INFO L273 TraceCheckUtils]: 93: Hoare triple {24326#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24326#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:40,851 INFO L273 TraceCheckUtils]: 94: Hoare triple {24326#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24326#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:40,852 INFO L273 TraceCheckUtils]: 95: Hoare triple {24326#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {24327#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:40,852 INFO L273 TraceCheckUtils]: 96: Hoare triple {24327#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24327#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:40,853 INFO L273 TraceCheckUtils]: 97: Hoare triple {24327#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24327#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:40,853 INFO L273 TraceCheckUtils]: 98: Hoare triple {24327#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {24328#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:40,854 INFO L273 TraceCheckUtils]: 99: Hoare triple {24328#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24328#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:40,854 INFO L273 TraceCheckUtils]: 100: Hoare triple {24328#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24328#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:40,855 INFO L273 TraceCheckUtils]: 101: Hoare triple {24328#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {24329#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:40,856 INFO L273 TraceCheckUtils]: 102: Hoare triple {24329#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24329#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:40,856 INFO L273 TraceCheckUtils]: 103: Hoare triple {24329#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24329#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:40,857 INFO L273 TraceCheckUtils]: 104: Hoare triple {24329#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {24330#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:40,857 INFO L273 TraceCheckUtils]: 105: Hoare triple {24330#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24330#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:40,858 INFO L273 TraceCheckUtils]: 106: Hoare triple {24330#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24330#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:40,859 INFO L273 TraceCheckUtils]: 107: Hoare triple {24330#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {24331#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:40,859 INFO L273 TraceCheckUtils]: 108: Hoare triple {24331#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24331#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:40,860 INFO L273 TraceCheckUtils]: 109: Hoare triple {24331#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24331#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:40,860 INFO L273 TraceCheckUtils]: 110: Hoare triple {24331#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {24332#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:40,861 INFO L273 TraceCheckUtils]: 111: Hoare triple {24332#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24332#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:40,861 INFO L273 TraceCheckUtils]: 112: Hoare triple {24332#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24332#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:40,862 INFO L273 TraceCheckUtils]: 113: Hoare triple {24332#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {24333#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:40,863 INFO L273 TraceCheckUtils]: 114: Hoare triple {24333#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24333#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:40,863 INFO L273 TraceCheckUtils]: 115: Hoare triple {24333#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24333#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:40,864 INFO L273 TraceCheckUtils]: 116: Hoare triple {24333#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {24334#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:40,864 INFO L273 TraceCheckUtils]: 117: Hoare triple {24334#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24334#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:40,865 INFO L273 TraceCheckUtils]: 118: Hoare triple {24334#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24334#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:40,865 INFO L273 TraceCheckUtils]: 119: Hoare triple {24334#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {24335#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:40,866 INFO L273 TraceCheckUtils]: 120: Hoare triple {24335#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24335#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:40,866 INFO L273 TraceCheckUtils]: 121: Hoare triple {24335#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24335#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:40,867 INFO L273 TraceCheckUtils]: 122: Hoare triple {24335#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {24336#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:40,868 INFO L273 TraceCheckUtils]: 123: Hoare triple {24336#(<= main_~i~0 39)} assume !(~i~0 < 100000); {24296#false} is VALID [2018-11-23 11:56:40,868 INFO L273 TraceCheckUtils]: 124: Hoare triple {24296#false} havoc ~x~0;~x~0 := 0; {24296#false} is VALID [2018-11-23 11:56:40,868 INFO L273 TraceCheckUtils]: 125: Hoare triple {24296#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {24296#false} is VALID [2018-11-23 11:56:40,868 INFO L256 TraceCheckUtils]: 126: Hoare triple {24296#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {24296#false} is VALID [2018-11-23 11:56:40,869 INFO L273 TraceCheckUtils]: 127: Hoare triple {24296#false} ~cond := #in~cond; {24296#false} is VALID [2018-11-23 11:56:40,869 INFO L273 TraceCheckUtils]: 128: Hoare triple {24296#false} assume 0 == ~cond; {24296#false} is VALID [2018-11-23 11:56:40,869 INFO L273 TraceCheckUtils]: 129: Hoare triple {24296#false} assume !false; {24296#false} is VALID [2018-11-23 11:56:40,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:40,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:40,884 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:40,895 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:56:40,989 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-11-23 11:56:40,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:41,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:41,345 INFO L256 TraceCheckUtils]: 0: Hoare triple {24295#true} call ULTIMATE.init(); {24295#true} is VALID [2018-11-23 11:56:41,345 INFO L273 TraceCheckUtils]: 1: Hoare triple {24295#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24295#true} is VALID [2018-11-23 11:56:41,345 INFO L273 TraceCheckUtils]: 2: Hoare triple {24295#true} assume true; {24295#true} is VALID [2018-11-23 11:56:41,345 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24295#true} {24295#true} #55#return; {24295#true} is VALID [2018-11-23 11:56:41,346 INFO L256 TraceCheckUtils]: 4: Hoare triple {24295#true} call #t~ret4 := main(); {24295#true} is VALID [2018-11-23 11:56:41,346 INFO L273 TraceCheckUtils]: 5: Hoare triple {24295#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {24355#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:41,347 INFO L273 TraceCheckUtils]: 6: Hoare triple {24355#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24355#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:41,347 INFO L273 TraceCheckUtils]: 7: Hoare triple {24355#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24355#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:41,348 INFO L273 TraceCheckUtils]: 8: Hoare triple {24355#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {24298#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:41,349 INFO L273 TraceCheckUtils]: 9: Hoare triple {24298#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24298#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:41,349 INFO L273 TraceCheckUtils]: 10: Hoare triple {24298#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24298#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:41,350 INFO L273 TraceCheckUtils]: 11: Hoare triple {24298#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {24299#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:41,350 INFO L273 TraceCheckUtils]: 12: Hoare triple {24299#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24299#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:41,351 INFO L273 TraceCheckUtils]: 13: Hoare triple {24299#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24299#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:41,352 INFO L273 TraceCheckUtils]: 14: Hoare triple {24299#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {24300#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:41,352 INFO L273 TraceCheckUtils]: 15: Hoare triple {24300#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24300#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:41,353 INFO L273 TraceCheckUtils]: 16: Hoare triple {24300#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24300#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:41,353 INFO L273 TraceCheckUtils]: 17: Hoare triple {24300#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {24301#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:41,354 INFO L273 TraceCheckUtils]: 18: Hoare triple {24301#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24301#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:41,354 INFO L273 TraceCheckUtils]: 19: Hoare triple {24301#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24301#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:41,355 INFO L273 TraceCheckUtils]: 20: Hoare triple {24301#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {24302#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:41,355 INFO L273 TraceCheckUtils]: 21: Hoare triple {24302#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24302#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:41,356 INFO L273 TraceCheckUtils]: 22: Hoare triple {24302#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24302#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:41,357 INFO L273 TraceCheckUtils]: 23: Hoare triple {24302#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {24303#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:41,357 INFO L273 TraceCheckUtils]: 24: Hoare triple {24303#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24303#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:41,358 INFO L273 TraceCheckUtils]: 25: Hoare triple {24303#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24303#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:41,358 INFO L273 TraceCheckUtils]: 26: Hoare triple {24303#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {24304#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:41,359 INFO L273 TraceCheckUtils]: 27: Hoare triple {24304#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24304#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:41,359 INFO L273 TraceCheckUtils]: 28: Hoare triple {24304#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24304#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:41,360 INFO L273 TraceCheckUtils]: 29: Hoare triple {24304#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {24305#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:41,361 INFO L273 TraceCheckUtils]: 30: Hoare triple {24305#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24305#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:41,361 INFO L273 TraceCheckUtils]: 31: Hoare triple {24305#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24305#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:41,362 INFO L273 TraceCheckUtils]: 32: Hoare triple {24305#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {24306#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:41,362 INFO L273 TraceCheckUtils]: 33: Hoare triple {24306#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24306#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:41,363 INFO L273 TraceCheckUtils]: 34: Hoare triple {24306#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24306#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:41,364 INFO L273 TraceCheckUtils]: 35: Hoare triple {24306#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {24307#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:41,364 INFO L273 TraceCheckUtils]: 36: Hoare triple {24307#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24307#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:41,365 INFO L273 TraceCheckUtils]: 37: Hoare triple {24307#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24307#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:41,365 INFO L273 TraceCheckUtils]: 38: Hoare triple {24307#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {24308#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:41,366 INFO L273 TraceCheckUtils]: 39: Hoare triple {24308#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24308#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:41,366 INFO L273 TraceCheckUtils]: 40: Hoare triple {24308#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24308#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:41,367 INFO L273 TraceCheckUtils]: 41: Hoare triple {24308#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {24309#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:41,386 INFO L273 TraceCheckUtils]: 42: Hoare triple {24309#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24309#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:41,394 INFO L273 TraceCheckUtils]: 43: Hoare triple {24309#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24309#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:41,410 INFO L273 TraceCheckUtils]: 44: Hoare triple {24309#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {24310#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:41,418 INFO L273 TraceCheckUtils]: 45: Hoare triple {24310#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24310#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:41,419 INFO L273 TraceCheckUtils]: 46: Hoare triple {24310#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24310#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:41,419 INFO L273 TraceCheckUtils]: 47: Hoare triple {24310#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {24311#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:41,420 INFO L273 TraceCheckUtils]: 48: Hoare triple {24311#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24311#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:41,420 INFO L273 TraceCheckUtils]: 49: Hoare triple {24311#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24311#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:41,420 INFO L273 TraceCheckUtils]: 50: Hoare triple {24311#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {24312#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:41,421 INFO L273 TraceCheckUtils]: 51: Hoare triple {24312#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24312#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:41,421 INFO L273 TraceCheckUtils]: 52: Hoare triple {24312#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24312#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:41,422 INFO L273 TraceCheckUtils]: 53: Hoare triple {24312#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {24313#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:41,422 INFO L273 TraceCheckUtils]: 54: Hoare triple {24313#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24313#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:41,422 INFO L273 TraceCheckUtils]: 55: Hoare triple {24313#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24313#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:41,423 INFO L273 TraceCheckUtils]: 56: Hoare triple {24313#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {24314#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:41,423 INFO L273 TraceCheckUtils]: 57: Hoare triple {24314#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24314#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:41,424 INFO L273 TraceCheckUtils]: 58: Hoare triple {24314#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24314#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:41,424 INFO L273 TraceCheckUtils]: 59: Hoare triple {24314#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {24315#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:41,425 INFO L273 TraceCheckUtils]: 60: Hoare triple {24315#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24315#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:41,425 INFO L273 TraceCheckUtils]: 61: Hoare triple {24315#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24315#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:41,426 INFO L273 TraceCheckUtils]: 62: Hoare triple {24315#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {24316#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:41,427 INFO L273 TraceCheckUtils]: 63: Hoare triple {24316#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24316#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:41,427 INFO L273 TraceCheckUtils]: 64: Hoare triple {24316#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24316#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:41,428 INFO L273 TraceCheckUtils]: 65: Hoare triple {24316#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {24317#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:41,428 INFO L273 TraceCheckUtils]: 66: Hoare triple {24317#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24317#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:41,429 INFO L273 TraceCheckUtils]: 67: Hoare triple {24317#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24317#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:41,430 INFO L273 TraceCheckUtils]: 68: Hoare triple {24317#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {24318#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:41,430 INFO L273 TraceCheckUtils]: 69: Hoare triple {24318#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24318#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:41,431 INFO L273 TraceCheckUtils]: 70: Hoare triple {24318#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24318#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:41,431 INFO L273 TraceCheckUtils]: 71: Hoare triple {24318#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {24319#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:41,432 INFO L273 TraceCheckUtils]: 72: Hoare triple {24319#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24319#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:41,432 INFO L273 TraceCheckUtils]: 73: Hoare triple {24319#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24319#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:41,433 INFO L273 TraceCheckUtils]: 74: Hoare triple {24319#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {24320#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:41,433 INFO L273 TraceCheckUtils]: 75: Hoare triple {24320#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24320#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:41,434 INFO L273 TraceCheckUtils]: 76: Hoare triple {24320#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24320#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:41,435 INFO L273 TraceCheckUtils]: 77: Hoare triple {24320#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {24321#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:41,435 INFO L273 TraceCheckUtils]: 78: Hoare triple {24321#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24321#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:41,436 INFO L273 TraceCheckUtils]: 79: Hoare triple {24321#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24321#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:41,436 INFO L273 TraceCheckUtils]: 80: Hoare triple {24321#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {24322#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:41,437 INFO L273 TraceCheckUtils]: 81: Hoare triple {24322#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24322#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:41,437 INFO L273 TraceCheckUtils]: 82: Hoare triple {24322#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24322#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:41,438 INFO L273 TraceCheckUtils]: 83: Hoare triple {24322#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {24323#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:41,439 INFO L273 TraceCheckUtils]: 84: Hoare triple {24323#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24323#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:41,439 INFO L273 TraceCheckUtils]: 85: Hoare triple {24323#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24323#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:41,440 INFO L273 TraceCheckUtils]: 86: Hoare triple {24323#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {24324#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:41,440 INFO L273 TraceCheckUtils]: 87: Hoare triple {24324#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24324#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:41,441 INFO L273 TraceCheckUtils]: 88: Hoare triple {24324#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24324#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:41,441 INFO L273 TraceCheckUtils]: 89: Hoare triple {24324#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {24325#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:41,442 INFO L273 TraceCheckUtils]: 90: Hoare triple {24325#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24325#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:41,442 INFO L273 TraceCheckUtils]: 91: Hoare triple {24325#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24325#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:41,443 INFO L273 TraceCheckUtils]: 92: Hoare triple {24325#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {24326#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:41,444 INFO L273 TraceCheckUtils]: 93: Hoare triple {24326#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24326#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:41,444 INFO L273 TraceCheckUtils]: 94: Hoare triple {24326#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24326#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:41,445 INFO L273 TraceCheckUtils]: 95: Hoare triple {24326#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {24327#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:41,445 INFO L273 TraceCheckUtils]: 96: Hoare triple {24327#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24327#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:41,446 INFO L273 TraceCheckUtils]: 97: Hoare triple {24327#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24327#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:41,447 INFO L273 TraceCheckUtils]: 98: Hoare triple {24327#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {24328#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:41,447 INFO L273 TraceCheckUtils]: 99: Hoare triple {24328#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24328#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:41,448 INFO L273 TraceCheckUtils]: 100: Hoare triple {24328#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24328#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:41,448 INFO L273 TraceCheckUtils]: 101: Hoare triple {24328#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {24329#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:41,449 INFO L273 TraceCheckUtils]: 102: Hoare triple {24329#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24329#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:41,449 INFO L273 TraceCheckUtils]: 103: Hoare triple {24329#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24329#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:41,450 INFO L273 TraceCheckUtils]: 104: Hoare triple {24329#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {24330#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:41,452 INFO L273 TraceCheckUtils]: 105: Hoare triple {24330#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24330#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:41,452 INFO L273 TraceCheckUtils]: 106: Hoare triple {24330#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24330#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:41,453 INFO L273 TraceCheckUtils]: 107: Hoare triple {24330#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {24331#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:41,453 INFO L273 TraceCheckUtils]: 108: Hoare triple {24331#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24331#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:41,454 INFO L273 TraceCheckUtils]: 109: Hoare triple {24331#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24331#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:41,455 INFO L273 TraceCheckUtils]: 110: Hoare triple {24331#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {24332#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:41,455 INFO L273 TraceCheckUtils]: 111: Hoare triple {24332#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24332#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:41,456 INFO L273 TraceCheckUtils]: 112: Hoare triple {24332#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24332#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:41,456 INFO L273 TraceCheckUtils]: 113: Hoare triple {24332#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {24333#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:41,457 INFO L273 TraceCheckUtils]: 114: Hoare triple {24333#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24333#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:41,457 INFO L273 TraceCheckUtils]: 115: Hoare triple {24333#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24333#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:41,458 INFO L273 TraceCheckUtils]: 116: Hoare triple {24333#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {24334#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:41,459 INFO L273 TraceCheckUtils]: 117: Hoare triple {24334#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24334#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:41,459 INFO L273 TraceCheckUtils]: 118: Hoare triple {24334#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24334#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:41,460 INFO L273 TraceCheckUtils]: 119: Hoare triple {24334#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {24335#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:41,460 INFO L273 TraceCheckUtils]: 120: Hoare triple {24335#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24335#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:41,461 INFO L273 TraceCheckUtils]: 121: Hoare triple {24335#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {24335#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:41,461 INFO L273 TraceCheckUtils]: 122: Hoare triple {24335#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {24336#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:41,462 INFO L273 TraceCheckUtils]: 123: Hoare triple {24336#(<= main_~i~0 39)} assume !(~i~0 < 100000); {24296#false} is VALID [2018-11-23 11:56:41,462 INFO L273 TraceCheckUtils]: 124: Hoare triple {24296#false} havoc ~x~0;~x~0 := 0; {24296#false} is VALID [2018-11-23 11:56:41,462 INFO L273 TraceCheckUtils]: 125: Hoare triple {24296#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {24296#false} is VALID [2018-11-23 11:56:41,463 INFO L256 TraceCheckUtils]: 126: Hoare triple {24296#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {24296#false} is VALID [2018-11-23 11:56:41,463 INFO L273 TraceCheckUtils]: 127: Hoare triple {24296#false} ~cond := #in~cond; {24296#false} is VALID [2018-11-23 11:56:41,463 INFO L273 TraceCheckUtils]: 128: Hoare triple {24296#false} assume 0 == ~cond; {24296#false} is VALID [2018-11-23 11:56:41,463 INFO L273 TraceCheckUtils]: 129: Hoare triple {24296#false} assume !false; {24296#false} is VALID [2018-11-23 11:56:41,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:41,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:41,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2018-11-23 11:56:41,495 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 130 [2018-11-23 11:56:41,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:41,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states. [2018-11-23 11:56:41,625 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:41,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-23 11:56:41,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-23 11:56:41,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 11:56:41,627 INFO L87 Difference]: Start difference. First operand 135 states and 175 transitions. Second operand 43 states. [2018-11-23 11:56:42,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:42,225 INFO L93 Difference]: Finished difference Result 151 states and 194 transitions. [2018-11-23 11:56:42,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 11:56:42,225 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 130 [2018-11-23 11:56:42,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:42,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:56:42,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 194 transitions. [2018-11-23 11:56:42,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:56:42,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 194 transitions. [2018-11-23 11:56:42,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 194 transitions. [2018-11-23 11:56:42,407 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:42,411 INFO L225 Difference]: With dead ends: 151 [2018-11-23 11:56:42,411 INFO L226 Difference]: Without dead ends: 140 [2018-11-23 11:56:42,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 11:56:42,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-23 11:56:42,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2018-11-23 11:56:42,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:42,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand 138 states. [2018-11-23 11:56:42,485 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 138 states. [2018-11-23 11:56:42,485 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 138 states. [2018-11-23 11:56:42,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:42,487 INFO L93 Difference]: Finished difference Result 140 states and 182 transitions. [2018-11-23 11:56:42,487 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 182 transitions. [2018-11-23 11:56:42,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:42,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:42,487 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 140 states. [2018-11-23 11:56:42,487 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 140 states. [2018-11-23 11:56:42,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:42,489 INFO L93 Difference]: Finished difference Result 140 states and 182 transitions. [2018-11-23 11:56:42,489 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 182 transitions. [2018-11-23 11:56:42,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:42,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:42,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:42,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:42,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-23 11:56:42,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 179 transitions. [2018-11-23 11:56:42,491 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 179 transitions. Word has length 130 [2018-11-23 11:56:42,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:42,492 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 179 transitions. [2018-11-23 11:56:42,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-23 11:56:42,492 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 179 transitions. [2018-11-23 11:56:42,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-23 11:56:42,492 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:42,492 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:42,492 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:42,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:42,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1144600647, now seen corresponding path program 40 times [2018-11-23 11:56:42,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:42,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:42,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:42,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:42,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:43,902 INFO L256 TraceCheckUtils]: 0: Hoare triple {25395#true} call ULTIMATE.init(); {25395#true} is VALID [2018-11-23 11:56:43,903 INFO L273 TraceCheckUtils]: 1: Hoare triple {25395#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25395#true} is VALID [2018-11-23 11:56:43,903 INFO L273 TraceCheckUtils]: 2: Hoare triple {25395#true} assume true; {25395#true} is VALID [2018-11-23 11:56:43,903 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25395#true} {25395#true} #55#return; {25395#true} is VALID [2018-11-23 11:56:43,903 INFO L256 TraceCheckUtils]: 4: Hoare triple {25395#true} call #t~ret4 := main(); {25395#true} is VALID [2018-11-23 11:56:43,904 INFO L273 TraceCheckUtils]: 5: Hoare triple {25395#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {25397#(= main_~i~0 0)} is VALID [2018-11-23 11:56:43,904 INFO L273 TraceCheckUtils]: 6: Hoare triple {25397#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25397#(= main_~i~0 0)} is VALID [2018-11-23 11:56:43,905 INFO L273 TraceCheckUtils]: 7: Hoare triple {25397#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25397#(= main_~i~0 0)} is VALID [2018-11-23 11:56:43,905 INFO L273 TraceCheckUtils]: 8: Hoare triple {25397#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {25398#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:43,906 INFO L273 TraceCheckUtils]: 9: Hoare triple {25398#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25398#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:43,906 INFO L273 TraceCheckUtils]: 10: Hoare triple {25398#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25398#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:43,907 INFO L273 TraceCheckUtils]: 11: Hoare triple {25398#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {25399#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:43,907 INFO L273 TraceCheckUtils]: 12: Hoare triple {25399#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25399#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:43,907 INFO L273 TraceCheckUtils]: 13: Hoare triple {25399#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25399#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:43,908 INFO L273 TraceCheckUtils]: 14: Hoare triple {25399#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {25400#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:43,908 INFO L273 TraceCheckUtils]: 15: Hoare triple {25400#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25400#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:43,908 INFO L273 TraceCheckUtils]: 16: Hoare triple {25400#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25400#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:43,909 INFO L273 TraceCheckUtils]: 17: Hoare triple {25400#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {25401#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:43,910 INFO L273 TraceCheckUtils]: 18: Hoare triple {25401#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25401#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:43,910 INFO L273 TraceCheckUtils]: 19: Hoare triple {25401#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25401#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:43,911 INFO L273 TraceCheckUtils]: 20: Hoare triple {25401#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {25402#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:43,911 INFO L273 TraceCheckUtils]: 21: Hoare triple {25402#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25402#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:43,912 INFO L273 TraceCheckUtils]: 22: Hoare triple {25402#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25402#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:43,913 INFO L273 TraceCheckUtils]: 23: Hoare triple {25402#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {25403#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:43,913 INFO L273 TraceCheckUtils]: 24: Hoare triple {25403#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25403#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:43,913 INFO L273 TraceCheckUtils]: 25: Hoare triple {25403#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25403#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:43,914 INFO L273 TraceCheckUtils]: 26: Hoare triple {25403#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {25404#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:43,915 INFO L273 TraceCheckUtils]: 27: Hoare triple {25404#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25404#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:43,915 INFO L273 TraceCheckUtils]: 28: Hoare triple {25404#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25404#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:43,916 INFO L273 TraceCheckUtils]: 29: Hoare triple {25404#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {25405#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:43,916 INFO L273 TraceCheckUtils]: 30: Hoare triple {25405#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25405#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:43,917 INFO L273 TraceCheckUtils]: 31: Hoare triple {25405#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25405#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:43,918 INFO L273 TraceCheckUtils]: 32: Hoare triple {25405#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {25406#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:43,918 INFO L273 TraceCheckUtils]: 33: Hoare triple {25406#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25406#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:43,919 INFO L273 TraceCheckUtils]: 34: Hoare triple {25406#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25406#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:43,919 INFO L273 TraceCheckUtils]: 35: Hoare triple {25406#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {25407#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:43,920 INFO L273 TraceCheckUtils]: 36: Hoare triple {25407#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25407#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:43,920 INFO L273 TraceCheckUtils]: 37: Hoare triple {25407#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25407#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:43,921 INFO L273 TraceCheckUtils]: 38: Hoare triple {25407#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {25408#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:43,921 INFO L273 TraceCheckUtils]: 39: Hoare triple {25408#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25408#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:43,922 INFO L273 TraceCheckUtils]: 40: Hoare triple {25408#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25408#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:43,923 INFO L273 TraceCheckUtils]: 41: Hoare triple {25408#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {25409#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:43,923 INFO L273 TraceCheckUtils]: 42: Hoare triple {25409#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25409#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:43,924 INFO L273 TraceCheckUtils]: 43: Hoare triple {25409#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25409#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:43,924 INFO L273 TraceCheckUtils]: 44: Hoare triple {25409#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {25410#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:43,925 INFO L273 TraceCheckUtils]: 45: Hoare triple {25410#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25410#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:43,925 INFO L273 TraceCheckUtils]: 46: Hoare triple {25410#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25410#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:43,926 INFO L273 TraceCheckUtils]: 47: Hoare triple {25410#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {25411#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:43,927 INFO L273 TraceCheckUtils]: 48: Hoare triple {25411#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25411#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:43,927 INFO L273 TraceCheckUtils]: 49: Hoare triple {25411#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25411#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:43,928 INFO L273 TraceCheckUtils]: 50: Hoare triple {25411#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {25412#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:43,928 INFO L273 TraceCheckUtils]: 51: Hoare triple {25412#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25412#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:43,929 INFO L273 TraceCheckUtils]: 52: Hoare triple {25412#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25412#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:43,929 INFO L273 TraceCheckUtils]: 53: Hoare triple {25412#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {25413#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:43,930 INFO L273 TraceCheckUtils]: 54: Hoare triple {25413#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25413#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:43,930 INFO L273 TraceCheckUtils]: 55: Hoare triple {25413#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25413#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:43,931 INFO L273 TraceCheckUtils]: 56: Hoare triple {25413#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {25414#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:43,932 INFO L273 TraceCheckUtils]: 57: Hoare triple {25414#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25414#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:43,932 INFO L273 TraceCheckUtils]: 58: Hoare triple {25414#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25414#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:43,933 INFO L273 TraceCheckUtils]: 59: Hoare triple {25414#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {25415#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:43,933 INFO L273 TraceCheckUtils]: 60: Hoare triple {25415#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25415#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:43,934 INFO L273 TraceCheckUtils]: 61: Hoare triple {25415#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25415#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:43,935 INFO L273 TraceCheckUtils]: 62: Hoare triple {25415#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {25416#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:43,935 INFO L273 TraceCheckUtils]: 63: Hoare triple {25416#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25416#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:43,936 INFO L273 TraceCheckUtils]: 64: Hoare triple {25416#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25416#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:43,936 INFO L273 TraceCheckUtils]: 65: Hoare triple {25416#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {25417#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:43,937 INFO L273 TraceCheckUtils]: 66: Hoare triple {25417#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25417#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:43,937 INFO L273 TraceCheckUtils]: 67: Hoare triple {25417#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25417#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:43,938 INFO L273 TraceCheckUtils]: 68: Hoare triple {25417#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {25418#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:43,938 INFO L273 TraceCheckUtils]: 69: Hoare triple {25418#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25418#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:43,939 INFO L273 TraceCheckUtils]: 70: Hoare triple {25418#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25418#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:43,940 INFO L273 TraceCheckUtils]: 71: Hoare triple {25418#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {25419#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:43,940 INFO L273 TraceCheckUtils]: 72: Hoare triple {25419#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25419#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:43,941 INFO L273 TraceCheckUtils]: 73: Hoare triple {25419#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25419#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:43,941 INFO L273 TraceCheckUtils]: 74: Hoare triple {25419#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {25420#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:43,942 INFO L273 TraceCheckUtils]: 75: Hoare triple {25420#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25420#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:43,942 INFO L273 TraceCheckUtils]: 76: Hoare triple {25420#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25420#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:43,943 INFO L273 TraceCheckUtils]: 77: Hoare triple {25420#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {25421#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:43,944 INFO L273 TraceCheckUtils]: 78: Hoare triple {25421#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25421#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:43,944 INFO L273 TraceCheckUtils]: 79: Hoare triple {25421#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25421#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:43,945 INFO L273 TraceCheckUtils]: 80: Hoare triple {25421#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {25422#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:43,945 INFO L273 TraceCheckUtils]: 81: Hoare triple {25422#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25422#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:43,946 INFO L273 TraceCheckUtils]: 82: Hoare triple {25422#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25422#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:43,946 INFO L273 TraceCheckUtils]: 83: Hoare triple {25422#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {25423#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:43,947 INFO L273 TraceCheckUtils]: 84: Hoare triple {25423#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25423#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:43,947 INFO L273 TraceCheckUtils]: 85: Hoare triple {25423#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25423#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:43,948 INFO L273 TraceCheckUtils]: 86: Hoare triple {25423#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {25424#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:43,949 INFO L273 TraceCheckUtils]: 87: Hoare triple {25424#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25424#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:43,949 INFO L273 TraceCheckUtils]: 88: Hoare triple {25424#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25424#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:43,950 INFO L273 TraceCheckUtils]: 89: Hoare triple {25424#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {25425#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:43,950 INFO L273 TraceCheckUtils]: 90: Hoare triple {25425#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25425#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:43,951 INFO L273 TraceCheckUtils]: 91: Hoare triple {25425#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25425#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:43,952 INFO L273 TraceCheckUtils]: 92: Hoare triple {25425#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {25426#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:43,952 INFO L273 TraceCheckUtils]: 93: Hoare triple {25426#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25426#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:43,952 INFO L273 TraceCheckUtils]: 94: Hoare triple {25426#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25426#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:43,953 INFO L273 TraceCheckUtils]: 95: Hoare triple {25426#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {25427#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:43,954 INFO L273 TraceCheckUtils]: 96: Hoare triple {25427#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25427#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:43,954 INFO L273 TraceCheckUtils]: 97: Hoare triple {25427#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25427#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:43,955 INFO L273 TraceCheckUtils]: 98: Hoare triple {25427#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {25428#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:43,955 INFO L273 TraceCheckUtils]: 99: Hoare triple {25428#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25428#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:43,956 INFO L273 TraceCheckUtils]: 100: Hoare triple {25428#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25428#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:43,957 INFO L273 TraceCheckUtils]: 101: Hoare triple {25428#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {25429#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:43,957 INFO L273 TraceCheckUtils]: 102: Hoare triple {25429#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25429#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:43,958 INFO L273 TraceCheckUtils]: 103: Hoare triple {25429#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25429#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:43,958 INFO L273 TraceCheckUtils]: 104: Hoare triple {25429#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {25430#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:43,959 INFO L273 TraceCheckUtils]: 105: Hoare triple {25430#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25430#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:43,959 INFO L273 TraceCheckUtils]: 106: Hoare triple {25430#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25430#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:43,960 INFO L273 TraceCheckUtils]: 107: Hoare triple {25430#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {25431#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:43,960 INFO L273 TraceCheckUtils]: 108: Hoare triple {25431#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25431#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:43,961 INFO L273 TraceCheckUtils]: 109: Hoare triple {25431#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25431#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:43,962 INFO L273 TraceCheckUtils]: 110: Hoare triple {25431#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {25432#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:43,962 INFO L273 TraceCheckUtils]: 111: Hoare triple {25432#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25432#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:43,963 INFO L273 TraceCheckUtils]: 112: Hoare triple {25432#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25432#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:43,963 INFO L273 TraceCheckUtils]: 113: Hoare triple {25432#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {25433#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:43,964 INFO L273 TraceCheckUtils]: 114: Hoare triple {25433#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25433#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:43,964 INFO L273 TraceCheckUtils]: 115: Hoare triple {25433#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25433#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:43,965 INFO L273 TraceCheckUtils]: 116: Hoare triple {25433#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {25434#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:43,966 INFO L273 TraceCheckUtils]: 117: Hoare triple {25434#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25434#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:43,966 INFO L273 TraceCheckUtils]: 118: Hoare triple {25434#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25434#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:43,967 INFO L273 TraceCheckUtils]: 119: Hoare triple {25434#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {25435#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:43,967 INFO L273 TraceCheckUtils]: 120: Hoare triple {25435#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25435#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:43,968 INFO L273 TraceCheckUtils]: 121: Hoare triple {25435#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25435#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:43,968 INFO L273 TraceCheckUtils]: 122: Hoare triple {25435#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {25436#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:43,969 INFO L273 TraceCheckUtils]: 123: Hoare triple {25436#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25436#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:43,969 INFO L273 TraceCheckUtils]: 124: Hoare triple {25436#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25436#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:43,970 INFO L273 TraceCheckUtils]: 125: Hoare triple {25436#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {25437#(<= main_~i~0 40)} is VALID [2018-11-23 11:56:43,971 INFO L273 TraceCheckUtils]: 126: Hoare triple {25437#(<= main_~i~0 40)} assume !(~i~0 < 100000); {25396#false} is VALID [2018-11-23 11:56:43,971 INFO L273 TraceCheckUtils]: 127: Hoare triple {25396#false} havoc ~x~0;~x~0 := 0; {25396#false} is VALID [2018-11-23 11:56:43,971 INFO L273 TraceCheckUtils]: 128: Hoare triple {25396#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {25396#false} is VALID [2018-11-23 11:56:43,971 INFO L256 TraceCheckUtils]: 129: Hoare triple {25396#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {25396#false} is VALID [2018-11-23 11:56:43,972 INFO L273 TraceCheckUtils]: 130: Hoare triple {25396#false} ~cond := #in~cond; {25396#false} is VALID [2018-11-23 11:56:43,972 INFO L273 TraceCheckUtils]: 131: Hoare triple {25396#false} assume 0 == ~cond; {25396#false} is VALID [2018-11-23 11:56:43,972 INFO L273 TraceCheckUtils]: 132: Hoare triple {25396#false} assume !false; {25396#false} is VALID [2018-11-23 11:56:43,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:43,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:43,985 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:43,992 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:56:44,056 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:56:44,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:44,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:44,370 INFO L256 TraceCheckUtils]: 0: Hoare triple {25395#true} call ULTIMATE.init(); {25395#true} is VALID [2018-11-23 11:56:44,370 INFO L273 TraceCheckUtils]: 1: Hoare triple {25395#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25395#true} is VALID [2018-11-23 11:56:44,370 INFO L273 TraceCheckUtils]: 2: Hoare triple {25395#true} assume true; {25395#true} is VALID [2018-11-23 11:56:44,371 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25395#true} {25395#true} #55#return; {25395#true} is VALID [2018-11-23 11:56:44,371 INFO L256 TraceCheckUtils]: 4: Hoare triple {25395#true} call #t~ret4 := main(); {25395#true} is VALID [2018-11-23 11:56:44,371 INFO L273 TraceCheckUtils]: 5: Hoare triple {25395#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {25456#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:44,372 INFO L273 TraceCheckUtils]: 6: Hoare triple {25456#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25456#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:44,372 INFO L273 TraceCheckUtils]: 7: Hoare triple {25456#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25456#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:44,373 INFO L273 TraceCheckUtils]: 8: Hoare triple {25456#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {25398#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:44,373 INFO L273 TraceCheckUtils]: 9: Hoare triple {25398#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25398#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:44,373 INFO L273 TraceCheckUtils]: 10: Hoare triple {25398#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25398#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:44,374 INFO L273 TraceCheckUtils]: 11: Hoare triple {25398#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {25399#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:44,374 INFO L273 TraceCheckUtils]: 12: Hoare triple {25399#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25399#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:44,374 INFO L273 TraceCheckUtils]: 13: Hoare triple {25399#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25399#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:44,375 INFO L273 TraceCheckUtils]: 14: Hoare triple {25399#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {25400#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:44,375 INFO L273 TraceCheckUtils]: 15: Hoare triple {25400#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25400#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:44,376 INFO L273 TraceCheckUtils]: 16: Hoare triple {25400#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25400#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:44,376 INFO L273 TraceCheckUtils]: 17: Hoare triple {25400#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {25401#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:44,377 INFO L273 TraceCheckUtils]: 18: Hoare triple {25401#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25401#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:44,377 INFO L273 TraceCheckUtils]: 19: Hoare triple {25401#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25401#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:44,378 INFO L273 TraceCheckUtils]: 20: Hoare triple {25401#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {25402#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:44,378 INFO L273 TraceCheckUtils]: 21: Hoare triple {25402#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25402#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:44,379 INFO L273 TraceCheckUtils]: 22: Hoare triple {25402#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25402#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:44,380 INFO L273 TraceCheckUtils]: 23: Hoare triple {25402#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {25403#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:44,380 INFO L273 TraceCheckUtils]: 24: Hoare triple {25403#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25403#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:44,381 INFO L273 TraceCheckUtils]: 25: Hoare triple {25403#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25403#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:44,381 INFO L273 TraceCheckUtils]: 26: Hoare triple {25403#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {25404#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:44,382 INFO L273 TraceCheckUtils]: 27: Hoare triple {25404#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25404#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:44,382 INFO L273 TraceCheckUtils]: 28: Hoare triple {25404#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25404#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:44,383 INFO L273 TraceCheckUtils]: 29: Hoare triple {25404#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {25405#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:44,384 INFO L273 TraceCheckUtils]: 30: Hoare triple {25405#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25405#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:44,384 INFO L273 TraceCheckUtils]: 31: Hoare triple {25405#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25405#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:44,385 INFO L273 TraceCheckUtils]: 32: Hoare triple {25405#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {25406#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:44,385 INFO L273 TraceCheckUtils]: 33: Hoare triple {25406#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25406#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:44,386 INFO L273 TraceCheckUtils]: 34: Hoare triple {25406#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25406#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:44,386 INFO L273 TraceCheckUtils]: 35: Hoare triple {25406#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {25407#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:44,387 INFO L273 TraceCheckUtils]: 36: Hoare triple {25407#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25407#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:44,387 INFO L273 TraceCheckUtils]: 37: Hoare triple {25407#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25407#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:44,388 INFO L273 TraceCheckUtils]: 38: Hoare triple {25407#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {25408#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:44,389 INFO L273 TraceCheckUtils]: 39: Hoare triple {25408#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25408#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:44,389 INFO L273 TraceCheckUtils]: 40: Hoare triple {25408#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25408#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:44,390 INFO L273 TraceCheckUtils]: 41: Hoare triple {25408#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {25409#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:44,390 INFO L273 TraceCheckUtils]: 42: Hoare triple {25409#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25409#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:44,391 INFO L273 TraceCheckUtils]: 43: Hoare triple {25409#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25409#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:44,392 INFO L273 TraceCheckUtils]: 44: Hoare triple {25409#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {25410#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:44,392 INFO L273 TraceCheckUtils]: 45: Hoare triple {25410#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25410#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:44,392 INFO L273 TraceCheckUtils]: 46: Hoare triple {25410#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25410#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:44,393 INFO L273 TraceCheckUtils]: 47: Hoare triple {25410#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {25411#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:44,394 INFO L273 TraceCheckUtils]: 48: Hoare triple {25411#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25411#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:44,394 INFO L273 TraceCheckUtils]: 49: Hoare triple {25411#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25411#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:44,395 INFO L273 TraceCheckUtils]: 50: Hoare triple {25411#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {25412#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:44,395 INFO L273 TraceCheckUtils]: 51: Hoare triple {25412#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25412#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:44,396 INFO L273 TraceCheckUtils]: 52: Hoare triple {25412#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25412#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:44,397 INFO L273 TraceCheckUtils]: 53: Hoare triple {25412#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {25413#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:44,397 INFO L273 TraceCheckUtils]: 54: Hoare triple {25413#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25413#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:44,398 INFO L273 TraceCheckUtils]: 55: Hoare triple {25413#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25413#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:44,398 INFO L273 TraceCheckUtils]: 56: Hoare triple {25413#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {25414#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:44,399 INFO L273 TraceCheckUtils]: 57: Hoare triple {25414#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25414#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:44,399 INFO L273 TraceCheckUtils]: 58: Hoare triple {25414#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25414#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:44,400 INFO L273 TraceCheckUtils]: 59: Hoare triple {25414#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {25415#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:44,400 INFO L273 TraceCheckUtils]: 60: Hoare triple {25415#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25415#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:44,401 INFO L273 TraceCheckUtils]: 61: Hoare triple {25415#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25415#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:44,402 INFO L273 TraceCheckUtils]: 62: Hoare triple {25415#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {25416#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:44,402 INFO L273 TraceCheckUtils]: 63: Hoare triple {25416#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25416#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:44,403 INFO L273 TraceCheckUtils]: 64: Hoare triple {25416#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25416#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:44,403 INFO L273 TraceCheckUtils]: 65: Hoare triple {25416#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {25417#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:44,404 INFO L273 TraceCheckUtils]: 66: Hoare triple {25417#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25417#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:44,404 INFO L273 TraceCheckUtils]: 67: Hoare triple {25417#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25417#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:44,405 INFO L273 TraceCheckUtils]: 68: Hoare triple {25417#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {25418#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:44,406 INFO L273 TraceCheckUtils]: 69: Hoare triple {25418#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25418#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:44,406 INFO L273 TraceCheckUtils]: 70: Hoare triple {25418#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25418#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:44,407 INFO L273 TraceCheckUtils]: 71: Hoare triple {25418#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {25419#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:44,407 INFO L273 TraceCheckUtils]: 72: Hoare triple {25419#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25419#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:44,408 INFO L273 TraceCheckUtils]: 73: Hoare triple {25419#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25419#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:44,408 INFO L273 TraceCheckUtils]: 74: Hoare triple {25419#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {25420#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:44,409 INFO L273 TraceCheckUtils]: 75: Hoare triple {25420#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25420#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:44,409 INFO L273 TraceCheckUtils]: 76: Hoare triple {25420#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25420#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:44,410 INFO L273 TraceCheckUtils]: 77: Hoare triple {25420#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {25421#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:44,411 INFO L273 TraceCheckUtils]: 78: Hoare triple {25421#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25421#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:44,411 INFO L273 TraceCheckUtils]: 79: Hoare triple {25421#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25421#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:44,412 INFO L273 TraceCheckUtils]: 80: Hoare triple {25421#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {25422#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:44,412 INFO L273 TraceCheckUtils]: 81: Hoare triple {25422#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25422#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:44,413 INFO L273 TraceCheckUtils]: 82: Hoare triple {25422#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25422#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:44,414 INFO L273 TraceCheckUtils]: 83: Hoare triple {25422#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {25423#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:44,414 INFO L273 TraceCheckUtils]: 84: Hoare triple {25423#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25423#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:44,415 INFO L273 TraceCheckUtils]: 85: Hoare triple {25423#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25423#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:44,415 INFO L273 TraceCheckUtils]: 86: Hoare triple {25423#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {25424#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:44,416 INFO L273 TraceCheckUtils]: 87: Hoare triple {25424#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25424#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:44,416 INFO L273 TraceCheckUtils]: 88: Hoare triple {25424#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25424#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:44,417 INFO L273 TraceCheckUtils]: 89: Hoare triple {25424#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {25425#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:44,417 INFO L273 TraceCheckUtils]: 90: Hoare triple {25425#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25425#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:44,418 INFO L273 TraceCheckUtils]: 91: Hoare triple {25425#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25425#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:44,419 INFO L273 TraceCheckUtils]: 92: Hoare triple {25425#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {25426#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:44,419 INFO L273 TraceCheckUtils]: 93: Hoare triple {25426#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25426#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:44,420 INFO L273 TraceCheckUtils]: 94: Hoare triple {25426#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25426#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:44,420 INFO L273 TraceCheckUtils]: 95: Hoare triple {25426#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {25427#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:44,421 INFO L273 TraceCheckUtils]: 96: Hoare triple {25427#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25427#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:44,421 INFO L273 TraceCheckUtils]: 97: Hoare triple {25427#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25427#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:44,422 INFO L273 TraceCheckUtils]: 98: Hoare triple {25427#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {25428#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:44,423 INFO L273 TraceCheckUtils]: 99: Hoare triple {25428#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25428#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:44,423 INFO L273 TraceCheckUtils]: 100: Hoare triple {25428#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25428#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:44,424 INFO L273 TraceCheckUtils]: 101: Hoare triple {25428#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {25429#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:44,424 INFO L273 TraceCheckUtils]: 102: Hoare triple {25429#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25429#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:44,425 INFO L273 TraceCheckUtils]: 103: Hoare triple {25429#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25429#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:44,425 INFO L273 TraceCheckUtils]: 104: Hoare triple {25429#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {25430#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:44,426 INFO L273 TraceCheckUtils]: 105: Hoare triple {25430#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25430#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:44,426 INFO L273 TraceCheckUtils]: 106: Hoare triple {25430#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25430#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:44,427 INFO L273 TraceCheckUtils]: 107: Hoare triple {25430#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {25431#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:44,428 INFO L273 TraceCheckUtils]: 108: Hoare triple {25431#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25431#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:44,428 INFO L273 TraceCheckUtils]: 109: Hoare triple {25431#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25431#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:44,429 INFO L273 TraceCheckUtils]: 110: Hoare triple {25431#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {25432#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:44,429 INFO L273 TraceCheckUtils]: 111: Hoare triple {25432#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25432#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:44,430 INFO L273 TraceCheckUtils]: 112: Hoare triple {25432#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25432#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:44,431 INFO L273 TraceCheckUtils]: 113: Hoare triple {25432#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {25433#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:44,431 INFO L273 TraceCheckUtils]: 114: Hoare triple {25433#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25433#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:44,432 INFO L273 TraceCheckUtils]: 115: Hoare triple {25433#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25433#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:44,432 INFO L273 TraceCheckUtils]: 116: Hoare triple {25433#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {25434#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:44,433 INFO L273 TraceCheckUtils]: 117: Hoare triple {25434#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25434#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:44,433 INFO L273 TraceCheckUtils]: 118: Hoare triple {25434#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25434#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:44,434 INFO L273 TraceCheckUtils]: 119: Hoare triple {25434#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {25435#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:44,434 INFO L273 TraceCheckUtils]: 120: Hoare triple {25435#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25435#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:44,435 INFO L273 TraceCheckUtils]: 121: Hoare triple {25435#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25435#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:44,436 INFO L273 TraceCheckUtils]: 122: Hoare triple {25435#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {25436#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:44,436 INFO L273 TraceCheckUtils]: 123: Hoare triple {25436#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25436#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:44,437 INFO L273 TraceCheckUtils]: 124: Hoare triple {25436#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {25436#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:44,437 INFO L273 TraceCheckUtils]: 125: Hoare triple {25436#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {25437#(<= main_~i~0 40)} is VALID [2018-11-23 11:56:44,438 INFO L273 TraceCheckUtils]: 126: Hoare triple {25437#(<= main_~i~0 40)} assume !(~i~0 < 100000); {25396#false} is VALID [2018-11-23 11:56:44,438 INFO L273 TraceCheckUtils]: 127: Hoare triple {25396#false} havoc ~x~0;~x~0 := 0; {25396#false} is VALID [2018-11-23 11:56:44,438 INFO L273 TraceCheckUtils]: 128: Hoare triple {25396#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {25396#false} is VALID [2018-11-23 11:56:44,439 INFO L256 TraceCheckUtils]: 129: Hoare triple {25396#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {25396#false} is VALID [2018-11-23 11:56:44,439 INFO L273 TraceCheckUtils]: 130: Hoare triple {25396#false} ~cond := #in~cond; {25396#false} is VALID [2018-11-23 11:56:44,439 INFO L273 TraceCheckUtils]: 131: Hoare triple {25396#false} assume 0 == ~cond; {25396#false} is VALID [2018-11-23 11:56:44,439 INFO L273 TraceCheckUtils]: 132: Hoare triple {25396#false} assume !false; {25396#false} is VALID [2018-11-23 11:56:44,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:44,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:44,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2018-11-23 11:56:44,470 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 133 [2018-11-23 11:56:44,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:44,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2018-11-23 11:56:44,634 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:44,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-23 11:56:44,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-23 11:56:44,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 11:56:44,636 INFO L87 Difference]: Start difference. First operand 138 states and 179 transitions. Second operand 44 states. [2018-11-23 11:56:45,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:45,624 INFO L93 Difference]: Finished difference Result 154 states and 198 transitions. [2018-11-23 11:56:45,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 11:56:45,624 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 133 [2018-11-23 11:56:45,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:45,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:56:45,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 198 transitions. [2018-11-23 11:56:45,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:56:45,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 198 transitions. [2018-11-23 11:56:45,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 198 transitions. [2018-11-23 11:56:45,838 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:45,841 INFO L225 Difference]: With dead ends: 154 [2018-11-23 11:56:45,841 INFO L226 Difference]: Without dead ends: 143 [2018-11-23 11:56:45,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 11:56:45,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-23 11:56:45,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-11-23 11:56:45,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:45,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand 141 states. [2018-11-23 11:56:45,907 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 141 states. [2018-11-23 11:56:45,908 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 141 states. [2018-11-23 11:56:45,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:45,911 INFO L93 Difference]: Finished difference Result 143 states and 186 transitions. [2018-11-23 11:56:45,911 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 186 transitions. [2018-11-23 11:56:45,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:45,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:45,911 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 143 states. [2018-11-23 11:56:45,912 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 143 states. [2018-11-23 11:56:45,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:45,913 INFO L93 Difference]: Finished difference Result 143 states and 186 transitions. [2018-11-23 11:56:45,913 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 186 transitions. [2018-11-23 11:56:45,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:45,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:45,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:45,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:45,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-23 11:56:45,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 183 transitions. [2018-11-23 11:56:45,916 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 183 transitions. Word has length 133 [2018-11-23 11:56:45,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:45,917 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 183 transitions. [2018-11-23 11:56:45,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-23 11:56:45,917 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 183 transitions. [2018-11-23 11:56:45,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-23 11:56:45,917 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:45,917 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:45,917 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:45,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:45,918 INFO L82 PathProgramCache]: Analyzing trace with hash -2007146013, now seen corresponding path program 41 times [2018-11-23 11:56:45,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:45,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:45,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:45,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:45,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:45,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:46,988 INFO L256 TraceCheckUtils]: 0: Hoare triple {26519#true} call ULTIMATE.init(); {26519#true} is VALID [2018-11-23 11:56:46,989 INFO L273 TraceCheckUtils]: 1: Hoare triple {26519#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26519#true} is VALID [2018-11-23 11:56:46,989 INFO L273 TraceCheckUtils]: 2: Hoare triple {26519#true} assume true; {26519#true} is VALID [2018-11-23 11:56:46,989 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26519#true} {26519#true} #55#return; {26519#true} is VALID [2018-11-23 11:56:46,989 INFO L256 TraceCheckUtils]: 4: Hoare triple {26519#true} call #t~ret4 := main(); {26519#true} is VALID [2018-11-23 11:56:46,990 INFO L273 TraceCheckUtils]: 5: Hoare triple {26519#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {26521#(= main_~i~0 0)} is VALID [2018-11-23 11:56:46,990 INFO L273 TraceCheckUtils]: 6: Hoare triple {26521#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26521#(= main_~i~0 0)} is VALID [2018-11-23 11:56:46,991 INFO L273 TraceCheckUtils]: 7: Hoare triple {26521#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26521#(= main_~i~0 0)} is VALID [2018-11-23 11:56:46,991 INFO L273 TraceCheckUtils]: 8: Hoare triple {26521#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {26522#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:46,992 INFO L273 TraceCheckUtils]: 9: Hoare triple {26522#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26522#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:46,992 INFO L273 TraceCheckUtils]: 10: Hoare triple {26522#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26522#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:46,993 INFO L273 TraceCheckUtils]: 11: Hoare triple {26522#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {26523#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:46,994 INFO L273 TraceCheckUtils]: 12: Hoare triple {26523#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26523#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:46,994 INFO L273 TraceCheckUtils]: 13: Hoare triple {26523#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26523#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:46,995 INFO L273 TraceCheckUtils]: 14: Hoare triple {26523#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {26524#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:46,995 INFO L273 TraceCheckUtils]: 15: Hoare triple {26524#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26524#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:46,996 INFO L273 TraceCheckUtils]: 16: Hoare triple {26524#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26524#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:46,996 INFO L273 TraceCheckUtils]: 17: Hoare triple {26524#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {26525#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:46,997 INFO L273 TraceCheckUtils]: 18: Hoare triple {26525#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26525#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:46,997 INFO L273 TraceCheckUtils]: 19: Hoare triple {26525#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26525#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:46,998 INFO L273 TraceCheckUtils]: 20: Hoare triple {26525#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {26526#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:46,999 INFO L273 TraceCheckUtils]: 21: Hoare triple {26526#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26526#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:46,999 INFO L273 TraceCheckUtils]: 22: Hoare triple {26526#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26526#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:47,000 INFO L273 TraceCheckUtils]: 23: Hoare triple {26526#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {26527#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:47,000 INFO L273 TraceCheckUtils]: 24: Hoare triple {26527#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26527#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:47,001 INFO L273 TraceCheckUtils]: 25: Hoare triple {26527#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26527#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:47,002 INFO L273 TraceCheckUtils]: 26: Hoare triple {26527#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {26528#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:47,002 INFO L273 TraceCheckUtils]: 27: Hoare triple {26528#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26528#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:47,003 INFO L273 TraceCheckUtils]: 28: Hoare triple {26528#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26528#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:47,003 INFO L273 TraceCheckUtils]: 29: Hoare triple {26528#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {26529#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:47,004 INFO L273 TraceCheckUtils]: 30: Hoare triple {26529#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26529#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:47,004 INFO L273 TraceCheckUtils]: 31: Hoare triple {26529#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26529#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:47,005 INFO L273 TraceCheckUtils]: 32: Hoare triple {26529#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {26530#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:47,005 INFO L273 TraceCheckUtils]: 33: Hoare triple {26530#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26530#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:47,006 INFO L273 TraceCheckUtils]: 34: Hoare triple {26530#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26530#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:47,007 INFO L273 TraceCheckUtils]: 35: Hoare triple {26530#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {26531#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:47,007 INFO L273 TraceCheckUtils]: 36: Hoare triple {26531#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26531#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:47,008 INFO L273 TraceCheckUtils]: 37: Hoare triple {26531#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26531#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:47,008 INFO L273 TraceCheckUtils]: 38: Hoare triple {26531#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {26532#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:47,009 INFO L273 TraceCheckUtils]: 39: Hoare triple {26532#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26532#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:47,009 INFO L273 TraceCheckUtils]: 40: Hoare triple {26532#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26532#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:47,010 INFO L273 TraceCheckUtils]: 41: Hoare triple {26532#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {26533#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:47,011 INFO L273 TraceCheckUtils]: 42: Hoare triple {26533#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26533#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:47,011 INFO L273 TraceCheckUtils]: 43: Hoare triple {26533#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26533#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:47,012 INFO L273 TraceCheckUtils]: 44: Hoare triple {26533#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {26534#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:47,012 INFO L273 TraceCheckUtils]: 45: Hoare triple {26534#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26534#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:47,013 INFO L273 TraceCheckUtils]: 46: Hoare triple {26534#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26534#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:47,013 INFO L273 TraceCheckUtils]: 47: Hoare triple {26534#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {26535#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:47,014 INFO L273 TraceCheckUtils]: 48: Hoare triple {26535#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26535#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:47,014 INFO L273 TraceCheckUtils]: 49: Hoare triple {26535#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26535#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:47,015 INFO L273 TraceCheckUtils]: 50: Hoare triple {26535#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {26536#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:47,016 INFO L273 TraceCheckUtils]: 51: Hoare triple {26536#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26536#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:47,016 INFO L273 TraceCheckUtils]: 52: Hoare triple {26536#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26536#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:47,017 INFO L273 TraceCheckUtils]: 53: Hoare triple {26536#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {26537#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:47,017 INFO L273 TraceCheckUtils]: 54: Hoare triple {26537#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26537#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:47,018 INFO L273 TraceCheckUtils]: 55: Hoare triple {26537#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26537#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:47,019 INFO L273 TraceCheckUtils]: 56: Hoare triple {26537#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {26538#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:47,019 INFO L273 TraceCheckUtils]: 57: Hoare triple {26538#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26538#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:47,020 INFO L273 TraceCheckUtils]: 58: Hoare triple {26538#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26538#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:47,020 INFO L273 TraceCheckUtils]: 59: Hoare triple {26538#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {26539#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:47,021 INFO L273 TraceCheckUtils]: 60: Hoare triple {26539#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26539#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:47,021 INFO L273 TraceCheckUtils]: 61: Hoare triple {26539#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26539#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:47,022 INFO L273 TraceCheckUtils]: 62: Hoare triple {26539#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {26540#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:47,023 INFO L273 TraceCheckUtils]: 63: Hoare triple {26540#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26540#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:47,023 INFO L273 TraceCheckUtils]: 64: Hoare triple {26540#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26540#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:47,024 INFO L273 TraceCheckUtils]: 65: Hoare triple {26540#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {26541#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:47,024 INFO L273 TraceCheckUtils]: 66: Hoare triple {26541#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26541#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:47,025 INFO L273 TraceCheckUtils]: 67: Hoare triple {26541#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26541#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:47,025 INFO L273 TraceCheckUtils]: 68: Hoare triple {26541#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {26542#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:47,026 INFO L273 TraceCheckUtils]: 69: Hoare triple {26542#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26542#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:47,026 INFO L273 TraceCheckUtils]: 70: Hoare triple {26542#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26542#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:47,027 INFO L273 TraceCheckUtils]: 71: Hoare triple {26542#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {26543#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:47,028 INFO L273 TraceCheckUtils]: 72: Hoare triple {26543#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26543#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:47,028 INFO L273 TraceCheckUtils]: 73: Hoare triple {26543#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26543#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:47,029 INFO L273 TraceCheckUtils]: 74: Hoare triple {26543#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {26544#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:47,029 INFO L273 TraceCheckUtils]: 75: Hoare triple {26544#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26544#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:47,030 INFO L273 TraceCheckUtils]: 76: Hoare triple {26544#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26544#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:47,031 INFO L273 TraceCheckUtils]: 77: Hoare triple {26544#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {26545#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:47,031 INFO L273 TraceCheckUtils]: 78: Hoare triple {26545#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26545#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:47,032 INFO L273 TraceCheckUtils]: 79: Hoare triple {26545#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26545#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:47,032 INFO L273 TraceCheckUtils]: 80: Hoare triple {26545#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {26546#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:47,033 INFO L273 TraceCheckUtils]: 81: Hoare triple {26546#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26546#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:47,033 INFO L273 TraceCheckUtils]: 82: Hoare triple {26546#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26546#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:47,034 INFO L273 TraceCheckUtils]: 83: Hoare triple {26546#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {26547#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:47,034 INFO L273 TraceCheckUtils]: 84: Hoare triple {26547#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26547#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:47,035 INFO L273 TraceCheckUtils]: 85: Hoare triple {26547#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26547#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:47,036 INFO L273 TraceCheckUtils]: 86: Hoare triple {26547#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {26548#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:47,036 INFO L273 TraceCheckUtils]: 87: Hoare triple {26548#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26548#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:47,037 INFO L273 TraceCheckUtils]: 88: Hoare triple {26548#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26548#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:47,037 INFO L273 TraceCheckUtils]: 89: Hoare triple {26548#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {26549#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:47,038 INFO L273 TraceCheckUtils]: 90: Hoare triple {26549#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26549#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:47,038 INFO L273 TraceCheckUtils]: 91: Hoare triple {26549#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26549#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:47,039 INFO L273 TraceCheckUtils]: 92: Hoare triple {26549#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {26550#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:47,040 INFO L273 TraceCheckUtils]: 93: Hoare triple {26550#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26550#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:47,040 INFO L273 TraceCheckUtils]: 94: Hoare triple {26550#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26550#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:47,041 INFO L273 TraceCheckUtils]: 95: Hoare triple {26550#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {26551#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:47,041 INFO L273 TraceCheckUtils]: 96: Hoare triple {26551#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26551#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:47,042 INFO L273 TraceCheckUtils]: 97: Hoare triple {26551#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26551#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:47,042 INFO L273 TraceCheckUtils]: 98: Hoare triple {26551#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {26552#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:47,043 INFO L273 TraceCheckUtils]: 99: Hoare triple {26552#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26552#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:47,043 INFO L273 TraceCheckUtils]: 100: Hoare triple {26552#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26552#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:47,044 INFO L273 TraceCheckUtils]: 101: Hoare triple {26552#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {26553#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:47,045 INFO L273 TraceCheckUtils]: 102: Hoare triple {26553#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26553#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:47,045 INFO L273 TraceCheckUtils]: 103: Hoare triple {26553#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26553#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:47,046 INFO L273 TraceCheckUtils]: 104: Hoare triple {26553#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {26554#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:47,046 INFO L273 TraceCheckUtils]: 105: Hoare triple {26554#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26554#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:47,047 INFO L273 TraceCheckUtils]: 106: Hoare triple {26554#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26554#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:47,047 INFO L273 TraceCheckUtils]: 107: Hoare triple {26554#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {26555#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:47,048 INFO L273 TraceCheckUtils]: 108: Hoare triple {26555#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26555#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:47,048 INFO L273 TraceCheckUtils]: 109: Hoare triple {26555#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26555#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:47,049 INFO L273 TraceCheckUtils]: 110: Hoare triple {26555#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {26556#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:47,050 INFO L273 TraceCheckUtils]: 111: Hoare triple {26556#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26556#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:47,050 INFO L273 TraceCheckUtils]: 112: Hoare triple {26556#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26556#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:47,051 INFO L273 TraceCheckUtils]: 113: Hoare triple {26556#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {26557#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:47,051 INFO L273 TraceCheckUtils]: 114: Hoare triple {26557#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26557#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:47,052 INFO L273 TraceCheckUtils]: 115: Hoare triple {26557#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26557#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:47,053 INFO L273 TraceCheckUtils]: 116: Hoare triple {26557#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {26558#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:47,053 INFO L273 TraceCheckUtils]: 117: Hoare triple {26558#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26558#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:47,054 INFO L273 TraceCheckUtils]: 118: Hoare triple {26558#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26558#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:47,054 INFO L273 TraceCheckUtils]: 119: Hoare triple {26558#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {26559#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:47,055 INFO L273 TraceCheckUtils]: 120: Hoare triple {26559#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26559#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:47,055 INFO L273 TraceCheckUtils]: 121: Hoare triple {26559#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26559#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:47,056 INFO L273 TraceCheckUtils]: 122: Hoare triple {26559#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {26560#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:47,056 INFO L273 TraceCheckUtils]: 123: Hoare triple {26560#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26560#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:47,057 INFO L273 TraceCheckUtils]: 124: Hoare triple {26560#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26560#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:47,058 INFO L273 TraceCheckUtils]: 125: Hoare triple {26560#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {26561#(<= main_~i~0 40)} is VALID [2018-11-23 11:56:47,058 INFO L273 TraceCheckUtils]: 126: Hoare triple {26561#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26561#(<= main_~i~0 40)} is VALID [2018-11-23 11:56:47,059 INFO L273 TraceCheckUtils]: 127: Hoare triple {26561#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26561#(<= main_~i~0 40)} is VALID [2018-11-23 11:56:47,059 INFO L273 TraceCheckUtils]: 128: Hoare triple {26561#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {26562#(<= main_~i~0 41)} is VALID [2018-11-23 11:56:47,060 INFO L273 TraceCheckUtils]: 129: Hoare triple {26562#(<= main_~i~0 41)} assume !(~i~0 < 100000); {26520#false} is VALID [2018-11-23 11:56:47,060 INFO L273 TraceCheckUtils]: 130: Hoare triple {26520#false} havoc ~x~0;~x~0 := 0; {26520#false} is VALID [2018-11-23 11:56:47,060 INFO L273 TraceCheckUtils]: 131: Hoare triple {26520#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {26520#false} is VALID [2018-11-23 11:56:47,061 INFO L256 TraceCheckUtils]: 132: Hoare triple {26520#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {26520#false} is VALID [2018-11-23 11:56:47,061 INFO L273 TraceCheckUtils]: 133: Hoare triple {26520#false} ~cond := #in~cond; {26520#false} is VALID [2018-11-23 11:56:47,061 INFO L273 TraceCheckUtils]: 134: Hoare triple {26520#false} assume 0 == ~cond; {26520#false} is VALID [2018-11-23 11:56:47,061 INFO L273 TraceCheckUtils]: 135: Hoare triple {26520#false} assume !false; {26520#false} is VALID [2018-11-23 11:56:47,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:47,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:47,074 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:47,082 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:56:47,170 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-11-23 11:56:47,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:47,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:47,484 INFO L256 TraceCheckUtils]: 0: Hoare triple {26519#true} call ULTIMATE.init(); {26519#true} is VALID [2018-11-23 11:56:47,484 INFO L273 TraceCheckUtils]: 1: Hoare triple {26519#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26519#true} is VALID [2018-11-23 11:56:47,484 INFO L273 TraceCheckUtils]: 2: Hoare triple {26519#true} assume true; {26519#true} is VALID [2018-11-23 11:56:47,485 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26519#true} {26519#true} #55#return; {26519#true} is VALID [2018-11-23 11:56:47,485 INFO L256 TraceCheckUtils]: 4: Hoare triple {26519#true} call #t~ret4 := main(); {26519#true} is VALID [2018-11-23 11:56:47,486 INFO L273 TraceCheckUtils]: 5: Hoare triple {26519#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {26581#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:47,486 INFO L273 TraceCheckUtils]: 6: Hoare triple {26581#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26581#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:47,487 INFO L273 TraceCheckUtils]: 7: Hoare triple {26581#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26581#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:47,487 INFO L273 TraceCheckUtils]: 8: Hoare triple {26581#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {26522#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:47,488 INFO L273 TraceCheckUtils]: 9: Hoare triple {26522#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26522#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:47,488 INFO L273 TraceCheckUtils]: 10: Hoare triple {26522#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26522#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:47,489 INFO L273 TraceCheckUtils]: 11: Hoare triple {26522#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {26523#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:47,490 INFO L273 TraceCheckUtils]: 12: Hoare triple {26523#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26523#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:47,490 INFO L273 TraceCheckUtils]: 13: Hoare triple {26523#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26523#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:47,491 INFO L273 TraceCheckUtils]: 14: Hoare triple {26523#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {26524#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:47,491 INFO L273 TraceCheckUtils]: 15: Hoare triple {26524#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26524#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:47,492 INFO L273 TraceCheckUtils]: 16: Hoare triple {26524#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26524#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:47,492 INFO L273 TraceCheckUtils]: 17: Hoare triple {26524#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {26525#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:47,493 INFO L273 TraceCheckUtils]: 18: Hoare triple {26525#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26525#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:47,493 INFO L273 TraceCheckUtils]: 19: Hoare triple {26525#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26525#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:47,494 INFO L273 TraceCheckUtils]: 20: Hoare triple {26525#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {26526#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:47,495 INFO L273 TraceCheckUtils]: 21: Hoare triple {26526#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26526#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:47,495 INFO L273 TraceCheckUtils]: 22: Hoare triple {26526#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26526#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:47,496 INFO L273 TraceCheckUtils]: 23: Hoare triple {26526#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {26527#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:47,496 INFO L273 TraceCheckUtils]: 24: Hoare triple {26527#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26527#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:47,497 INFO L273 TraceCheckUtils]: 25: Hoare triple {26527#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26527#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:47,497 INFO L273 TraceCheckUtils]: 26: Hoare triple {26527#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {26528#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:47,498 INFO L273 TraceCheckUtils]: 27: Hoare triple {26528#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26528#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:47,498 INFO L273 TraceCheckUtils]: 28: Hoare triple {26528#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26528#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:47,499 INFO L273 TraceCheckUtils]: 29: Hoare triple {26528#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {26529#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:47,500 INFO L273 TraceCheckUtils]: 30: Hoare triple {26529#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26529#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:47,500 INFO L273 TraceCheckUtils]: 31: Hoare triple {26529#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26529#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:47,501 INFO L273 TraceCheckUtils]: 32: Hoare triple {26529#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {26530#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:47,501 INFO L273 TraceCheckUtils]: 33: Hoare triple {26530#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26530#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:47,502 INFO L273 TraceCheckUtils]: 34: Hoare triple {26530#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26530#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:47,503 INFO L273 TraceCheckUtils]: 35: Hoare triple {26530#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {26531#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:47,503 INFO L273 TraceCheckUtils]: 36: Hoare triple {26531#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26531#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:47,504 INFO L273 TraceCheckUtils]: 37: Hoare triple {26531#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26531#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:47,504 INFO L273 TraceCheckUtils]: 38: Hoare triple {26531#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {26532#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:47,505 INFO L273 TraceCheckUtils]: 39: Hoare triple {26532#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26532#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:47,505 INFO L273 TraceCheckUtils]: 40: Hoare triple {26532#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26532#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:47,506 INFO L273 TraceCheckUtils]: 41: Hoare triple {26532#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {26533#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:47,506 INFO L273 TraceCheckUtils]: 42: Hoare triple {26533#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26533#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:47,507 INFO L273 TraceCheckUtils]: 43: Hoare triple {26533#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26533#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:47,508 INFO L273 TraceCheckUtils]: 44: Hoare triple {26533#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {26534#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:47,508 INFO L273 TraceCheckUtils]: 45: Hoare triple {26534#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26534#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:47,509 INFO L273 TraceCheckUtils]: 46: Hoare triple {26534#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26534#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:47,509 INFO L273 TraceCheckUtils]: 47: Hoare triple {26534#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {26535#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:47,510 INFO L273 TraceCheckUtils]: 48: Hoare triple {26535#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26535#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:47,510 INFO L273 TraceCheckUtils]: 49: Hoare triple {26535#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26535#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:47,511 INFO L273 TraceCheckUtils]: 50: Hoare triple {26535#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {26536#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:47,512 INFO L273 TraceCheckUtils]: 51: Hoare triple {26536#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26536#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:47,512 INFO L273 TraceCheckUtils]: 52: Hoare triple {26536#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26536#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:47,513 INFO L273 TraceCheckUtils]: 53: Hoare triple {26536#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {26537#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:47,513 INFO L273 TraceCheckUtils]: 54: Hoare triple {26537#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26537#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:47,514 INFO L273 TraceCheckUtils]: 55: Hoare triple {26537#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26537#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:47,514 INFO L273 TraceCheckUtils]: 56: Hoare triple {26537#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {26538#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:47,515 INFO L273 TraceCheckUtils]: 57: Hoare triple {26538#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26538#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:47,515 INFO L273 TraceCheckUtils]: 58: Hoare triple {26538#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26538#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:47,516 INFO L273 TraceCheckUtils]: 59: Hoare triple {26538#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {26539#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:47,517 INFO L273 TraceCheckUtils]: 60: Hoare triple {26539#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26539#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:47,517 INFO L273 TraceCheckUtils]: 61: Hoare triple {26539#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26539#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:47,518 INFO L273 TraceCheckUtils]: 62: Hoare triple {26539#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {26540#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:47,518 INFO L273 TraceCheckUtils]: 63: Hoare triple {26540#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26540#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:47,519 INFO L273 TraceCheckUtils]: 64: Hoare triple {26540#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26540#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:47,520 INFO L273 TraceCheckUtils]: 65: Hoare triple {26540#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {26541#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:47,520 INFO L273 TraceCheckUtils]: 66: Hoare triple {26541#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26541#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:47,521 INFO L273 TraceCheckUtils]: 67: Hoare triple {26541#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26541#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:47,521 INFO L273 TraceCheckUtils]: 68: Hoare triple {26541#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {26542#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:47,522 INFO L273 TraceCheckUtils]: 69: Hoare triple {26542#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26542#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:47,522 INFO L273 TraceCheckUtils]: 70: Hoare triple {26542#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26542#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:47,523 INFO L273 TraceCheckUtils]: 71: Hoare triple {26542#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {26543#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:47,523 INFO L273 TraceCheckUtils]: 72: Hoare triple {26543#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26543#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:47,524 INFO L273 TraceCheckUtils]: 73: Hoare triple {26543#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26543#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:47,525 INFO L273 TraceCheckUtils]: 74: Hoare triple {26543#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {26544#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:47,525 INFO L273 TraceCheckUtils]: 75: Hoare triple {26544#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26544#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:47,526 INFO L273 TraceCheckUtils]: 76: Hoare triple {26544#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26544#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:47,526 INFO L273 TraceCheckUtils]: 77: Hoare triple {26544#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {26545#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:47,527 INFO L273 TraceCheckUtils]: 78: Hoare triple {26545#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26545#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:47,527 INFO L273 TraceCheckUtils]: 79: Hoare triple {26545#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26545#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:47,528 INFO L273 TraceCheckUtils]: 80: Hoare triple {26545#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {26546#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:47,529 INFO L273 TraceCheckUtils]: 81: Hoare triple {26546#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26546#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:47,529 INFO L273 TraceCheckUtils]: 82: Hoare triple {26546#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26546#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:47,530 INFO L273 TraceCheckUtils]: 83: Hoare triple {26546#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {26547#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:47,530 INFO L273 TraceCheckUtils]: 84: Hoare triple {26547#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26547#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:47,531 INFO L273 TraceCheckUtils]: 85: Hoare triple {26547#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26547#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:47,531 INFO L273 TraceCheckUtils]: 86: Hoare triple {26547#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {26548#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:47,532 INFO L273 TraceCheckUtils]: 87: Hoare triple {26548#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26548#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:47,532 INFO L273 TraceCheckUtils]: 88: Hoare triple {26548#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26548#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:47,533 INFO L273 TraceCheckUtils]: 89: Hoare triple {26548#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {26549#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:47,534 INFO L273 TraceCheckUtils]: 90: Hoare triple {26549#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26549#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:47,534 INFO L273 TraceCheckUtils]: 91: Hoare triple {26549#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26549#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:47,535 INFO L273 TraceCheckUtils]: 92: Hoare triple {26549#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {26550#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:47,535 INFO L273 TraceCheckUtils]: 93: Hoare triple {26550#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26550#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:47,536 INFO L273 TraceCheckUtils]: 94: Hoare triple {26550#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26550#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:47,537 INFO L273 TraceCheckUtils]: 95: Hoare triple {26550#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {26551#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:47,537 INFO L273 TraceCheckUtils]: 96: Hoare triple {26551#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26551#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:47,538 INFO L273 TraceCheckUtils]: 97: Hoare triple {26551#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26551#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:47,538 INFO L273 TraceCheckUtils]: 98: Hoare triple {26551#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {26552#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:47,539 INFO L273 TraceCheckUtils]: 99: Hoare triple {26552#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26552#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:47,539 INFO L273 TraceCheckUtils]: 100: Hoare triple {26552#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26552#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:47,540 INFO L273 TraceCheckUtils]: 101: Hoare triple {26552#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {26553#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:47,540 INFO L273 TraceCheckUtils]: 102: Hoare triple {26553#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26553#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:47,541 INFO L273 TraceCheckUtils]: 103: Hoare triple {26553#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26553#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:47,542 INFO L273 TraceCheckUtils]: 104: Hoare triple {26553#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {26554#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:47,542 INFO L273 TraceCheckUtils]: 105: Hoare triple {26554#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26554#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:47,543 INFO L273 TraceCheckUtils]: 106: Hoare triple {26554#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26554#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:47,543 INFO L273 TraceCheckUtils]: 107: Hoare triple {26554#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {26555#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:47,544 INFO L273 TraceCheckUtils]: 108: Hoare triple {26555#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26555#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:47,544 INFO L273 TraceCheckUtils]: 109: Hoare triple {26555#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26555#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:47,545 INFO L273 TraceCheckUtils]: 110: Hoare triple {26555#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {26556#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:47,546 INFO L273 TraceCheckUtils]: 111: Hoare triple {26556#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26556#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:47,546 INFO L273 TraceCheckUtils]: 112: Hoare triple {26556#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26556#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:47,547 INFO L273 TraceCheckUtils]: 113: Hoare triple {26556#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {26557#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:47,547 INFO L273 TraceCheckUtils]: 114: Hoare triple {26557#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26557#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:47,548 INFO L273 TraceCheckUtils]: 115: Hoare triple {26557#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26557#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:47,548 INFO L273 TraceCheckUtils]: 116: Hoare triple {26557#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {26558#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:47,549 INFO L273 TraceCheckUtils]: 117: Hoare triple {26558#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26558#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:47,549 INFO L273 TraceCheckUtils]: 118: Hoare triple {26558#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26558#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:47,550 INFO L273 TraceCheckUtils]: 119: Hoare triple {26558#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {26559#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:47,551 INFO L273 TraceCheckUtils]: 120: Hoare triple {26559#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26559#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:47,551 INFO L273 TraceCheckUtils]: 121: Hoare triple {26559#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26559#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:47,552 INFO L273 TraceCheckUtils]: 122: Hoare triple {26559#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {26560#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:47,552 INFO L273 TraceCheckUtils]: 123: Hoare triple {26560#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26560#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:47,553 INFO L273 TraceCheckUtils]: 124: Hoare triple {26560#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26560#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:47,554 INFO L273 TraceCheckUtils]: 125: Hoare triple {26560#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {26561#(<= main_~i~0 40)} is VALID [2018-11-23 11:56:47,554 INFO L273 TraceCheckUtils]: 126: Hoare triple {26561#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26561#(<= main_~i~0 40)} is VALID [2018-11-23 11:56:47,555 INFO L273 TraceCheckUtils]: 127: Hoare triple {26561#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {26561#(<= main_~i~0 40)} is VALID [2018-11-23 11:56:47,555 INFO L273 TraceCheckUtils]: 128: Hoare triple {26561#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {26562#(<= main_~i~0 41)} is VALID [2018-11-23 11:56:47,556 INFO L273 TraceCheckUtils]: 129: Hoare triple {26562#(<= main_~i~0 41)} assume !(~i~0 < 100000); {26520#false} is VALID [2018-11-23 11:56:47,556 INFO L273 TraceCheckUtils]: 130: Hoare triple {26520#false} havoc ~x~0;~x~0 := 0; {26520#false} is VALID [2018-11-23 11:56:47,556 INFO L273 TraceCheckUtils]: 131: Hoare triple {26520#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {26520#false} is VALID [2018-11-23 11:56:47,557 INFO L256 TraceCheckUtils]: 132: Hoare triple {26520#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {26520#false} is VALID [2018-11-23 11:56:47,557 INFO L273 TraceCheckUtils]: 133: Hoare triple {26520#false} ~cond := #in~cond; {26520#false} is VALID [2018-11-23 11:56:47,557 INFO L273 TraceCheckUtils]: 134: Hoare triple {26520#false} assume 0 == ~cond; {26520#false} is VALID [2018-11-23 11:56:47,557 INFO L273 TraceCheckUtils]: 135: Hoare triple {26520#false} assume !false; {26520#false} is VALID [2018-11-23 11:56:47,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:47,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:47,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2018-11-23 11:56:47,590 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 136 [2018-11-23 11:56:47,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:47,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states. [2018-11-23 11:56:47,747 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:47,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-23 11:56:47,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-23 11:56:47,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 11:56:47,749 INFO L87 Difference]: Start difference. First operand 141 states and 183 transitions. Second operand 45 states. [2018-11-23 11:56:48,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:48,244 INFO L93 Difference]: Finished difference Result 157 states and 202 transitions. [2018-11-23 11:56:48,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-23 11:56:48,244 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 136 [2018-11-23 11:56:48,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:48,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 11:56:48,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 202 transitions. [2018-11-23 11:56:48,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 11:56:48,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 202 transitions. [2018-11-23 11:56:48,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 202 transitions. [2018-11-23 11:56:48,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:48,438 INFO L225 Difference]: With dead ends: 157 [2018-11-23 11:56:48,439 INFO L226 Difference]: Without dead ends: 146 [2018-11-23 11:56:48,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 11:56:48,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-23 11:56:48,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-11-23 11:56:48,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:48,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand 144 states. [2018-11-23 11:56:48,476 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 144 states. [2018-11-23 11:56:48,476 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 144 states. [2018-11-23 11:56:48,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:48,479 INFO L93 Difference]: Finished difference Result 146 states and 190 transitions. [2018-11-23 11:56:48,479 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 190 transitions. [2018-11-23 11:56:48,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:48,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:48,479 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 146 states. [2018-11-23 11:56:48,479 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 146 states. [2018-11-23 11:56:48,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:48,482 INFO L93 Difference]: Finished difference Result 146 states and 190 transitions. [2018-11-23 11:56:48,482 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 190 transitions. [2018-11-23 11:56:48,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:48,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:48,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:48,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:48,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-23 11:56:48,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 187 transitions. [2018-11-23 11:56:48,485 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 187 transitions. Word has length 136 [2018-11-23 11:56:48,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:48,485 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 187 transitions. [2018-11-23 11:56:48,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-23 11:56:48,485 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 187 transitions. [2018-11-23 11:56:48,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-23 11:56:48,486 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:48,486 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:48,486 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:48,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:48,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1306812551, now seen corresponding path program 42 times [2018-11-23 11:56:48,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:48,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:48,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:48,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:48,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:49,476 INFO L256 TraceCheckUtils]: 0: Hoare triple {27667#true} call ULTIMATE.init(); {27667#true} is VALID [2018-11-23 11:56:49,476 INFO L273 TraceCheckUtils]: 1: Hoare triple {27667#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27667#true} is VALID [2018-11-23 11:56:49,476 INFO L273 TraceCheckUtils]: 2: Hoare triple {27667#true} assume true; {27667#true} is VALID [2018-11-23 11:56:49,477 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27667#true} {27667#true} #55#return; {27667#true} is VALID [2018-11-23 11:56:49,477 INFO L256 TraceCheckUtils]: 4: Hoare triple {27667#true} call #t~ret4 := main(); {27667#true} is VALID [2018-11-23 11:56:49,477 INFO L273 TraceCheckUtils]: 5: Hoare triple {27667#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {27669#(= main_~i~0 0)} is VALID [2018-11-23 11:56:49,478 INFO L273 TraceCheckUtils]: 6: Hoare triple {27669#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27669#(= main_~i~0 0)} is VALID [2018-11-23 11:56:49,478 INFO L273 TraceCheckUtils]: 7: Hoare triple {27669#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27669#(= main_~i~0 0)} is VALID [2018-11-23 11:56:49,479 INFO L273 TraceCheckUtils]: 8: Hoare triple {27669#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {27670#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:49,480 INFO L273 TraceCheckUtils]: 9: Hoare triple {27670#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27670#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:49,480 INFO L273 TraceCheckUtils]: 10: Hoare triple {27670#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27670#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:49,481 INFO L273 TraceCheckUtils]: 11: Hoare triple {27670#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {27671#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:49,481 INFO L273 TraceCheckUtils]: 12: Hoare triple {27671#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27671#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:49,482 INFO L273 TraceCheckUtils]: 13: Hoare triple {27671#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27671#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:49,482 INFO L273 TraceCheckUtils]: 14: Hoare triple {27671#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {27672#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:49,483 INFO L273 TraceCheckUtils]: 15: Hoare triple {27672#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27672#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:49,483 INFO L273 TraceCheckUtils]: 16: Hoare triple {27672#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27672#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:49,484 INFO L273 TraceCheckUtils]: 17: Hoare triple {27672#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {27673#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:49,485 INFO L273 TraceCheckUtils]: 18: Hoare triple {27673#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27673#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:49,485 INFO L273 TraceCheckUtils]: 19: Hoare triple {27673#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27673#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:49,486 INFO L273 TraceCheckUtils]: 20: Hoare triple {27673#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {27674#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:49,486 INFO L273 TraceCheckUtils]: 21: Hoare triple {27674#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27674#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:49,487 INFO L273 TraceCheckUtils]: 22: Hoare triple {27674#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27674#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:49,487 INFO L273 TraceCheckUtils]: 23: Hoare triple {27674#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {27675#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:49,488 INFO L273 TraceCheckUtils]: 24: Hoare triple {27675#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27675#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:49,488 INFO L273 TraceCheckUtils]: 25: Hoare triple {27675#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27675#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:49,489 INFO L273 TraceCheckUtils]: 26: Hoare triple {27675#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {27676#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:49,490 INFO L273 TraceCheckUtils]: 27: Hoare triple {27676#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27676#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:49,490 INFO L273 TraceCheckUtils]: 28: Hoare triple {27676#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27676#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:49,491 INFO L273 TraceCheckUtils]: 29: Hoare triple {27676#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {27677#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:49,491 INFO L273 TraceCheckUtils]: 30: Hoare triple {27677#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27677#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:49,492 INFO L273 TraceCheckUtils]: 31: Hoare triple {27677#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27677#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:49,493 INFO L273 TraceCheckUtils]: 32: Hoare triple {27677#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {27678#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:49,493 INFO L273 TraceCheckUtils]: 33: Hoare triple {27678#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27678#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:49,494 INFO L273 TraceCheckUtils]: 34: Hoare triple {27678#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27678#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:49,494 INFO L273 TraceCheckUtils]: 35: Hoare triple {27678#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {27679#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:49,495 INFO L273 TraceCheckUtils]: 36: Hoare triple {27679#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27679#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:49,495 INFO L273 TraceCheckUtils]: 37: Hoare triple {27679#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27679#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:49,496 INFO L273 TraceCheckUtils]: 38: Hoare triple {27679#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {27680#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:49,496 INFO L273 TraceCheckUtils]: 39: Hoare triple {27680#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27680#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:49,497 INFO L273 TraceCheckUtils]: 40: Hoare triple {27680#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27680#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:49,498 INFO L273 TraceCheckUtils]: 41: Hoare triple {27680#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {27681#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:49,498 INFO L273 TraceCheckUtils]: 42: Hoare triple {27681#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27681#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:49,499 INFO L273 TraceCheckUtils]: 43: Hoare triple {27681#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27681#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:49,499 INFO L273 TraceCheckUtils]: 44: Hoare triple {27681#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {27682#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:49,500 INFO L273 TraceCheckUtils]: 45: Hoare triple {27682#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27682#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:49,500 INFO L273 TraceCheckUtils]: 46: Hoare triple {27682#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27682#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:49,501 INFO L273 TraceCheckUtils]: 47: Hoare triple {27682#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {27683#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:49,502 INFO L273 TraceCheckUtils]: 48: Hoare triple {27683#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27683#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:49,502 INFO L273 TraceCheckUtils]: 49: Hoare triple {27683#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27683#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:49,503 INFO L273 TraceCheckUtils]: 50: Hoare triple {27683#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {27684#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:49,503 INFO L273 TraceCheckUtils]: 51: Hoare triple {27684#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27684#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:49,504 INFO L273 TraceCheckUtils]: 52: Hoare triple {27684#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27684#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:49,504 INFO L273 TraceCheckUtils]: 53: Hoare triple {27684#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {27685#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:49,505 INFO L273 TraceCheckUtils]: 54: Hoare triple {27685#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27685#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:49,505 INFO L273 TraceCheckUtils]: 55: Hoare triple {27685#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27685#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:49,506 INFO L273 TraceCheckUtils]: 56: Hoare triple {27685#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {27686#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:49,507 INFO L273 TraceCheckUtils]: 57: Hoare triple {27686#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27686#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:49,507 INFO L273 TraceCheckUtils]: 58: Hoare triple {27686#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27686#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:49,508 INFO L273 TraceCheckUtils]: 59: Hoare triple {27686#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {27687#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:49,508 INFO L273 TraceCheckUtils]: 60: Hoare triple {27687#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27687#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:49,509 INFO L273 TraceCheckUtils]: 61: Hoare triple {27687#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27687#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:49,510 INFO L273 TraceCheckUtils]: 62: Hoare triple {27687#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {27688#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:49,510 INFO L273 TraceCheckUtils]: 63: Hoare triple {27688#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27688#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:49,511 INFO L273 TraceCheckUtils]: 64: Hoare triple {27688#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27688#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:49,511 INFO L273 TraceCheckUtils]: 65: Hoare triple {27688#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {27689#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:49,512 INFO L273 TraceCheckUtils]: 66: Hoare triple {27689#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27689#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:49,512 INFO L273 TraceCheckUtils]: 67: Hoare triple {27689#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27689#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:49,513 INFO L273 TraceCheckUtils]: 68: Hoare triple {27689#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {27690#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:49,513 INFO L273 TraceCheckUtils]: 69: Hoare triple {27690#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27690#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:49,514 INFO L273 TraceCheckUtils]: 70: Hoare triple {27690#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27690#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:49,515 INFO L273 TraceCheckUtils]: 71: Hoare triple {27690#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {27691#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:49,515 INFO L273 TraceCheckUtils]: 72: Hoare triple {27691#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27691#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:49,516 INFO L273 TraceCheckUtils]: 73: Hoare triple {27691#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27691#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:49,516 INFO L273 TraceCheckUtils]: 74: Hoare triple {27691#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {27692#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:49,517 INFO L273 TraceCheckUtils]: 75: Hoare triple {27692#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27692#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:49,517 INFO L273 TraceCheckUtils]: 76: Hoare triple {27692#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27692#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:49,518 INFO L273 TraceCheckUtils]: 77: Hoare triple {27692#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {27693#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:49,518 INFO L273 TraceCheckUtils]: 78: Hoare triple {27693#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27693#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:49,519 INFO L273 TraceCheckUtils]: 79: Hoare triple {27693#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27693#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:49,520 INFO L273 TraceCheckUtils]: 80: Hoare triple {27693#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {27694#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:49,520 INFO L273 TraceCheckUtils]: 81: Hoare triple {27694#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27694#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:49,521 INFO L273 TraceCheckUtils]: 82: Hoare triple {27694#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27694#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:49,521 INFO L273 TraceCheckUtils]: 83: Hoare triple {27694#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {27695#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:49,522 INFO L273 TraceCheckUtils]: 84: Hoare triple {27695#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27695#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:49,522 INFO L273 TraceCheckUtils]: 85: Hoare triple {27695#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27695#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:49,523 INFO L273 TraceCheckUtils]: 86: Hoare triple {27695#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {27696#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:49,524 INFO L273 TraceCheckUtils]: 87: Hoare triple {27696#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27696#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:49,524 INFO L273 TraceCheckUtils]: 88: Hoare triple {27696#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27696#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:49,525 INFO L273 TraceCheckUtils]: 89: Hoare triple {27696#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {27697#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:49,525 INFO L273 TraceCheckUtils]: 90: Hoare triple {27697#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27697#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:49,526 INFO L273 TraceCheckUtils]: 91: Hoare triple {27697#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27697#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:49,526 INFO L273 TraceCheckUtils]: 92: Hoare triple {27697#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {27698#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:49,527 INFO L273 TraceCheckUtils]: 93: Hoare triple {27698#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27698#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:49,527 INFO L273 TraceCheckUtils]: 94: Hoare triple {27698#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27698#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:49,536 INFO L273 TraceCheckUtils]: 95: Hoare triple {27698#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {27699#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:49,536 INFO L273 TraceCheckUtils]: 96: Hoare triple {27699#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27699#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:49,537 INFO L273 TraceCheckUtils]: 97: Hoare triple {27699#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27699#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:49,537 INFO L273 TraceCheckUtils]: 98: Hoare triple {27699#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {27700#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:49,537 INFO L273 TraceCheckUtils]: 99: Hoare triple {27700#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27700#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:49,538 INFO L273 TraceCheckUtils]: 100: Hoare triple {27700#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27700#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:49,538 INFO L273 TraceCheckUtils]: 101: Hoare triple {27700#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {27701#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:49,538 INFO L273 TraceCheckUtils]: 102: Hoare triple {27701#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27701#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:49,539 INFO L273 TraceCheckUtils]: 103: Hoare triple {27701#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27701#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:49,539 INFO L273 TraceCheckUtils]: 104: Hoare triple {27701#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {27702#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:49,539 INFO L273 TraceCheckUtils]: 105: Hoare triple {27702#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27702#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:49,540 INFO L273 TraceCheckUtils]: 106: Hoare triple {27702#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27702#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:49,540 INFO L273 TraceCheckUtils]: 107: Hoare triple {27702#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {27703#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:49,541 INFO L273 TraceCheckUtils]: 108: Hoare triple {27703#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27703#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:49,541 INFO L273 TraceCheckUtils]: 109: Hoare triple {27703#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27703#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:49,542 INFO L273 TraceCheckUtils]: 110: Hoare triple {27703#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {27704#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:49,543 INFO L273 TraceCheckUtils]: 111: Hoare triple {27704#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27704#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:49,543 INFO L273 TraceCheckUtils]: 112: Hoare triple {27704#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27704#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:49,544 INFO L273 TraceCheckUtils]: 113: Hoare triple {27704#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {27705#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:49,544 INFO L273 TraceCheckUtils]: 114: Hoare triple {27705#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27705#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:49,545 INFO L273 TraceCheckUtils]: 115: Hoare triple {27705#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27705#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:49,545 INFO L273 TraceCheckUtils]: 116: Hoare triple {27705#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {27706#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:49,546 INFO L273 TraceCheckUtils]: 117: Hoare triple {27706#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27706#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:49,546 INFO L273 TraceCheckUtils]: 118: Hoare triple {27706#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27706#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:49,547 INFO L273 TraceCheckUtils]: 119: Hoare triple {27706#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {27707#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:49,548 INFO L273 TraceCheckUtils]: 120: Hoare triple {27707#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27707#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:49,548 INFO L273 TraceCheckUtils]: 121: Hoare triple {27707#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27707#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:49,549 INFO L273 TraceCheckUtils]: 122: Hoare triple {27707#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {27708#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:49,549 INFO L273 TraceCheckUtils]: 123: Hoare triple {27708#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27708#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:49,550 INFO L273 TraceCheckUtils]: 124: Hoare triple {27708#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27708#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:49,551 INFO L273 TraceCheckUtils]: 125: Hoare triple {27708#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {27709#(<= main_~i~0 40)} is VALID [2018-11-23 11:56:49,551 INFO L273 TraceCheckUtils]: 126: Hoare triple {27709#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27709#(<= main_~i~0 40)} is VALID [2018-11-23 11:56:49,552 INFO L273 TraceCheckUtils]: 127: Hoare triple {27709#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27709#(<= main_~i~0 40)} is VALID [2018-11-23 11:56:49,552 INFO L273 TraceCheckUtils]: 128: Hoare triple {27709#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {27710#(<= main_~i~0 41)} is VALID [2018-11-23 11:56:49,553 INFO L273 TraceCheckUtils]: 129: Hoare triple {27710#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27710#(<= main_~i~0 41)} is VALID [2018-11-23 11:56:49,553 INFO L273 TraceCheckUtils]: 130: Hoare triple {27710#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27710#(<= main_~i~0 41)} is VALID [2018-11-23 11:56:49,554 INFO L273 TraceCheckUtils]: 131: Hoare triple {27710#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {27711#(<= main_~i~0 42)} is VALID [2018-11-23 11:56:49,555 INFO L273 TraceCheckUtils]: 132: Hoare triple {27711#(<= main_~i~0 42)} assume !(~i~0 < 100000); {27668#false} is VALID [2018-11-23 11:56:49,555 INFO L273 TraceCheckUtils]: 133: Hoare triple {27668#false} havoc ~x~0;~x~0 := 0; {27668#false} is VALID [2018-11-23 11:56:49,555 INFO L273 TraceCheckUtils]: 134: Hoare triple {27668#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {27668#false} is VALID [2018-11-23 11:56:49,555 INFO L256 TraceCheckUtils]: 135: Hoare triple {27668#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {27668#false} is VALID [2018-11-23 11:56:49,555 INFO L273 TraceCheckUtils]: 136: Hoare triple {27668#false} ~cond := #in~cond; {27668#false} is VALID [2018-11-23 11:56:49,556 INFO L273 TraceCheckUtils]: 137: Hoare triple {27668#false} assume 0 == ~cond; {27668#false} is VALID [2018-11-23 11:56:49,556 INFO L273 TraceCheckUtils]: 138: Hoare triple {27668#false} assume !false; {27668#false} is VALID [2018-11-23 11:56:49,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 0 proven. 2625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:49,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:49,569 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:49,578 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:56:49,682 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-11-23 11:56:49,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:49,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:50,113 INFO L256 TraceCheckUtils]: 0: Hoare triple {27667#true} call ULTIMATE.init(); {27667#true} is VALID [2018-11-23 11:56:50,113 INFO L273 TraceCheckUtils]: 1: Hoare triple {27667#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27667#true} is VALID [2018-11-23 11:56:50,114 INFO L273 TraceCheckUtils]: 2: Hoare triple {27667#true} assume true; {27667#true} is VALID [2018-11-23 11:56:50,114 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27667#true} {27667#true} #55#return; {27667#true} is VALID [2018-11-23 11:56:50,114 INFO L256 TraceCheckUtils]: 4: Hoare triple {27667#true} call #t~ret4 := main(); {27667#true} is VALID [2018-11-23 11:56:50,115 INFO L273 TraceCheckUtils]: 5: Hoare triple {27667#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {27730#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:50,115 INFO L273 TraceCheckUtils]: 6: Hoare triple {27730#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27730#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:50,116 INFO L273 TraceCheckUtils]: 7: Hoare triple {27730#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27730#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:50,116 INFO L273 TraceCheckUtils]: 8: Hoare triple {27730#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {27670#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:50,116 INFO L273 TraceCheckUtils]: 9: Hoare triple {27670#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27670#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:50,117 INFO L273 TraceCheckUtils]: 10: Hoare triple {27670#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27670#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:50,117 INFO L273 TraceCheckUtils]: 11: Hoare triple {27670#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {27671#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:50,118 INFO L273 TraceCheckUtils]: 12: Hoare triple {27671#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27671#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:50,118 INFO L273 TraceCheckUtils]: 13: Hoare triple {27671#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27671#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:50,119 INFO L273 TraceCheckUtils]: 14: Hoare triple {27671#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {27672#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:50,120 INFO L273 TraceCheckUtils]: 15: Hoare triple {27672#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27672#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:50,120 INFO L273 TraceCheckUtils]: 16: Hoare triple {27672#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27672#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:50,121 INFO L273 TraceCheckUtils]: 17: Hoare triple {27672#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {27673#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:50,121 INFO L273 TraceCheckUtils]: 18: Hoare triple {27673#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27673#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:50,122 INFO L273 TraceCheckUtils]: 19: Hoare triple {27673#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27673#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:50,122 INFO L273 TraceCheckUtils]: 20: Hoare triple {27673#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {27674#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:50,123 INFO L273 TraceCheckUtils]: 21: Hoare triple {27674#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27674#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:50,123 INFO L273 TraceCheckUtils]: 22: Hoare triple {27674#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27674#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:50,124 INFO L273 TraceCheckUtils]: 23: Hoare triple {27674#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {27675#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:50,125 INFO L273 TraceCheckUtils]: 24: Hoare triple {27675#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27675#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:50,125 INFO L273 TraceCheckUtils]: 25: Hoare triple {27675#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27675#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:50,126 INFO L273 TraceCheckUtils]: 26: Hoare triple {27675#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {27676#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:50,126 INFO L273 TraceCheckUtils]: 27: Hoare triple {27676#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27676#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:50,127 INFO L273 TraceCheckUtils]: 28: Hoare triple {27676#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27676#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:50,128 INFO L273 TraceCheckUtils]: 29: Hoare triple {27676#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {27677#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:50,128 INFO L273 TraceCheckUtils]: 30: Hoare triple {27677#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27677#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:50,129 INFO L273 TraceCheckUtils]: 31: Hoare triple {27677#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27677#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:50,129 INFO L273 TraceCheckUtils]: 32: Hoare triple {27677#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {27678#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:50,130 INFO L273 TraceCheckUtils]: 33: Hoare triple {27678#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27678#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:50,130 INFO L273 TraceCheckUtils]: 34: Hoare triple {27678#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27678#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:50,131 INFO L273 TraceCheckUtils]: 35: Hoare triple {27678#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {27679#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:50,131 INFO L273 TraceCheckUtils]: 36: Hoare triple {27679#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27679#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:50,132 INFO L273 TraceCheckUtils]: 37: Hoare triple {27679#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27679#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:50,133 INFO L273 TraceCheckUtils]: 38: Hoare triple {27679#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {27680#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:50,133 INFO L273 TraceCheckUtils]: 39: Hoare triple {27680#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27680#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:50,134 INFO L273 TraceCheckUtils]: 40: Hoare triple {27680#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27680#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:50,134 INFO L273 TraceCheckUtils]: 41: Hoare triple {27680#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {27681#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:50,135 INFO L273 TraceCheckUtils]: 42: Hoare triple {27681#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27681#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:50,135 INFO L273 TraceCheckUtils]: 43: Hoare triple {27681#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27681#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:50,136 INFO L273 TraceCheckUtils]: 44: Hoare triple {27681#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {27682#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:50,137 INFO L273 TraceCheckUtils]: 45: Hoare triple {27682#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27682#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:50,137 INFO L273 TraceCheckUtils]: 46: Hoare triple {27682#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27682#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:50,138 INFO L273 TraceCheckUtils]: 47: Hoare triple {27682#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {27683#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:50,138 INFO L273 TraceCheckUtils]: 48: Hoare triple {27683#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27683#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:50,139 INFO L273 TraceCheckUtils]: 49: Hoare triple {27683#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27683#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:50,139 INFO L273 TraceCheckUtils]: 50: Hoare triple {27683#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {27684#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:50,140 INFO L273 TraceCheckUtils]: 51: Hoare triple {27684#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27684#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:50,140 INFO L273 TraceCheckUtils]: 52: Hoare triple {27684#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27684#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:50,141 INFO L273 TraceCheckUtils]: 53: Hoare triple {27684#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {27685#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:50,142 INFO L273 TraceCheckUtils]: 54: Hoare triple {27685#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27685#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:50,142 INFO L273 TraceCheckUtils]: 55: Hoare triple {27685#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27685#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:50,143 INFO L273 TraceCheckUtils]: 56: Hoare triple {27685#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {27686#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:50,143 INFO L273 TraceCheckUtils]: 57: Hoare triple {27686#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27686#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:50,144 INFO L273 TraceCheckUtils]: 58: Hoare triple {27686#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27686#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:50,145 INFO L273 TraceCheckUtils]: 59: Hoare triple {27686#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {27687#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:50,145 INFO L273 TraceCheckUtils]: 60: Hoare triple {27687#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27687#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:50,145 INFO L273 TraceCheckUtils]: 61: Hoare triple {27687#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27687#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:50,146 INFO L273 TraceCheckUtils]: 62: Hoare triple {27687#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {27688#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:50,147 INFO L273 TraceCheckUtils]: 63: Hoare triple {27688#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27688#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:50,147 INFO L273 TraceCheckUtils]: 64: Hoare triple {27688#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27688#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:50,148 INFO L273 TraceCheckUtils]: 65: Hoare triple {27688#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {27689#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:50,148 INFO L273 TraceCheckUtils]: 66: Hoare triple {27689#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27689#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:50,149 INFO L273 TraceCheckUtils]: 67: Hoare triple {27689#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27689#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:50,150 INFO L273 TraceCheckUtils]: 68: Hoare triple {27689#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {27690#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:50,150 INFO L273 TraceCheckUtils]: 69: Hoare triple {27690#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27690#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:50,151 INFO L273 TraceCheckUtils]: 70: Hoare triple {27690#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27690#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:50,151 INFO L273 TraceCheckUtils]: 71: Hoare triple {27690#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {27691#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:50,152 INFO L273 TraceCheckUtils]: 72: Hoare triple {27691#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27691#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:50,152 INFO L273 TraceCheckUtils]: 73: Hoare triple {27691#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27691#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:50,153 INFO L273 TraceCheckUtils]: 74: Hoare triple {27691#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {27692#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:50,153 INFO L273 TraceCheckUtils]: 75: Hoare triple {27692#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27692#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:50,154 INFO L273 TraceCheckUtils]: 76: Hoare triple {27692#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27692#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:50,155 INFO L273 TraceCheckUtils]: 77: Hoare triple {27692#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {27693#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:50,155 INFO L273 TraceCheckUtils]: 78: Hoare triple {27693#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27693#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:50,156 INFO L273 TraceCheckUtils]: 79: Hoare triple {27693#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27693#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:50,156 INFO L273 TraceCheckUtils]: 80: Hoare triple {27693#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {27694#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:50,157 INFO L273 TraceCheckUtils]: 81: Hoare triple {27694#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27694#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:50,157 INFO L273 TraceCheckUtils]: 82: Hoare triple {27694#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27694#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:50,158 INFO L273 TraceCheckUtils]: 83: Hoare triple {27694#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {27695#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:50,159 INFO L273 TraceCheckUtils]: 84: Hoare triple {27695#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27695#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:50,159 INFO L273 TraceCheckUtils]: 85: Hoare triple {27695#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27695#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:50,160 INFO L273 TraceCheckUtils]: 86: Hoare triple {27695#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {27696#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:50,160 INFO L273 TraceCheckUtils]: 87: Hoare triple {27696#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27696#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:50,161 INFO L273 TraceCheckUtils]: 88: Hoare triple {27696#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27696#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:50,161 INFO L273 TraceCheckUtils]: 89: Hoare triple {27696#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {27697#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:50,162 INFO L273 TraceCheckUtils]: 90: Hoare triple {27697#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27697#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:50,162 INFO L273 TraceCheckUtils]: 91: Hoare triple {27697#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27697#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:50,163 INFO L273 TraceCheckUtils]: 92: Hoare triple {27697#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {27698#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:50,164 INFO L273 TraceCheckUtils]: 93: Hoare triple {27698#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27698#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:50,164 INFO L273 TraceCheckUtils]: 94: Hoare triple {27698#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27698#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:50,165 INFO L273 TraceCheckUtils]: 95: Hoare triple {27698#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {27699#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:50,165 INFO L273 TraceCheckUtils]: 96: Hoare triple {27699#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27699#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:50,166 INFO L273 TraceCheckUtils]: 97: Hoare triple {27699#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27699#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:50,167 INFO L273 TraceCheckUtils]: 98: Hoare triple {27699#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {27700#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:50,167 INFO L273 TraceCheckUtils]: 99: Hoare triple {27700#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27700#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:50,168 INFO L273 TraceCheckUtils]: 100: Hoare triple {27700#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27700#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:50,168 INFO L273 TraceCheckUtils]: 101: Hoare triple {27700#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {27701#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:50,169 INFO L273 TraceCheckUtils]: 102: Hoare triple {27701#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27701#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:50,169 INFO L273 TraceCheckUtils]: 103: Hoare triple {27701#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27701#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:50,170 INFO L273 TraceCheckUtils]: 104: Hoare triple {27701#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {27702#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:50,170 INFO L273 TraceCheckUtils]: 105: Hoare triple {27702#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27702#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:50,171 INFO L273 TraceCheckUtils]: 106: Hoare triple {27702#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27702#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:50,172 INFO L273 TraceCheckUtils]: 107: Hoare triple {27702#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {27703#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:50,172 INFO L273 TraceCheckUtils]: 108: Hoare triple {27703#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27703#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:50,173 INFO L273 TraceCheckUtils]: 109: Hoare triple {27703#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27703#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:50,173 INFO L273 TraceCheckUtils]: 110: Hoare triple {27703#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {27704#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:50,174 INFO L273 TraceCheckUtils]: 111: Hoare triple {27704#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27704#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:50,174 INFO L273 TraceCheckUtils]: 112: Hoare triple {27704#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27704#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:50,175 INFO L273 TraceCheckUtils]: 113: Hoare triple {27704#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {27705#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:50,176 INFO L273 TraceCheckUtils]: 114: Hoare triple {27705#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27705#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:50,176 INFO L273 TraceCheckUtils]: 115: Hoare triple {27705#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27705#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:50,177 INFO L273 TraceCheckUtils]: 116: Hoare triple {27705#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {27706#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:50,177 INFO L273 TraceCheckUtils]: 117: Hoare triple {27706#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27706#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:50,178 INFO L273 TraceCheckUtils]: 118: Hoare triple {27706#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27706#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:50,178 INFO L273 TraceCheckUtils]: 119: Hoare triple {27706#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {27707#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:50,179 INFO L273 TraceCheckUtils]: 120: Hoare triple {27707#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27707#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:50,179 INFO L273 TraceCheckUtils]: 121: Hoare triple {27707#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27707#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:50,180 INFO L273 TraceCheckUtils]: 122: Hoare triple {27707#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {27708#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:50,181 INFO L273 TraceCheckUtils]: 123: Hoare triple {27708#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27708#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:50,181 INFO L273 TraceCheckUtils]: 124: Hoare triple {27708#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27708#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:50,182 INFO L273 TraceCheckUtils]: 125: Hoare triple {27708#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {27709#(<= main_~i~0 40)} is VALID [2018-11-23 11:56:50,182 INFO L273 TraceCheckUtils]: 126: Hoare triple {27709#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27709#(<= main_~i~0 40)} is VALID [2018-11-23 11:56:50,183 INFO L273 TraceCheckUtils]: 127: Hoare triple {27709#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27709#(<= main_~i~0 40)} is VALID [2018-11-23 11:56:50,184 INFO L273 TraceCheckUtils]: 128: Hoare triple {27709#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {27710#(<= main_~i~0 41)} is VALID [2018-11-23 11:56:50,184 INFO L273 TraceCheckUtils]: 129: Hoare triple {27710#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27710#(<= main_~i~0 41)} is VALID [2018-11-23 11:56:50,185 INFO L273 TraceCheckUtils]: 130: Hoare triple {27710#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {27710#(<= main_~i~0 41)} is VALID [2018-11-23 11:56:50,185 INFO L273 TraceCheckUtils]: 131: Hoare triple {27710#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {27711#(<= main_~i~0 42)} is VALID [2018-11-23 11:56:50,186 INFO L273 TraceCheckUtils]: 132: Hoare triple {27711#(<= main_~i~0 42)} assume !(~i~0 < 100000); {27668#false} is VALID [2018-11-23 11:56:50,186 INFO L273 TraceCheckUtils]: 133: Hoare triple {27668#false} havoc ~x~0;~x~0 := 0; {27668#false} is VALID [2018-11-23 11:56:50,186 INFO L273 TraceCheckUtils]: 134: Hoare triple {27668#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {27668#false} is VALID [2018-11-23 11:56:50,186 INFO L256 TraceCheckUtils]: 135: Hoare triple {27668#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {27668#false} is VALID [2018-11-23 11:56:50,187 INFO L273 TraceCheckUtils]: 136: Hoare triple {27668#false} ~cond := #in~cond; {27668#false} is VALID [2018-11-23 11:56:50,187 INFO L273 TraceCheckUtils]: 137: Hoare triple {27668#false} assume 0 == ~cond; {27668#false} is VALID [2018-11-23 11:56:50,187 INFO L273 TraceCheckUtils]: 138: Hoare triple {27668#false} assume !false; {27668#false} is VALID [2018-11-23 11:56:50,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 0 proven. 2625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:50,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:50,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2018-11-23 11:56:50,219 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 139 [2018-11-23 11:56:50,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:50,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2018-11-23 11:56:50,356 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:50,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-23 11:56:50,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-23 11:56:50,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 11:56:50,358 INFO L87 Difference]: Start difference. First operand 144 states and 187 transitions. Second operand 46 states. [2018-11-23 11:56:51,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:51,382 INFO L93 Difference]: Finished difference Result 160 states and 206 transitions. [2018-11-23 11:56:51,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-23 11:56:51,382 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 139 [2018-11-23 11:56:51,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:51,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:56:51,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 206 transitions. [2018-11-23 11:56:51,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:56:51,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 206 transitions. [2018-11-23 11:56:51,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 206 transitions. [2018-11-23 11:56:51,647 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:51,649 INFO L225 Difference]: With dead ends: 160 [2018-11-23 11:56:51,649 INFO L226 Difference]: Without dead ends: 149 [2018-11-23 11:56:51,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 11:56:51,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-23 11:56:51,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2018-11-23 11:56:51,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:51,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand 147 states. [2018-11-23 11:56:51,692 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 147 states. [2018-11-23 11:56:51,692 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 147 states. [2018-11-23 11:56:51,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:51,694 INFO L93 Difference]: Finished difference Result 149 states and 194 transitions. [2018-11-23 11:56:51,694 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 194 transitions. [2018-11-23 11:56:51,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:51,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:51,695 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 149 states. [2018-11-23 11:56:51,695 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 149 states. [2018-11-23 11:56:51,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:51,697 INFO L93 Difference]: Finished difference Result 149 states and 194 transitions. [2018-11-23 11:56:51,697 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 194 transitions. [2018-11-23 11:56:51,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:51,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:51,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:51,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:51,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-23 11:56:51,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 191 transitions. [2018-11-23 11:56:51,699 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 191 transitions. Word has length 139 [2018-11-23 11:56:51,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:51,700 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 191 transitions. [2018-11-23 11:56:51,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-23 11:56:51,700 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 191 transitions. [2018-11-23 11:56:51,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-23 11:56:51,700 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:51,701 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:51,701 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:51,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:51,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1671197219, now seen corresponding path program 43 times [2018-11-23 11:56:51,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:51,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:51,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:51,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:51,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:53,257 INFO L256 TraceCheckUtils]: 0: Hoare triple {28839#true} call ULTIMATE.init(); {28839#true} is VALID [2018-11-23 11:56:53,257 INFO L273 TraceCheckUtils]: 1: Hoare triple {28839#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28839#true} is VALID [2018-11-23 11:56:53,257 INFO L273 TraceCheckUtils]: 2: Hoare triple {28839#true} assume true; {28839#true} is VALID [2018-11-23 11:56:53,258 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28839#true} {28839#true} #55#return; {28839#true} is VALID [2018-11-23 11:56:53,258 INFO L256 TraceCheckUtils]: 4: Hoare triple {28839#true} call #t~ret4 := main(); {28839#true} is VALID [2018-11-23 11:56:53,258 INFO L273 TraceCheckUtils]: 5: Hoare triple {28839#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {28841#(= main_~i~0 0)} is VALID [2018-11-23 11:56:53,259 INFO L273 TraceCheckUtils]: 6: Hoare triple {28841#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28841#(= main_~i~0 0)} is VALID [2018-11-23 11:56:53,259 INFO L273 TraceCheckUtils]: 7: Hoare triple {28841#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28841#(= main_~i~0 0)} is VALID [2018-11-23 11:56:53,260 INFO L273 TraceCheckUtils]: 8: Hoare triple {28841#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {28842#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:53,260 INFO L273 TraceCheckUtils]: 9: Hoare triple {28842#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28842#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:53,261 INFO L273 TraceCheckUtils]: 10: Hoare triple {28842#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28842#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:53,262 INFO L273 TraceCheckUtils]: 11: Hoare triple {28842#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {28843#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:53,262 INFO L273 TraceCheckUtils]: 12: Hoare triple {28843#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28843#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:53,263 INFO L273 TraceCheckUtils]: 13: Hoare triple {28843#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28843#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:53,263 INFO L273 TraceCheckUtils]: 14: Hoare triple {28843#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {28844#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:53,264 INFO L273 TraceCheckUtils]: 15: Hoare triple {28844#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28844#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:53,264 INFO L273 TraceCheckUtils]: 16: Hoare triple {28844#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28844#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:53,265 INFO L273 TraceCheckUtils]: 17: Hoare triple {28844#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {28845#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:53,266 INFO L273 TraceCheckUtils]: 18: Hoare triple {28845#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28845#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:53,266 INFO L273 TraceCheckUtils]: 19: Hoare triple {28845#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28845#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:53,267 INFO L273 TraceCheckUtils]: 20: Hoare triple {28845#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {28846#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:53,267 INFO L273 TraceCheckUtils]: 21: Hoare triple {28846#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28846#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:53,268 INFO L273 TraceCheckUtils]: 22: Hoare triple {28846#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28846#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:53,268 INFO L273 TraceCheckUtils]: 23: Hoare triple {28846#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {28847#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:53,269 INFO L273 TraceCheckUtils]: 24: Hoare triple {28847#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28847#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:53,269 INFO L273 TraceCheckUtils]: 25: Hoare triple {28847#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28847#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:53,270 INFO L273 TraceCheckUtils]: 26: Hoare triple {28847#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {28848#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:53,271 INFO L273 TraceCheckUtils]: 27: Hoare triple {28848#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28848#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:53,271 INFO L273 TraceCheckUtils]: 28: Hoare triple {28848#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28848#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:53,272 INFO L273 TraceCheckUtils]: 29: Hoare triple {28848#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {28849#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:53,272 INFO L273 TraceCheckUtils]: 30: Hoare triple {28849#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28849#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:53,273 INFO L273 TraceCheckUtils]: 31: Hoare triple {28849#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28849#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:53,274 INFO L273 TraceCheckUtils]: 32: Hoare triple {28849#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {28850#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:53,274 INFO L273 TraceCheckUtils]: 33: Hoare triple {28850#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28850#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:53,274 INFO L273 TraceCheckUtils]: 34: Hoare triple {28850#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28850#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:53,275 INFO L273 TraceCheckUtils]: 35: Hoare triple {28850#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {28851#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:53,276 INFO L273 TraceCheckUtils]: 36: Hoare triple {28851#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28851#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:53,276 INFO L273 TraceCheckUtils]: 37: Hoare triple {28851#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28851#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:53,277 INFO L273 TraceCheckUtils]: 38: Hoare triple {28851#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {28852#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:53,277 INFO L273 TraceCheckUtils]: 39: Hoare triple {28852#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28852#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:53,278 INFO L273 TraceCheckUtils]: 40: Hoare triple {28852#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28852#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:53,279 INFO L273 TraceCheckUtils]: 41: Hoare triple {28852#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {28853#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:53,279 INFO L273 TraceCheckUtils]: 42: Hoare triple {28853#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28853#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:53,280 INFO L273 TraceCheckUtils]: 43: Hoare triple {28853#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28853#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:53,280 INFO L273 TraceCheckUtils]: 44: Hoare triple {28853#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {28854#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:53,281 INFO L273 TraceCheckUtils]: 45: Hoare triple {28854#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28854#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:53,281 INFO L273 TraceCheckUtils]: 46: Hoare triple {28854#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28854#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:53,282 INFO L273 TraceCheckUtils]: 47: Hoare triple {28854#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {28855#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:53,282 INFO L273 TraceCheckUtils]: 48: Hoare triple {28855#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28855#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:53,283 INFO L273 TraceCheckUtils]: 49: Hoare triple {28855#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28855#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:53,284 INFO L273 TraceCheckUtils]: 50: Hoare triple {28855#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {28856#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:53,284 INFO L273 TraceCheckUtils]: 51: Hoare triple {28856#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28856#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:53,285 INFO L273 TraceCheckUtils]: 52: Hoare triple {28856#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28856#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:53,285 INFO L273 TraceCheckUtils]: 53: Hoare triple {28856#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {28857#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:53,286 INFO L273 TraceCheckUtils]: 54: Hoare triple {28857#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28857#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:53,286 INFO L273 TraceCheckUtils]: 55: Hoare triple {28857#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28857#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:53,287 INFO L273 TraceCheckUtils]: 56: Hoare triple {28857#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {28858#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:53,288 INFO L273 TraceCheckUtils]: 57: Hoare triple {28858#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28858#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:53,288 INFO L273 TraceCheckUtils]: 58: Hoare triple {28858#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28858#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:53,289 INFO L273 TraceCheckUtils]: 59: Hoare triple {28858#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {28859#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:53,289 INFO L273 TraceCheckUtils]: 60: Hoare triple {28859#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28859#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:53,290 INFO L273 TraceCheckUtils]: 61: Hoare triple {28859#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28859#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:53,290 INFO L273 TraceCheckUtils]: 62: Hoare triple {28859#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {28860#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:53,291 INFO L273 TraceCheckUtils]: 63: Hoare triple {28860#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28860#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:53,291 INFO L273 TraceCheckUtils]: 64: Hoare triple {28860#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28860#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:53,292 INFO L273 TraceCheckUtils]: 65: Hoare triple {28860#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {28861#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:53,293 INFO L273 TraceCheckUtils]: 66: Hoare triple {28861#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28861#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:53,293 INFO L273 TraceCheckUtils]: 67: Hoare triple {28861#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28861#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:53,294 INFO L273 TraceCheckUtils]: 68: Hoare triple {28861#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {28862#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:53,294 INFO L273 TraceCheckUtils]: 69: Hoare triple {28862#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28862#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:53,295 INFO L273 TraceCheckUtils]: 70: Hoare triple {28862#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28862#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:53,296 INFO L273 TraceCheckUtils]: 71: Hoare triple {28862#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {28863#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:53,296 INFO L273 TraceCheckUtils]: 72: Hoare triple {28863#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28863#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:53,296 INFO L273 TraceCheckUtils]: 73: Hoare triple {28863#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28863#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:53,297 INFO L273 TraceCheckUtils]: 74: Hoare triple {28863#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {28864#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:53,298 INFO L273 TraceCheckUtils]: 75: Hoare triple {28864#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28864#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:53,298 INFO L273 TraceCheckUtils]: 76: Hoare triple {28864#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28864#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:53,299 INFO L273 TraceCheckUtils]: 77: Hoare triple {28864#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {28865#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:53,299 INFO L273 TraceCheckUtils]: 78: Hoare triple {28865#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28865#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:53,300 INFO L273 TraceCheckUtils]: 79: Hoare triple {28865#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28865#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:53,301 INFO L273 TraceCheckUtils]: 80: Hoare triple {28865#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {28866#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:53,301 INFO L273 TraceCheckUtils]: 81: Hoare triple {28866#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28866#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:53,302 INFO L273 TraceCheckUtils]: 82: Hoare triple {28866#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28866#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:53,302 INFO L273 TraceCheckUtils]: 83: Hoare triple {28866#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {28867#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:53,303 INFO L273 TraceCheckUtils]: 84: Hoare triple {28867#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28867#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:53,303 INFO L273 TraceCheckUtils]: 85: Hoare triple {28867#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28867#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:53,304 INFO L273 TraceCheckUtils]: 86: Hoare triple {28867#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {28868#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:53,305 INFO L273 TraceCheckUtils]: 87: Hoare triple {28868#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28868#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:53,305 INFO L273 TraceCheckUtils]: 88: Hoare triple {28868#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28868#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:53,306 INFO L273 TraceCheckUtils]: 89: Hoare triple {28868#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {28869#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:53,306 INFO L273 TraceCheckUtils]: 90: Hoare triple {28869#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28869#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:53,307 INFO L273 TraceCheckUtils]: 91: Hoare triple {28869#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28869#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:53,307 INFO L273 TraceCheckUtils]: 92: Hoare triple {28869#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {28870#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:53,308 INFO L273 TraceCheckUtils]: 93: Hoare triple {28870#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28870#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:53,308 INFO L273 TraceCheckUtils]: 94: Hoare triple {28870#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28870#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:53,309 INFO L273 TraceCheckUtils]: 95: Hoare triple {28870#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {28871#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:53,310 INFO L273 TraceCheckUtils]: 96: Hoare triple {28871#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28871#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:53,310 INFO L273 TraceCheckUtils]: 97: Hoare triple {28871#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28871#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:53,311 INFO L273 TraceCheckUtils]: 98: Hoare triple {28871#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {28872#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:53,311 INFO L273 TraceCheckUtils]: 99: Hoare triple {28872#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28872#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:53,312 INFO L273 TraceCheckUtils]: 100: Hoare triple {28872#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28872#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:53,312 INFO L273 TraceCheckUtils]: 101: Hoare triple {28872#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {28873#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:53,313 INFO L273 TraceCheckUtils]: 102: Hoare triple {28873#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28873#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:53,313 INFO L273 TraceCheckUtils]: 103: Hoare triple {28873#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28873#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:53,314 INFO L273 TraceCheckUtils]: 104: Hoare triple {28873#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {28874#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:53,315 INFO L273 TraceCheckUtils]: 105: Hoare triple {28874#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28874#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:53,315 INFO L273 TraceCheckUtils]: 106: Hoare triple {28874#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28874#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:53,316 INFO L273 TraceCheckUtils]: 107: Hoare triple {28874#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {28875#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:53,316 INFO L273 TraceCheckUtils]: 108: Hoare triple {28875#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28875#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:53,317 INFO L273 TraceCheckUtils]: 109: Hoare triple {28875#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28875#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:53,318 INFO L273 TraceCheckUtils]: 110: Hoare triple {28875#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {28876#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:53,318 INFO L273 TraceCheckUtils]: 111: Hoare triple {28876#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28876#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:53,319 INFO L273 TraceCheckUtils]: 112: Hoare triple {28876#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28876#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:53,319 INFO L273 TraceCheckUtils]: 113: Hoare triple {28876#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {28877#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:53,320 INFO L273 TraceCheckUtils]: 114: Hoare triple {28877#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28877#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:53,320 INFO L273 TraceCheckUtils]: 115: Hoare triple {28877#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28877#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:53,321 INFO L273 TraceCheckUtils]: 116: Hoare triple {28877#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {28878#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:53,321 INFO L273 TraceCheckUtils]: 117: Hoare triple {28878#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28878#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:53,322 INFO L273 TraceCheckUtils]: 118: Hoare triple {28878#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28878#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:53,323 INFO L273 TraceCheckUtils]: 119: Hoare triple {28878#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {28879#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:53,323 INFO L273 TraceCheckUtils]: 120: Hoare triple {28879#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28879#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:53,324 INFO L273 TraceCheckUtils]: 121: Hoare triple {28879#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28879#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:53,324 INFO L273 TraceCheckUtils]: 122: Hoare triple {28879#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {28880#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:53,325 INFO L273 TraceCheckUtils]: 123: Hoare triple {28880#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28880#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:53,325 INFO L273 TraceCheckUtils]: 124: Hoare triple {28880#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28880#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:53,326 INFO L273 TraceCheckUtils]: 125: Hoare triple {28880#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {28881#(<= main_~i~0 40)} is VALID [2018-11-23 11:56:53,327 INFO L273 TraceCheckUtils]: 126: Hoare triple {28881#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28881#(<= main_~i~0 40)} is VALID [2018-11-23 11:56:53,327 INFO L273 TraceCheckUtils]: 127: Hoare triple {28881#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28881#(<= main_~i~0 40)} is VALID [2018-11-23 11:56:53,328 INFO L273 TraceCheckUtils]: 128: Hoare triple {28881#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {28882#(<= main_~i~0 41)} is VALID [2018-11-23 11:56:53,328 INFO L273 TraceCheckUtils]: 129: Hoare triple {28882#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28882#(<= main_~i~0 41)} is VALID [2018-11-23 11:56:53,329 INFO L273 TraceCheckUtils]: 130: Hoare triple {28882#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28882#(<= main_~i~0 41)} is VALID [2018-11-23 11:56:53,329 INFO L273 TraceCheckUtils]: 131: Hoare triple {28882#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {28883#(<= main_~i~0 42)} is VALID [2018-11-23 11:56:53,330 INFO L273 TraceCheckUtils]: 132: Hoare triple {28883#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28883#(<= main_~i~0 42)} is VALID [2018-11-23 11:56:53,330 INFO L273 TraceCheckUtils]: 133: Hoare triple {28883#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28883#(<= main_~i~0 42)} is VALID [2018-11-23 11:56:53,331 INFO L273 TraceCheckUtils]: 134: Hoare triple {28883#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {28884#(<= main_~i~0 43)} is VALID [2018-11-23 11:56:53,332 INFO L273 TraceCheckUtils]: 135: Hoare triple {28884#(<= main_~i~0 43)} assume !(~i~0 < 100000); {28840#false} is VALID [2018-11-23 11:56:53,332 INFO L273 TraceCheckUtils]: 136: Hoare triple {28840#false} havoc ~x~0;~x~0 := 0; {28840#false} is VALID [2018-11-23 11:56:53,332 INFO L273 TraceCheckUtils]: 137: Hoare triple {28840#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {28840#false} is VALID [2018-11-23 11:56:53,332 INFO L256 TraceCheckUtils]: 138: Hoare triple {28840#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {28840#false} is VALID [2018-11-23 11:56:53,333 INFO L273 TraceCheckUtils]: 139: Hoare triple {28840#false} ~cond := #in~cond; {28840#false} is VALID [2018-11-23 11:56:53,333 INFO L273 TraceCheckUtils]: 140: Hoare triple {28840#false} assume 0 == ~cond; {28840#false} is VALID [2018-11-23 11:56:53,333 INFO L273 TraceCheckUtils]: 141: Hoare triple {28840#false} assume !false; {28840#false} is VALID [2018-11-23 11:56:53,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:53,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:53,347 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:53,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:56:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:53,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:53,878 INFO L256 TraceCheckUtils]: 0: Hoare triple {28839#true} call ULTIMATE.init(); {28839#true} is VALID [2018-11-23 11:56:53,878 INFO L273 TraceCheckUtils]: 1: Hoare triple {28839#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28839#true} is VALID [2018-11-23 11:56:53,878 INFO L273 TraceCheckUtils]: 2: Hoare triple {28839#true} assume true; {28839#true} is VALID [2018-11-23 11:56:53,879 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28839#true} {28839#true} #55#return; {28839#true} is VALID [2018-11-23 11:56:53,879 INFO L256 TraceCheckUtils]: 4: Hoare triple {28839#true} call #t~ret4 := main(); {28839#true} is VALID [2018-11-23 11:56:53,879 INFO L273 TraceCheckUtils]: 5: Hoare triple {28839#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {28903#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:53,880 INFO L273 TraceCheckUtils]: 6: Hoare triple {28903#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28903#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:53,880 INFO L273 TraceCheckUtils]: 7: Hoare triple {28903#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28903#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:53,881 INFO L273 TraceCheckUtils]: 8: Hoare triple {28903#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {28842#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:53,881 INFO L273 TraceCheckUtils]: 9: Hoare triple {28842#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28842#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:53,881 INFO L273 TraceCheckUtils]: 10: Hoare triple {28842#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28842#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:53,882 INFO L273 TraceCheckUtils]: 11: Hoare triple {28842#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {28843#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:53,882 INFO L273 TraceCheckUtils]: 12: Hoare triple {28843#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28843#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:53,883 INFO L273 TraceCheckUtils]: 13: Hoare triple {28843#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28843#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:53,883 INFO L273 TraceCheckUtils]: 14: Hoare triple {28843#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {28844#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:53,884 INFO L273 TraceCheckUtils]: 15: Hoare triple {28844#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28844#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:53,884 INFO L273 TraceCheckUtils]: 16: Hoare triple {28844#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28844#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:53,885 INFO L273 TraceCheckUtils]: 17: Hoare triple {28844#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {28845#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:53,885 INFO L273 TraceCheckUtils]: 18: Hoare triple {28845#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28845#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:53,886 INFO L273 TraceCheckUtils]: 19: Hoare triple {28845#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28845#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:53,887 INFO L273 TraceCheckUtils]: 20: Hoare triple {28845#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {28846#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:53,887 INFO L273 TraceCheckUtils]: 21: Hoare triple {28846#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28846#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:53,888 INFO L273 TraceCheckUtils]: 22: Hoare triple {28846#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28846#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:53,888 INFO L273 TraceCheckUtils]: 23: Hoare triple {28846#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {28847#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:53,889 INFO L273 TraceCheckUtils]: 24: Hoare triple {28847#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28847#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:53,889 INFO L273 TraceCheckUtils]: 25: Hoare triple {28847#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28847#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:53,890 INFO L273 TraceCheckUtils]: 26: Hoare triple {28847#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {28848#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:53,891 INFO L273 TraceCheckUtils]: 27: Hoare triple {28848#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28848#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:53,891 INFO L273 TraceCheckUtils]: 28: Hoare triple {28848#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28848#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:53,892 INFO L273 TraceCheckUtils]: 29: Hoare triple {28848#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {28849#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:53,892 INFO L273 TraceCheckUtils]: 30: Hoare triple {28849#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28849#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:53,893 INFO L273 TraceCheckUtils]: 31: Hoare triple {28849#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28849#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:53,893 INFO L273 TraceCheckUtils]: 32: Hoare triple {28849#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {28850#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:53,894 INFO L273 TraceCheckUtils]: 33: Hoare triple {28850#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28850#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:53,894 INFO L273 TraceCheckUtils]: 34: Hoare triple {28850#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28850#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:53,895 INFO L273 TraceCheckUtils]: 35: Hoare triple {28850#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {28851#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:53,896 INFO L273 TraceCheckUtils]: 36: Hoare triple {28851#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28851#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:53,896 INFO L273 TraceCheckUtils]: 37: Hoare triple {28851#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28851#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:53,897 INFO L273 TraceCheckUtils]: 38: Hoare triple {28851#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {28852#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:53,897 INFO L273 TraceCheckUtils]: 39: Hoare triple {28852#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28852#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:53,898 INFO L273 TraceCheckUtils]: 40: Hoare triple {28852#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28852#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:53,898 INFO L273 TraceCheckUtils]: 41: Hoare triple {28852#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {28853#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:53,899 INFO L273 TraceCheckUtils]: 42: Hoare triple {28853#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28853#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:53,899 INFO L273 TraceCheckUtils]: 43: Hoare triple {28853#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28853#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:53,900 INFO L273 TraceCheckUtils]: 44: Hoare triple {28853#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {28854#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:53,901 INFO L273 TraceCheckUtils]: 45: Hoare triple {28854#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28854#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:53,901 INFO L273 TraceCheckUtils]: 46: Hoare triple {28854#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28854#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:53,902 INFO L273 TraceCheckUtils]: 47: Hoare triple {28854#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {28855#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:53,902 INFO L273 TraceCheckUtils]: 48: Hoare triple {28855#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28855#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:53,903 INFO L273 TraceCheckUtils]: 49: Hoare triple {28855#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28855#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:53,904 INFO L273 TraceCheckUtils]: 50: Hoare triple {28855#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {28856#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:53,904 INFO L273 TraceCheckUtils]: 51: Hoare triple {28856#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28856#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:53,905 INFO L273 TraceCheckUtils]: 52: Hoare triple {28856#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28856#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:53,905 INFO L273 TraceCheckUtils]: 53: Hoare triple {28856#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {28857#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:53,906 INFO L273 TraceCheckUtils]: 54: Hoare triple {28857#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28857#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:53,906 INFO L273 TraceCheckUtils]: 55: Hoare triple {28857#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28857#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:53,907 INFO L273 TraceCheckUtils]: 56: Hoare triple {28857#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {28858#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:53,907 INFO L273 TraceCheckUtils]: 57: Hoare triple {28858#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28858#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:53,908 INFO L273 TraceCheckUtils]: 58: Hoare triple {28858#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28858#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:53,909 INFO L273 TraceCheckUtils]: 59: Hoare triple {28858#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {28859#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:53,909 INFO L273 TraceCheckUtils]: 60: Hoare triple {28859#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28859#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:53,910 INFO L273 TraceCheckUtils]: 61: Hoare triple {28859#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28859#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:53,910 INFO L273 TraceCheckUtils]: 62: Hoare triple {28859#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {28860#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:53,911 INFO L273 TraceCheckUtils]: 63: Hoare triple {28860#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28860#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:53,911 INFO L273 TraceCheckUtils]: 64: Hoare triple {28860#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28860#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:53,912 INFO L273 TraceCheckUtils]: 65: Hoare triple {28860#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {28861#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:53,913 INFO L273 TraceCheckUtils]: 66: Hoare triple {28861#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28861#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:53,913 INFO L273 TraceCheckUtils]: 67: Hoare triple {28861#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28861#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:53,914 INFO L273 TraceCheckUtils]: 68: Hoare triple {28861#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {28862#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:53,914 INFO L273 TraceCheckUtils]: 69: Hoare triple {28862#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28862#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:53,915 INFO L273 TraceCheckUtils]: 70: Hoare triple {28862#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28862#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:53,915 INFO L273 TraceCheckUtils]: 71: Hoare triple {28862#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {28863#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:53,916 INFO L273 TraceCheckUtils]: 72: Hoare triple {28863#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28863#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:53,916 INFO L273 TraceCheckUtils]: 73: Hoare triple {28863#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28863#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:53,917 INFO L273 TraceCheckUtils]: 74: Hoare triple {28863#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {28864#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:53,918 INFO L273 TraceCheckUtils]: 75: Hoare triple {28864#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28864#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:53,918 INFO L273 TraceCheckUtils]: 76: Hoare triple {28864#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28864#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:53,919 INFO L273 TraceCheckUtils]: 77: Hoare triple {28864#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {28865#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:53,919 INFO L273 TraceCheckUtils]: 78: Hoare triple {28865#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28865#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:53,920 INFO L273 TraceCheckUtils]: 79: Hoare triple {28865#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28865#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:53,921 INFO L273 TraceCheckUtils]: 80: Hoare triple {28865#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {28866#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:53,921 INFO L273 TraceCheckUtils]: 81: Hoare triple {28866#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28866#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:53,922 INFO L273 TraceCheckUtils]: 82: Hoare triple {28866#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28866#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:53,922 INFO L273 TraceCheckUtils]: 83: Hoare triple {28866#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {28867#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:53,923 INFO L273 TraceCheckUtils]: 84: Hoare triple {28867#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28867#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:53,923 INFO L273 TraceCheckUtils]: 85: Hoare triple {28867#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28867#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:53,924 INFO L273 TraceCheckUtils]: 86: Hoare triple {28867#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {28868#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:53,924 INFO L273 TraceCheckUtils]: 87: Hoare triple {28868#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28868#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:53,925 INFO L273 TraceCheckUtils]: 88: Hoare triple {28868#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28868#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:53,926 INFO L273 TraceCheckUtils]: 89: Hoare triple {28868#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {28869#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:53,926 INFO L273 TraceCheckUtils]: 90: Hoare triple {28869#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28869#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:53,927 INFO L273 TraceCheckUtils]: 91: Hoare triple {28869#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28869#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:53,927 INFO L273 TraceCheckUtils]: 92: Hoare triple {28869#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {28870#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:53,928 INFO L273 TraceCheckUtils]: 93: Hoare triple {28870#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28870#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:53,928 INFO L273 TraceCheckUtils]: 94: Hoare triple {28870#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28870#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:53,929 INFO L273 TraceCheckUtils]: 95: Hoare triple {28870#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {28871#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:53,930 INFO L273 TraceCheckUtils]: 96: Hoare triple {28871#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28871#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:53,930 INFO L273 TraceCheckUtils]: 97: Hoare triple {28871#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28871#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:53,931 INFO L273 TraceCheckUtils]: 98: Hoare triple {28871#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {28872#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:53,931 INFO L273 TraceCheckUtils]: 99: Hoare triple {28872#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28872#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:53,932 INFO L273 TraceCheckUtils]: 100: Hoare triple {28872#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28872#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:53,933 INFO L273 TraceCheckUtils]: 101: Hoare triple {28872#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {28873#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:53,933 INFO L273 TraceCheckUtils]: 102: Hoare triple {28873#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28873#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:53,933 INFO L273 TraceCheckUtils]: 103: Hoare triple {28873#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28873#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:53,934 INFO L273 TraceCheckUtils]: 104: Hoare triple {28873#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {28874#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:53,935 INFO L273 TraceCheckUtils]: 105: Hoare triple {28874#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28874#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:53,935 INFO L273 TraceCheckUtils]: 106: Hoare triple {28874#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28874#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:53,936 INFO L273 TraceCheckUtils]: 107: Hoare triple {28874#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {28875#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:53,936 INFO L273 TraceCheckUtils]: 108: Hoare triple {28875#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28875#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:53,937 INFO L273 TraceCheckUtils]: 109: Hoare triple {28875#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28875#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:53,938 INFO L273 TraceCheckUtils]: 110: Hoare triple {28875#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {28876#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:53,938 INFO L273 TraceCheckUtils]: 111: Hoare triple {28876#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28876#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:53,939 INFO L273 TraceCheckUtils]: 112: Hoare triple {28876#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28876#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:53,939 INFO L273 TraceCheckUtils]: 113: Hoare triple {28876#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {28877#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:53,940 INFO L273 TraceCheckUtils]: 114: Hoare triple {28877#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28877#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:53,940 INFO L273 TraceCheckUtils]: 115: Hoare triple {28877#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28877#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:53,941 INFO L273 TraceCheckUtils]: 116: Hoare triple {28877#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {28878#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:53,942 INFO L273 TraceCheckUtils]: 117: Hoare triple {28878#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28878#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:53,942 INFO L273 TraceCheckUtils]: 118: Hoare triple {28878#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28878#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:53,943 INFO L273 TraceCheckUtils]: 119: Hoare triple {28878#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {28879#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:53,943 INFO L273 TraceCheckUtils]: 120: Hoare triple {28879#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28879#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:53,944 INFO L273 TraceCheckUtils]: 121: Hoare triple {28879#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28879#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:53,945 INFO L273 TraceCheckUtils]: 122: Hoare triple {28879#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {28880#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:53,945 INFO L273 TraceCheckUtils]: 123: Hoare triple {28880#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28880#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:53,946 INFO L273 TraceCheckUtils]: 124: Hoare triple {28880#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28880#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:53,946 INFO L273 TraceCheckUtils]: 125: Hoare triple {28880#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {28881#(<= main_~i~0 40)} is VALID [2018-11-23 11:56:53,947 INFO L273 TraceCheckUtils]: 126: Hoare triple {28881#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28881#(<= main_~i~0 40)} is VALID [2018-11-23 11:56:53,947 INFO L273 TraceCheckUtils]: 127: Hoare triple {28881#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28881#(<= main_~i~0 40)} is VALID [2018-11-23 11:56:53,948 INFO L273 TraceCheckUtils]: 128: Hoare triple {28881#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {28882#(<= main_~i~0 41)} is VALID [2018-11-23 11:56:53,948 INFO L273 TraceCheckUtils]: 129: Hoare triple {28882#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28882#(<= main_~i~0 41)} is VALID [2018-11-23 11:56:53,949 INFO L273 TraceCheckUtils]: 130: Hoare triple {28882#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28882#(<= main_~i~0 41)} is VALID [2018-11-23 11:56:53,950 INFO L273 TraceCheckUtils]: 131: Hoare triple {28882#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {28883#(<= main_~i~0 42)} is VALID [2018-11-23 11:56:53,950 INFO L273 TraceCheckUtils]: 132: Hoare triple {28883#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28883#(<= main_~i~0 42)} is VALID [2018-11-23 11:56:53,951 INFO L273 TraceCheckUtils]: 133: Hoare triple {28883#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {28883#(<= main_~i~0 42)} is VALID [2018-11-23 11:56:53,951 INFO L273 TraceCheckUtils]: 134: Hoare triple {28883#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {28884#(<= main_~i~0 43)} is VALID [2018-11-23 11:56:53,952 INFO L273 TraceCheckUtils]: 135: Hoare triple {28884#(<= main_~i~0 43)} assume !(~i~0 < 100000); {28840#false} is VALID [2018-11-23 11:56:53,952 INFO L273 TraceCheckUtils]: 136: Hoare triple {28840#false} havoc ~x~0;~x~0 := 0; {28840#false} is VALID [2018-11-23 11:56:53,952 INFO L273 TraceCheckUtils]: 137: Hoare triple {28840#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {28840#false} is VALID [2018-11-23 11:56:53,953 INFO L256 TraceCheckUtils]: 138: Hoare triple {28840#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {28840#false} is VALID [2018-11-23 11:56:53,953 INFO L273 TraceCheckUtils]: 139: Hoare triple {28840#false} ~cond := #in~cond; {28840#false} is VALID [2018-11-23 11:56:53,953 INFO L273 TraceCheckUtils]: 140: Hoare triple {28840#false} assume 0 == ~cond; {28840#false} is VALID [2018-11-23 11:56:53,953 INFO L273 TraceCheckUtils]: 141: Hoare triple {28840#false} assume !false; {28840#false} is VALID [2018-11-23 11:56:53,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:53,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:53,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2018-11-23 11:56:53,986 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 142 [2018-11-23 11:56:53,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:53,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states. [2018-11-23 11:56:54,127 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:54,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-23 11:56:54,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-23 11:56:54,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 11:56:54,128 INFO L87 Difference]: Start difference. First operand 147 states and 191 transitions. Second operand 47 states. [2018-11-23 11:56:54,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:54,864 INFO L93 Difference]: Finished difference Result 163 states and 210 transitions. [2018-11-23 11:56:54,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-23 11:56:54,865 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 142 [2018-11-23 11:56:54,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:54,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 11:56:54,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 210 transitions. [2018-11-23 11:56:54,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 11:56:54,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 210 transitions. [2018-11-23 11:56:54,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 210 transitions. [2018-11-23 11:56:55,102 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:55,105 INFO L225 Difference]: With dead ends: 163 [2018-11-23 11:56:55,105 INFO L226 Difference]: Without dead ends: 152 [2018-11-23 11:56:55,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 11:56:55,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-23 11:56:55,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-11-23 11:56:55,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:55,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 150 states. [2018-11-23 11:56:55,161 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 150 states. [2018-11-23 11:56:55,161 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 150 states. [2018-11-23 11:56:55,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:55,164 INFO L93 Difference]: Finished difference Result 152 states and 198 transitions. [2018-11-23 11:56:55,164 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 198 transitions. [2018-11-23 11:56:55,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:55,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:55,164 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 152 states. [2018-11-23 11:56:55,164 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 152 states. [2018-11-23 11:56:55,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:55,167 INFO L93 Difference]: Finished difference Result 152 states and 198 transitions. [2018-11-23 11:56:55,167 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 198 transitions. [2018-11-23 11:56:55,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:55,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:55,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:55,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:55,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-23 11:56:55,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 195 transitions. [2018-11-23 11:56:55,170 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 195 transitions. Word has length 142 [2018-11-23 11:56:55,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:55,170 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 195 transitions. [2018-11-23 11:56:55,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-23 11:56:55,170 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 195 transitions. [2018-11-23 11:56:55,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-23 11:56:55,171 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:55,171 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:55,171 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:55,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:55,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1579178183, now seen corresponding path program 44 times [2018-11-23 11:56:55,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:55,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:55,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:55,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:56:55,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:56,272 INFO L256 TraceCheckUtils]: 0: Hoare triple {30035#true} call ULTIMATE.init(); {30035#true} is VALID [2018-11-23 11:56:56,272 INFO L273 TraceCheckUtils]: 1: Hoare triple {30035#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30035#true} is VALID [2018-11-23 11:56:56,272 INFO L273 TraceCheckUtils]: 2: Hoare triple {30035#true} assume true; {30035#true} is VALID [2018-11-23 11:56:56,272 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30035#true} {30035#true} #55#return; {30035#true} is VALID [2018-11-23 11:56:56,272 INFO L256 TraceCheckUtils]: 4: Hoare triple {30035#true} call #t~ret4 := main(); {30035#true} is VALID [2018-11-23 11:56:56,273 INFO L273 TraceCheckUtils]: 5: Hoare triple {30035#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {30037#(= main_~i~0 0)} is VALID [2018-11-23 11:56:56,273 INFO L273 TraceCheckUtils]: 6: Hoare triple {30037#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30037#(= main_~i~0 0)} is VALID [2018-11-23 11:56:56,273 INFO L273 TraceCheckUtils]: 7: Hoare triple {30037#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30037#(= main_~i~0 0)} is VALID [2018-11-23 11:56:56,274 INFO L273 TraceCheckUtils]: 8: Hoare triple {30037#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {30038#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:56,274 INFO L273 TraceCheckUtils]: 9: Hoare triple {30038#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30038#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:56,275 INFO L273 TraceCheckUtils]: 10: Hoare triple {30038#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30038#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:56,276 INFO L273 TraceCheckUtils]: 11: Hoare triple {30038#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {30039#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:56,276 INFO L273 TraceCheckUtils]: 12: Hoare triple {30039#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30039#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:56,277 INFO L273 TraceCheckUtils]: 13: Hoare triple {30039#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30039#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:56,277 INFO L273 TraceCheckUtils]: 14: Hoare triple {30039#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {30040#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:56,278 INFO L273 TraceCheckUtils]: 15: Hoare triple {30040#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30040#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:56,278 INFO L273 TraceCheckUtils]: 16: Hoare triple {30040#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30040#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:56,279 INFO L273 TraceCheckUtils]: 17: Hoare triple {30040#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {30041#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:56,280 INFO L273 TraceCheckUtils]: 18: Hoare triple {30041#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30041#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:56,280 INFO L273 TraceCheckUtils]: 19: Hoare triple {30041#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30041#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:56,281 INFO L273 TraceCheckUtils]: 20: Hoare triple {30041#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {30042#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:56,281 INFO L273 TraceCheckUtils]: 21: Hoare triple {30042#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30042#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:56,282 INFO L273 TraceCheckUtils]: 22: Hoare triple {30042#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30042#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:56,282 INFO L273 TraceCheckUtils]: 23: Hoare triple {30042#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {30043#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:56,283 INFO L273 TraceCheckUtils]: 24: Hoare triple {30043#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30043#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:56,283 INFO L273 TraceCheckUtils]: 25: Hoare triple {30043#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30043#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:56,284 INFO L273 TraceCheckUtils]: 26: Hoare triple {30043#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {30044#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:56,285 INFO L273 TraceCheckUtils]: 27: Hoare triple {30044#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30044#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:56,285 INFO L273 TraceCheckUtils]: 28: Hoare triple {30044#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30044#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:56,286 INFO L273 TraceCheckUtils]: 29: Hoare triple {30044#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {30045#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:56,286 INFO L273 TraceCheckUtils]: 30: Hoare triple {30045#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30045#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:56,287 INFO L273 TraceCheckUtils]: 31: Hoare triple {30045#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30045#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:56,287 INFO L273 TraceCheckUtils]: 32: Hoare triple {30045#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {30046#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:56,288 INFO L273 TraceCheckUtils]: 33: Hoare triple {30046#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30046#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:56,288 INFO L273 TraceCheckUtils]: 34: Hoare triple {30046#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30046#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:56,289 INFO L273 TraceCheckUtils]: 35: Hoare triple {30046#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {30047#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:56,290 INFO L273 TraceCheckUtils]: 36: Hoare triple {30047#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30047#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:56,290 INFO L273 TraceCheckUtils]: 37: Hoare triple {30047#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30047#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:56,291 INFO L273 TraceCheckUtils]: 38: Hoare triple {30047#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {30048#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:56,291 INFO L273 TraceCheckUtils]: 39: Hoare triple {30048#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30048#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:56,292 INFO L273 TraceCheckUtils]: 40: Hoare triple {30048#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30048#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:56,293 INFO L273 TraceCheckUtils]: 41: Hoare triple {30048#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {30049#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:56,293 INFO L273 TraceCheckUtils]: 42: Hoare triple {30049#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30049#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:56,294 INFO L273 TraceCheckUtils]: 43: Hoare triple {30049#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30049#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:56,294 INFO L273 TraceCheckUtils]: 44: Hoare triple {30049#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {30050#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:56,295 INFO L273 TraceCheckUtils]: 45: Hoare triple {30050#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30050#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:56,295 INFO L273 TraceCheckUtils]: 46: Hoare triple {30050#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30050#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:56,296 INFO L273 TraceCheckUtils]: 47: Hoare triple {30050#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {30051#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:56,296 INFO L273 TraceCheckUtils]: 48: Hoare triple {30051#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30051#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:56,297 INFO L273 TraceCheckUtils]: 49: Hoare triple {30051#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30051#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:56,298 INFO L273 TraceCheckUtils]: 50: Hoare triple {30051#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {30052#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:56,298 INFO L273 TraceCheckUtils]: 51: Hoare triple {30052#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30052#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:56,299 INFO L273 TraceCheckUtils]: 52: Hoare triple {30052#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30052#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:56,299 INFO L273 TraceCheckUtils]: 53: Hoare triple {30052#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {30053#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:56,300 INFO L273 TraceCheckUtils]: 54: Hoare triple {30053#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30053#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:56,300 INFO L273 TraceCheckUtils]: 55: Hoare triple {30053#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30053#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:56,301 INFO L273 TraceCheckUtils]: 56: Hoare triple {30053#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {30054#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:56,302 INFO L273 TraceCheckUtils]: 57: Hoare triple {30054#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30054#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:56,302 INFO L273 TraceCheckUtils]: 58: Hoare triple {30054#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30054#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:56,303 INFO L273 TraceCheckUtils]: 59: Hoare triple {30054#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {30055#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:56,303 INFO L273 TraceCheckUtils]: 60: Hoare triple {30055#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30055#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:56,304 INFO L273 TraceCheckUtils]: 61: Hoare triple {30055#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30055#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:56,304 INFO L273 TraceCheckUtils]: 62: Hoare triple {30055#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {30056#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:56,305 INFO L273 TraceCheckUtils]: 63: Hoare triple {30056#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30056#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:56,305 INFO L273 TraceCheckUtils]: 64: Hoare triple {30056#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30056#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:56,306 INFO L273 TraceCheckUtils]: 65: Hoare triple {30056#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {30057#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:56,307 INFO L273 TraceCheckUtils]: 66: Hoare triple {30057#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30057#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:56,307 INFO L273 TraceCheckUtils]: 67: Hoare triple {30057#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30057#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:56,308 INFO L273 TraceCheckUtils]: 68: Hoare triple {30057#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {30058#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:56,308 INFO L273 TraceCheckUtils]: 69: Hoare triple {30058#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30058#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:56,309 INFO L273 TraceCheckUtils]: 70: Hoare triple {30058#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30058#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:56,310 INFO L273 TraceCheckUtils]: 71: Hoare triple {30058#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {30059#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:56,310 INFO L273 TraceCheckUtils]: 72: Hoare triple {30059#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30059#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:56,311 INFO L273 TraceCheckUtils]: 73: Hoare triple {30059#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30059#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:56,311 INFO L273 TraceCheckUtils]: 74: Hoare triple {30059#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {30060#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:56,312 INFO L273 TraceCheckUtils]: 75: Hoare triple {30060#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30060#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:56,312 INFO L273 TraceCheckUtils]: 76: Hoare triple {30060#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30060#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:56,313 INFO L273 TraceCheckUtils]: 77: Hoare triple {30060#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {30061#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:56,313 INFO L273 TraceCheckUtils]: 78: Hoare triple {30061#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30061#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:56,314 INFO L273 TraceCheckUtils]: 79: Hoare triple {30061#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30061#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:56,315 INFO L273 TraceCheckUtils]: 80: Hoare triple {30061#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {30062#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:56,315 INFO L273 TraceCheckUtils]: 81: Hoare triple {30062#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30062#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:56,316 INFO L273 TraceCheckUtils]: 82: Hoare triple {30062#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30062#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:56,316 INFO L273 TraceCheckUtils]: 83: Hoare triple {30062#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {30063#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:56,317 INFO L273 TraceCheckUtils]: 84: Hoare triple {30063#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30063#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:56,317 INFO L273 TraceCheckUtils]: 85: Hoare triple {30063#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30063#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:56,318 INFO L273 TraceCheckUtils]: 86: Hoare triple {30063#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {30064#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:56,319 INFO L273 TraceCheckUtils]: 87: Hoare triple {30064#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30064#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:56,319 INFO L273 TraceCheckUtils]: 88: Hoare triple {30064#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30064#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:56,320 INFO L273 TraceCheckUtils]: 89: Hoare triple {30064#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {30065#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:56,320 INFO L273 TraceCheckUtils]: 90: Hoare triple {30065#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30065#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:56,321 INFO L273 TraceCheckUtils]: 91: Hoare triple {30065#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30065#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:56,321 INFO L273 TraceCheckUtils]: 92: Hoare triple {30065#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {30066#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:56,322 INFO L273 TraceCheckUtils]: 93: Hoare triple {30066#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30066#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:56,322 INFO L273 TraceCheckUtils]: 94: Hoare triple {30066#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30066#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:56,323 INFO L273 TraceCheckUtils]: 95: Hoare triple {30066#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {30067#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:56,324 INFO L273 TraceCheckUtils]: 96: Hoare triple {30067#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30067#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:56,324 INFO L273 TraceCheckUtils]: 97: Hoare triple {30067#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30067#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:56,325 INFO L273 TraceCheckUtils]: 98: Hoare triple {30067#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {30068#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:56,325 INFO L273 TraceCheckUtils]: 99: Hoare triple {30068#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30068#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:56,326 INFO L273 TraceCheckUtils]: 100: Hoare triple {30068#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30068#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:56,327 INFO L273 TraceCheckUtils]: 101: Hoare triple {30068#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {30069#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:56,327 INFO L273 TraceCheckUtils]: 102: Hoare triple {30069#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30069#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:56,327 INFO L273 TraceCheckUtils]: 103: Hoare triple {30069#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30069#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:56,328 INFO L273 TraceCheckUtils]: 104: Hoare triple {30069#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {30070#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:56,329 INFO L273 TraceCheckUtils]: 105: Hoare triple {30070#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30070#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:56,329 INFO L273 TraceCheckUtils]: 106: Hoare triple {30070#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30070#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:56,330 INFO L273 TraceCheckUtils]: 107: Hoare triple {30070#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {30071#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:56,330 INFO L273 TraceCheckUtils]: 108: Hoare triple {30071#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30071#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:56,331 INFO L273 TraceCheckUtils]: 109: Hoare triple {30071#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30071#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:56,332 INFO L273 TraceCheckUtils]: 110: Hoare triple {30071#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {30072#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:56,332 INFO L273 TraceCheckUtils]: 111: Hoare triple {30072#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30072#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:56,333 INFO L273 TraceCheckUtils]: 112: Hoare triple {30072#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30072#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:56,333 INFO L273 TraceCheckUtils]: 113: Hoare triple {30072#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {30073#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:56,334 INFO L273 TraceCheckUtils]: 114: Hoare triple {30073#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30073#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:56,334 INFO L273 TraceCheckUtils]: 115: Hoare triple {30073#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30073#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:56,335 INFO L273 TraceCheckUtils]: 116: Hoare triple {30073#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {30074#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:56,335 INFO L273 TraceCheckUtils]: 117: Hoare triple {30074#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30074#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:56,336 INFO L273 TraceCheckUtils]: 118: Hoare triple {30074#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30074#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:56,337 INFO L273 TraceCheckUtils]: 119: Hoare triple {30074#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {30075#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:56,337 INFO L273 TraceCheckUtils]: 120: Hoare triple {30075#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30075#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:56,338 INFO L273 TraceCheckUtils]: 121: Hoare triple {30075#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30075#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:56,338 INFO L273 TraceCheckUtils]: 122: Hoare triple {30075#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {30076#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:56,339 INFO L273 TraceCheckUtils]: 123: Hoare triple {30076#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30076#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:56,339 INFO L273 TraceCheckUtils]: 124: Hoare triple {30076#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30076#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:56,340 INFO L273 TraceCheckUtils]: 125: Hoare triple {30076#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {30077#(<= main_~i~0 40)} is VALID [2018-11-23 11:56:56,341 INFO L273 TraceCheckUtils]: 126: Hoare triple {30077#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30077#(<= main_~i~0 40)} is VALID [2018-11-23 11:56:56,341 INFO L273 TraceCheckUtils]: 127: Hoare triple {30077#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30077#(<= main_~i~0 40)} is VALID [2018-11-23 11:56:56,342 INFO L273 TraceCheckUtils]: 128: Hoare triple {30077#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {30078#(<= main_~i~0 41)} is VALID [2018-11-23 11:56:56,342 INFO L273 TraceCheckUtils]: 129: Hoare triple {30078#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30078#(<= main_~i~0 41)} is VALID [2018-11-23 11:56:56,343 INFO L273 TraceCheckUtils]: 130: Hoare triple {30078#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30078#(<= main_~i~0 41)} is VALID [2018-11-23 11:56:56,343 INFO L273 TraceCheckUtils]: 131: Hoare triple {30078#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {30079#(<= main_~i~0 42)} is VALID [2018-11-23 11:56:56,344 INFO L273 TraceCheckUtils]: 132: Hoare triple {30079#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30079#(<= main_~i~0 42)} is VALID [2018-11-23 11:56:56,344 INFO L273 TraceCheckUtils]: 133: Hoare triple {30079#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30079#(<= main_~i~0 42)} is VALID [2018-11-23 11:56:56,345 INFO L273 TraceCheckUtils]: 134: Hoare triple {30079#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {30080#(<= main_~i~0 43)} is VALID [2018-11-23 11:56:56,346 INFO L273 TraceCheckUtils]: 135: Hoare triple {30080#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30080#(<= main_~i~0 43)} is VALID [2018-11-23 11:56:56,346 INFO L273 TraceCheckUtils]: 136: Hoare triple {30080#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30080#(<= main_~i~0 43)} is VALID [2018-11-23 11:56:56,347 INFO L273 TraceCheckUtils]: 137: Hoare triple {30080#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {30081#(<= main_~i~0 44)} is VALID [2018-11-23 11:56:56,347 INFO L273 TraceCheckUtils]: 138: Hoare triple {30081#(<= main_~i~0 44)} assume !(~i~0 < 100000); {30036#false} is VALID [2018-11-23 11:56:56,348 INFO L273 TraceCheckUtils]: 139: Hoare triple {30036#false} havoc ~x~0;~x~0 := 0; {30036#false} is VALID [2018-11-23 11:56:56,348 INFO L273 TraceCheckUtils]: 140: Hoare triple {30036#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {30036#false} is VALID [2018-11-23 11:56:56,348 INFO L256 TraceCheckUtils]: 141: Hoare triple {30036#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {30036#false} is VALID [2018-11-23 11:56:56,348 INFO L273 TraceCheckUtils]: 142: Hoare triple {30036#false} ~cond := #in~cond; {30036#false} is VALID [2018-11-23 11:56:56,348 INFO L273 TraceCheckUtils]: 143: Hoare triple {30036#false} assume 0 == ~cond; {30036#false} is VALID [2018-11-23 11:56:56,349 INFO L273 TraceCheckUtils]: 144: Hoare triple {30036#false} assume !false; {30036#false} is VALID [2018-11-23 11:56:56,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:56,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:56,363 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:56,372 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:56:56,436 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:56:56,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:56,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:56,868 INFO L256 TraceCheckUtils]: 0: Hoare triple {30035#true} call ULTIMATE.init(); {30035#true} is VALID [2018-11-23 11:56:56,868 INFO L273 TraceCheckUtils]: 1: Hoare triple {30035#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30035#true} is VALID [2018-11-23 11:56:56,869 INFO L273 TraceCheckUtils]: 2: Hoare triple {30035#true} assume true; {30035#true} is VALID [2018-11-23 11:56:56,869 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30035#true} {30035#true} #55#return; {30035#true} is VALID [2018-11-23 11:56:56,869 INFO L256 TraceCheckUtils]: 4: Hoare triple {30035#true} call #t~ret4 := main(); {30035#true} is VALID [2018-11-23 11:56:56,870 INFO L273 TraceCheckUtils]: 5: Hoare triple {30035#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {30100#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:56,870 INFO L273 TraceCheckUtils]: 6: Hoare triple {30100#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30100#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:56,871 INFO L273 TraceCheckUtils]: 7: Hoare triple {30100#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30100#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:56,871 INFO L273 TraceCheckUtils]: 8: Hoare triple {30100#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {30038#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:56,872 INFO L273 TraceCheckUtils]: 9: Hoare triple {30038#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30038#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:56,872 INFO L273 TraceCheckUtils]: 10: Hoare triple {30038#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30038#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:56,872 INFO L273 TraceCheckUtils]: 11: Hoare triple {30038#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {30039#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:56,873 INFO L273 TraceCheckUtils]: 12: Hoare triple {30039#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30039#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:56,873 INFO L273 TraceCheckUtils]: 13: Hoare triple {30039#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30039#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:56,874 INFO L273 TraceCheckUtils]: 14: Hoare triple {30039#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {30040#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:56,874 INFO L273 TraceCheckUtils]: 15: Hoare triple {30040#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30040#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:56,875 INFO L273 TraceCheckUtils]: 16: Hoare triple {30040#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30040#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:56,875 INFO L273 TraceCheckUtils]: 17: Hoare triple {30040#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {30041#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:56,876 INFO L273 TraceCheckUtils]: 18: Hoare triple {30041#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30041#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:56,876 INFO L273 TraceCheckUtils]: 19: Hoare triple {30041#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30041#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:56,877 INFO L273 TraceCheckUtils]: 20: Hoare triple {30041#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {30042#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:56,877 INFO L273 TraceCheckUtils]: 21: Hoare triple {30042#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30042#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:56,878 INFO L273 TraceCheckUtils]: 22: Hoare triple {30042#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30042#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:56,879 INFO L273 TraceCheckUtils]: 23: Hoare triple {30042#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {30043#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:56,879 INFO L273 TraceCheckUtils]: 24: Hoare triple {30043#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30043#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:56,880 INFO L273 TraceCheckUtils]: 25: Hoare triple {30043#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30043#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:56,880 INFO L273 TraceCheckUtils]: 26: Hoare triple {30043#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {30044#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:56,881 INFO L273 TraceCheckUtils]: 27: Hoare triple {30044#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30044#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:56,881 INFO L273 TraceCheckUtils]: 28: Hoare triple {30044#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30044#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:56,882 INFO L273 TraceCheckUtils]: 29: Hoare triple {30044#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {30045#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:56,883 INFO L273 TraceCheckUtils]: 30: Hoare triple {30045#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30045#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:56,883 INFO L273 TraceCheckUtils]: 31: Hoare triple {30045#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30045#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:56,884 INFO L273 TraceCheckUtils]: 32: Hoare triple {30045#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {30046#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:56,884 INFO L273 TraceCheckUtils]: 33: Hoare triple {30046#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30046#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:56,885 INFO L273 TraceCheckUtils]: 34: Hoare triple {30046#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30046#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:56,885 INFO L273 TraceCheckUtils]: 35: Hoare triple {30046#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {30047#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:56,886 INFO L273 TraceCheckUtils]: 36: Hoare triple {30047#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30047#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:56,886 INFO L273 TraceCheckUtils]: 37: Hoare triple {30047#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30047#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:56,887 INFO L273 TraceCheckUtils]: 38: Hoare triple {30047#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {30048#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:56,888 INFO L273 TraceCheckUtils]: 39: Hoare triple {30048#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30048#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:56,888 INFO L273 TraceCheckUtils]: 40: Hoare triple {30048#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30048#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:56,889 INFO L273 TraceCheckUtils]: 41: Hoare triple {30048#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {30049#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:56,889 INFO L273 TraceCheckUtils]: 42: Hoare triple {30049#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30049#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:56,890 INFO L273 TraceCheckUtils]: 43: Hoare triple {30049#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30049#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:56,891 INFO L273 TraceCheckUtils]: 44: Hoare triple {30049#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {30050#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:56,891 INFO L273 TraceCheckUtils]: 45: Hoare triple {30050#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30050#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:56,892 INFO L273 TraceCheckUtils]: 46: Hoare triple {30050#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30050#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:56,892 INFO L273 TraceCheckUtils]: 47: Hoare triple {30050#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {30051#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:56,893 INFO L273 TraceCheckUtils]: 48: Hoare triple {30051#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30051#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:56,893 INFO L273 TraceCheckUtils]: 49: Hoare triple {30051#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30051#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:56,894 INFO L273 TraceCheckUtils]: 50: Hoare triple {30051#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {30052#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:56,894 INFO L273 TraceCheckUtils]: 51: Hoare triple {30052#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30052#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:56,895 INFO L273 TraceCheckUtils]: 52: Hoare triple {30052#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30052#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:56,896 INFO L273 TraceCheckUtils]: 53: Hoare triple {30052#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {30053#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:56,896 INFO L273 TraceCheckUtils]: 54: Hoare triple {30053#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30053#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:56,897 INFO L273 TraceCheckUtils]: 55: Hoare triple {30053#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30053#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:56,897 INFO L273 TraceCheckUtils]: 56: Hoare triple {30053#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {30054#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:56,898 INFO L273 TraceCheckUtils]: 57: Hoare triple {30054#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30054#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:56,898 INFO L273 TraceCheckUtils]: 58: Hoare triple {30054#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30054#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:56,899 INFO L273 TraceCheckUtils]: 59: Hoare triple {30054#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {30055#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:56,900 INFO L273 TraceCheckUtils]: 60: Hoare triple {30055#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30055#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:56,900 INFO L273 TraceCheckUtils]: 61: Hoare triple {30055#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30055#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:56,901 INFO L273 TraceCheckUtils]: 62: Hoare triple {30055#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {30056#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:56,901 INFO L273 TraceCheckUtils]: 63: Hoare triple {30056#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30056#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:56,902 INFO L273 TraceCheckUtils]: 64: Hoare triple {30056#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30056#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:56,902 INFO L273 TraceCheckUtils]: 65: Hoare triple {30056#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {30057#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:56,903 INFO L273 TraceCheckUtils]: 66: Hoare triple {30057#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30057#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:56,903 INFO L273 TraceCheckUtils]: 67: Hoare triple {30057#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30057#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:56,904 INFO L273 TraceCheckUtils]: 68: Hoare triple {30057#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {30058#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:56,905 INFO L273 TraceCheckUtils]: 69: Hoare triple {30058#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30058#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:56,905 INFO L273 TraceCheckUtils]: 70: Hoare triple {30058#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30058#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:56,906 INFO L273 TraceCheckUtils]: 71: Hoare triple {30058#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {30059#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:56,906 INFO L273 TraceCheckUtils]: 72: Hoare triple {30059#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30059#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:56,907 INFO L273 TraceCheckUtils]: 73: Hoare triple {30059#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30059#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:56,908 INFO L273 TraceCheckUtils]: 74: Hoare triple {30059#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {30060#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:56,908 INFO L273 TraceCheckUtils]: 75: Hoare triple {30060#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30060#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:56,909 INFO L273 TraceCheckUtils]: 76: Hoare triple {30060#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30060#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:56,909 INFO L273 TraceCheckUtils]: 77: Hoare triple {30060#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {30061#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:56,910 INFO L273 TraceCheckUtils]: 78: Hoare triple {30061#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30061#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:56,910 INFO L273 TraceCheckUtils]: 79: Hoare triple {30061#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30061#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:56,911 INFO L273 TraceCheckUtils]: 80: Hoare triple {30061#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {30062#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:56,911 INFO L273 TraceCheckUtils]: 81: Hoare triple {30062#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30062#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:56,912 INFO L273 TraceCheckUtils]: 82: Hoare triple {30062#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30062#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:56,913 INFO L273 TraceCheckUtils]: 83: Hoare triple {30062#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {30063#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:56,913 INFO L273 TraceCheckUtils]: 84: Hoare triple {30063#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30063#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:56,914 INFO L273 TraceCheckUtils]: 85: Hoare triple {30063#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30063#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:56,914 INFO L273 TraceCheckUtils]: 86: Hoare triple {30063#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {30064#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:56,915 INFO L273 TraceCheckUtils]: 87: Hoare triple {30064#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30064#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:56,915 INFO L273 TraceCheckUtils]: 88: Hoare triple {30064#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30064#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:56,916 INFO L273 TraceCheckUtils]: 89: Hoare triple {30064#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {30065#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:56,917 INFO L273 TraceCheckUtils]: 90: Hoare triple {30065#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30065#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:56,917 INFO L273 TraceCheckUtils]: 91: Hoare triple {30065#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30065#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:56,918 INFO L273 TraceCheckUtils]: 92: Hoare triple {30065#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {30066#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:56,918 INFO L273 TraceCheckUtils]: 93: Hoare triple {30066#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30066#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:56,919 INFO L273 TraceCheckUtils]: 94: Hoare triple {30066#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30066#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:56,919 INFO L273 TraceCheckUtils]: 95: Hoare triple {30066#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {30067#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:56,920 INFO L273 TraceCheckUtils]: 96: Hoare triple {30067#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30067#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:56,920 INFO L273 TraceCheckUtils]: 97: Hoare triple {30067#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30067#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:56,921 INFO L273 TraceCheckUtils]: 98: Hoare triple {30067#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {30068#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:56,922 INFO L273 TraceCheckUtils]: 99: Hoare triple {30068#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30068#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:56,922 INFO L273 TraceCheckUtils]: 100: Hoare triple {30068#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30068#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:56,923 INFO L273 TraceCheckUtils]: 101: Hoare triple {30068#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {30069#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:56,923 INFO L273 TraceCheckUtils]: 102: Hoare triple {30069#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30069#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:56,924 INFO L273 TraceCheckUtils]: 103: Hoare triple {30069#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30069#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:56,925 INFO L273 TraceCheckUtils]: 104: Hoare triple {30069#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {30070#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:56,925 INFO L273 TraceCheckUtils]: 105: Hoare triple {30070#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30070#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:56,926 INFO L273 TraceCheckUtils]: 106: Hoare triple {30070#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30070#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:56,926 INFO L273 TraceCheckUtils]: 107: Hoare triple {30070#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {30071#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:56,927 INFO L273 TraceCheckUtils]: 108: Hoare triple {30071#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30071#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:56,927 INFO L273 TraceCheckUtils]: 109: Hoare triple {30071#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30071#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:56,928 INFO L273 TraceCheckUtils]: 110: Hoare triple {30071#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {30072#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:56,929 INFO L273 TraceCheckUtils]: 111: Hoare triple {30072#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30072#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:56,929 INFO L273 TraceCheckUtils]: 112: Hoare triple {30072#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30072#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:56,930 INFO L273 TraceCheckUtils]: 113: Hoare triple {30072#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {30073#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:56,930 INFO L273 TraceCheckUtils]: 114: Hoare triple {30073#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30073#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:56,931 INFO L273 TraceCheckUtils]: 115: Hoare triple {30073#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30073#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:56,931 INFO L273 TraceCheckUtils]: 116: Hoare triple {30073#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {30074#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:56,932 INFO L273 TraceCheckUtils]: 117: Hoare triple {30074#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30074#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:56,932 INFO L273 TraceCheckUtils]: 118: Hoare triple {30074#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30074#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:56,933 INFO L273 TraceCheckUtils]: 119: Hoare triple {30074#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {30075#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:56,934 INFO L273 TraceCheckUtils]: 120: Hoare triple {30075#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30075#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:56,934 INFO L273 TraceCheckUtils]: 121: Hoare triple {30075#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30075#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:56,935 INFO L273 TraceCheckUtils]: 122: Hoare triple {30075#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {30076#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:56,935 INFO L273 TraceCheckUtils]: 123: Hoare triple {30076#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30076#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:56,936 INFO L273 TraceCheckUtils]: 124: Hoare triple {30076#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30076#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:56,937 INFO L273 TraceCheckUtils]: 125: Hoare triple {30076#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {30077#(<= main_~i~0 40)} is VALID [2018-11-23 11:56:56,937 INFO L273 TraceCheckUtils]: 126: Hoare triple {30077#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30077#(<= main_~i~0 40)} is VALID [2018-11-23 11:56:56,937 INFO L273 TraceCheckUtils]: 127: Hoare triple {30077#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30077#(<= main_~i~0 40)} is VALID [2018-11-23 11:56:56,938 INFO L273 TraceCheckUtils]: 128: Hoare triple {30077#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {30078#(<= main_~i~0 41)} is VALID [2018-11-23 11:56:56,939 INFO L273 TraceCheckUtils]: 129: Hoare triple {30078#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30078#(<= main_~i~0 41)} is VALID [2018-11-23 11:56:56,939 INFO L273 TraceCheckUtils]: 130: Hoare triple {30078#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30078#(<= main_~i~0 41)} is VALID [2018-11-23 11:56:56,940 INFO L273 TraceCheckUtils]: 131: Hoare triple {30078#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {30079#(<= main_~i~0 42)} is VALID [2018-11-23 11:56:56,940 INFO L273 TraceCheckUtils]: 132: Hoare triple {30079#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30079#(<= main_~i~0 42)} is VALID [2018-11-23 11:56:56,941 INFO L273 TraceCheckUtils]: 133: Hoare triple {30079#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30079#(<= main_~i~0 42)} is VALID [2018-11-23 11:56:56,942 INFO L273 TraceCheckUtils]: 134: Hoare triple {30079#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {30080#(<= main_~i~0 43)} is VALID [2018-11-23 11:56:56,942 INFO L273 TraceCheckUtils]: 135: Hoare triple {30080#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30080#(<= main_~i~0 43)} is VALID [2018-11-23 11:56:56,943 INFO L273 TraceCheckUtils]: 136: Hoare triple {30080#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {30080#(<= main_~i~0 43)} is VALID [2018-11-23 11:56:56,943 INFO L273 TraceCheckUtils]: 137: Hoare triple {30080#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {30081#(<= main_~i~0 44)} is VALID [2018-11-23 11:56:56,944 INFO L273 TraceCheckUtils]: 138: Hoare triple {30081#(<= main_~i~0 44)} assume !(~i~0 < 100000); {30036#false} is VALID [2018-11-23 11:56:56,944 INFO L273 TraceCheckUtils]: 139: Hoare triple {30036#false} havoc ~x~0;~x~0 := 0; {30036#false} is VALID [2018-11-23 11:56:56,944 INFO L273 TraceCheckUtils]: 140: Hoare triple {30036#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {30036#false} is VALID [2018-11-23 11:56:56,945 INFO L256 TraceCheckUtils]: 141: Hoare triple {30036#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {30036#false} is VALID [2018-11-23 11:56:56,945 INFO L273 TraceCheckUtils]: 142: Hoare triple {30036#false} ~cond := #in~cond; {30036#false} is VALID [2018-11-23 11:56:56,945 INFO L273 TraceCheckUtils]: 143: Hoare triple {30036#false} assume 0 == ~cond; {30036#false} is VALID [2018-11-23 11:56:56,945 INFO L273 TraceCheckUtils]: 144: Hoare triple {30036#false} assume !false; {30036#false} is VALID [2018-11-23 11:56:56,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:56,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:56,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2018-11-23 11:56:56,979 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 145 [2018-11-23 11:56:56,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:56,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 11:56:57,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:57,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 11:56:57,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 11:56:57,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 11:56:57,125 INFO L87 Difference]: Start difference. First operand 150 states and 195 transitions. Second operand 48 states. [2018-11-23 11:56:57,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:57,653 INFO L93 Difference]: Finished difference Result 166 states and 214 transitions. [2018-11-23 11:56:57,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-23 11:56:57,653 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 145 [2018-11-23 11:56:57,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:57,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:56:57,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 214 transitions. [2018-11-23 11:56:57,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:56:57,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 214 transitions. [2018-11-23 11:56:57,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 214 transitions. [2018-11-23 11:56:57,856 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:57,859 INFO L225 Difference]: With dead ends: 166 [2018-11-23 11:56:57,859 INFO L226 Difference]: Without dead ends: 155 [2018-11-23 11:56:57,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 11:56:57,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-23 11:56:57,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2018-11-23 11:56:57,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:57,894 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand 153 states. [2018-11-23 11:56:57,894 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 153 states. [2018-11-23 11:56:57,894 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 153 states. [2018-11-23 11:56:57,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:57,896 INFO L93 Difference]: Finished difference Result 155 states and 202 transitions. [2018-11-23 11:56:57,896 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 202 transitions. [2018-11-23 11:56:57,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:57,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:57,896 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 155 states. [2018-11-23 11:56:57,896 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 155 states. [2018-11-23 11:56:57,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:57,898 INFO L93 Difference]: Finished difference Result 155 states and 202 transitions. [2018-11-23 11:56:57,898 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 202 transitions. [2018-11-23 11:56:57,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:57,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:57,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:57,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:57,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-23 11:56:57,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 199 transitions. [2018-11-23 11:56:57,901 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 199 transitions. Word has length 145 [2018-11-23 11:56:57,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:57,901 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 199 transitions. [2018-11-23 11:56:57,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 11:56:57,901 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 199 transitions. [2018-11-23 11:56:57,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-23 11:56:57,902 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:57,902 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:56:57,902 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:57,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:57,902 INFO L82 PathProgramCache]: Analyzing trace with hash 819876451, now seen corresponding path program 45 times [2018-11-23 11:56:57,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:57,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:57,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:57,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:57,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:59,086 INFO L256 TraceCheckUtils]: 0: Hoare triple {31255#true} call ULTIMATE.init(); {31255#true} is VALID [2018-11-23 11:56:59,086 INFO L273 TraceCheckUtils]: 1: Hoare triple {31255#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31255#true} is VALID [2018-11-23 11:56:59,086 INFO L273 TraceCheckUtils]: 2: Hoare triple {31255#true} assume true; {31255#true} is VALID [2018-11-23 11:56:59,086 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31255#true} {31255#true} #55#return; {31255#true} is VALID [2018-11-23 11:56:59,086 INFO L256 TraceCheckUtils]: 4: Hoare triple {31255#true} call #t~ret4 := main(); {31255#true} is VALID [2018-11-23 11:56:59,087 INFO L273 TraceCheckUtils]: 5: Hoare triple {31255#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {31257#(= main_~i~0 0)} is VALID [2018-11-23 11:56:59,087 INFO L273 TraceCheckUtils]: 6: Hoare triple {31257#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31257#(= main_~i~0 0)} is VALID [2018-11-23 11:56:59,088 INFO L273 TraceCheckUtils]: 7: Hoare triple {31257#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31257#(= main_~i~0 0)} is VALID [2018-11-23 11:56:59,088 INFO L273 TraceCheckUtils]: 8: Hoare triple {31257#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {31258#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:59,089 INFO L273 TraceCheckUtils]: 9: Hoare triple {31258#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31258#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:59,089 INFO L273 TraceCheckUtils]: 10: Hoare triple {31258#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31258#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:59,089 INFO L273 TraceCheckUtils]: 11: Hoare triple {31258#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {31259#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:59,090 INFO L273 TraceCheckUtils]: 12: Hoare triple {31259#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31259#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:59,090 INFO L273 TraceCheckUtils]: 13: Hoare triple {31259#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31259#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:59,091 INFO L273 TraceCheckUtils]: 14: Hoare triple {31259#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {31260#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:59,091 INFO L273 TraceCheckUtils]: 15: Hoare triple {31260#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31260#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:59,092 INFO L273 TraceCheckUtils]: 16: Hoare triple {31260#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31260#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:59,092 INFO L273 TraceCheckUtils]: 17: Hoare triple {31260#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {31261#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:59,093 INFO L273 TraceCheckUtils]: 18: Hoare triple {31261#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31261#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:59,093 INFO L273 TraceCheckUtils]: 19: Hoare triple {31261#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31261#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:59,094 INFO L273 TraceCheckUtils]: 20: Hoare triple {31261#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {31262#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:59,095 INFO L273 TraceCheckUtils]: 21: Hoare triple {31262#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31262#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:59,095 INFO L273 TraceCheckUtils]: 22: Hoare triple {31262#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31262#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:59,096 INFO L273 TraceCheckUtils]: 23: Hoare triple {31262#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {31263#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:59,096 INFO L273 TraceCheckUtils]: 24: Hoare triple {31263#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31263#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:59,097 INFO L273 TraceCheckUtils]: 25: Hoare triple {31263#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31263#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:59,098 INFO L273 TraceCheckUtils]: 26: Hoare triple {31263#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {31264#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:59,098 INFO L273 TraceCheckUtils]: 27: Hoare triple {31264#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31264#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:59,099 INFO L273 TraceCheckUtils]: 28: Hoare triple {31264#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31264#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:59,099 INFO L273 TraceCheckUtils]: 29: Hoare triple {31264#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {31265#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:59,100 INFO L273 TraceCheckUtils]: 30: Hoare triple {31265#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31265#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:59,100 INFO L273 TraceCheckUtils]: 31: Hoare triple {31265#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31265#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:59,101 INFO L273 TraceCheckUtils]: 32: Hoare triple {31265#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {31266#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:59,101 INFO L273 TraceCheckUtils]: 33: Hoare triple {31266#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31266#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:59,102 INFO L273 TraceCheckUtils]: 34: Hoare triple {31266#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31266#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:59,103 INFO L273 TraceCheckUtils]: 35: Hoare triple {31266#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {31267#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:59,103 INFO L273 TraceCheckUtils]: 36: Hoare triple {31267#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31267#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:59,104 INFO L273 TraceCheckUtils]: 37: Hoare triple {31267#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31267#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:59,104 INFO L273 TraceCheckUtils]: 38: Hoare triple {31267#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {31268#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:59,105 INFO L273 TraceCheckUtils]: 39: Hoare triple {31268#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31268#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:59,105 INFO L273 TraceCheckUtils]: 40: Hoare triple {31268#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31268#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:59,106 INFO L273 TraceCheckUtils]: 41: Hoare triple {31268#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {31269#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:59,107 INFO L273 TraceCheckUtils]: 42: Hoare triple {31269#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31269#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:59,107 INFO L273 TraceCheckUtils]: 43: Hoare triple {31269#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31269#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:59,108 INFO L273 TraceCheckUtils]: 44: Hoare triple {31269#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {31270#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:59,108 INFO L273 TraceCheckUtils]: 45: Hoare triple {31270#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31270#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:59,109 INFO L273 TraceCheckUtils]: 46: Hoare triple {31270#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31270#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:59,109 INFO L273 TraceCheckUtils]: 47: Hoare triple {31270#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {31271#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:59,110 INFO L273 TraceCheckUtils]: 48: Hoare triple {31271#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31271#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:59,110 INFO L273 TraceCheckUtils]: 49: Hoare triple {31271#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31271#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:59,111 INFO L273 TraceCheckUtils]: 50: Hoare triple {31271#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {31272#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:59,112 INFO L273 TraceCheckUtils]: 51: Hoare triple {31272#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31272#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:59,112 INFO L273 TraceCheckUtils]: 52: Hoare triple {31272#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31272#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:59,113 INFO L273 TraceCheckUtils]: 53: Hoare triple {31272#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {31273#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:59,113 INFO L273 TraceCheckUtils]: 54: Hoare triple {31273#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31273#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:59,114 INFO L273 TraceCheckUtils]: 55: Hoare triple {31273#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31273#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:59,115 INFO L273 TraceCheckUtils]: 56: Hoare triple {31273#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {31274#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:59,115 INFO L273 TraceCheckUtils]: 57: Hoare triple {31274#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31274#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:59,116 INFO L273 TraceCheckUtils]: 58: Hoare triple {31274#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31274#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:59,116 INFO L273 TraceCheckUtils]: 59: Hoare triple {31274#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {31275#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:59,117 INFO L273 TraceCheckUtils]: 60: Hoare triple {31275#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31275#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:59,117 INFO L273 TraceCheckUtils]: 61: Hoare triple {31275#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31275#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:59,118 INFO L273 TraceCheckUtils]: 62: Hoare triple {31275#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {31276#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:59,118 INFO L273 TraceCheckUtils]: 63: Hoare triple {31276#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31276#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:59,119 INFO L273 TraceCheckUtils]: 64: Hoare triple {31276#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31276#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:59,120 INFO L273 TraceCheckUtils]: 65: Hoare triple {31276#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {31277#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:59,120 INFO L273 TraceCheckUtils]: 66: Hoare triple {31277#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31277#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:59,121 INFO L273 TraceCheckUtils]: 67: Hoare triple {31277#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31277#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:59,121 INFO L273 TraceCheckUtils]: 68: Hoare triple {31277#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {31278#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:59,122 INFO L273 TraceCheckUtils]: 69: Hoare triple {31278#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31278#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:59,122 INFO L273 TraceCheckUtils]: 70: Hoare triple {31278#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31278#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:59,123 INFO L273 TraceCheckUtils]: 71: Hoare triple {31278#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {31279#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:59,124 INFO L273 TraceCheckUtils]: 72: Hoare triple {31279#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31279#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:59,124 INFO L273 TraceCheckUtils]: 73: Hoare triple {31279#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31279#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:59,125 INFO L273 TraceCheckUtils]: 74: Hoare triple {31279#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {31280#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:59,125 INFO L273 TraceCheckUtils]: 75: Hoare triple {31280#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31280#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:59,126 INFO L273 TraceCheckUtils]: 76: Hoare triple {31280#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31280#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:59,127 INFO L273 TraceCheckUtils]: 77: Hoare triple {31280#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {31281#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:59,127 INFO L273 TraceCheckUtils]: 78: Hoare triple {31281#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31281#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:59,128 INFO L273 TraceCheckUtils]: 79: Hoare triple {31281#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31281#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:59,128 INFO L273 TraceCheckUtils]: 80: Hoare triple {31281#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {31282#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:59,129 INFO L273 TraceCheckUtils]: 81: Hoare triple {31282#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31282#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:59,129 INFO L273 TraceCheckUtils]: 82: Hoare triple {31282#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31282#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:59,130 INFO L273 TraceCheckUtils]: 83: Hoare triple {31282#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {31283#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:59,130 INFO L273 TraceCheckUtils]: 84: Hoare triple {31283#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31283#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:59,131 INFO L273 TraceCheckUtils]: 85: Hoare triple {31283#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31283#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:59,132 INFO L273 TraceCheckUtils]: 86: Hoare triple {31283#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {31284#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:59,132 INFO L273 TraceCheckUtils]: 87: Hoare triple {31284#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31284#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:59,133 INFO L273 TraceCheckUtils]: 88: Hoare triple {31284#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31284#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:59,133 INFO L273 TraceCheckUtils]: 89: Hoare triple {31284#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {31285#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:59,134 INFO L273 TraceCheckUtils]: 90: Hoare triple {31285#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31285#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:59,134 INFO L273 TraceCheckUtils]: 91: Hoare triple {31285#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31285#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:59,135 INFO L273 TraceCheckUtils]: 92: Hoare triple {31285#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {31286#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:59,136 INFO L273 TraceCheckUtils]: 93: Hoare triple {31286#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31286#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:59,136 INFO L273 TraceCheckUtils]: 94: Hoare triple {31286#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31286#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:59,137 INFO L273 TraceCheckUtils]: 95: Hoare triple {31286#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {31287#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:59,137 INFO L273 TraceCheckUtils]: 96: Hoare triple {31287#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31287#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:59,138 INFO L273 TraceCheckUtils]: 97: Hoare triple {31287#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31287#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:59,138 INFO L273 TraceCheckUtils]: 98: Hoare triple {31287#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {31288#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:59,139 INFO L273 TraceCheckUtils]: 99: Hoare triple {31288#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31288#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:59,139 INFO L273 TraceCheckUtils]: 100: Hoare triple {31288#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31288#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:59,140 INFO L273 TraceCheckUtils]: 101: Hoare triple {31288#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {31289#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:59,141 INFO L273 TraceCheckUtils]: 102: Hoare triple {31289#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31289#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:59,141 INFO L273 TraceCheckUtils]: 103: Hoare triple {31289#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31289#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:59,142 INFO L273 TraceCheckUtils]: 104: Hoare triple {31289#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {31290#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:59,142 INFO L273 TraceCheckUtils]: 105: Hoare triple {31290#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31290#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:59,143 INFO L273 TraceCheckUtils]: 106: Hoare triple {31290#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31290#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:59,144 INFO L273 TraceCheckUtils]: 107: Hoare triple {31290#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {31291#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:59,144 INFO L273 TraceCheckUtils]: 108: Hoare triple {31291#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31291#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:59,145 INFO L273 TraceCheckUtils]: 109: Hoare triple {31291#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31291#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:59,145 INFO L273 TraceCheckUtils]: 110: Hoare triple {31291#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {31292#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:59,146 INFO L273 TraceCheckUtils]: 111: Hoare triple {31292#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31292#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:59,146 INFO L273 TraceCheckUtils]: 112: Hoare triple {31292#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31292#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:59,147 INFO L273 TraceCheckUtils]: 113: Hoare triple {31292#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {31293#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:59,147 INFO L273 TraceCheckUtils]: 114: Hoare triple {31293#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31293#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:59,148 INFO L273 TraceCheckUtils]: 115: Hoare triple {31293#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31293#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:59,149 INFO L273 TraceCheckUtils]: 116: Hoare triple {31293#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {31294#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:59,149 INFO L273 TraceCheckUtils]: 117: Hoare triple {31294#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31294#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:59,150 INFO L273 TraceCheckUtils]: 118: Hoare triple {31294#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31294#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:59,150 INFO L273 TraceCheckUtils]: 119: Hoare triple {31294#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {31295#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:59,151 INFO L273 TraceCheckUtils]: 120: Hoare triple {31295#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31295#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:59,151 INFO L273 TraceCheckUtils]: 121: Hoare triple {31295#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31295#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:59,152 INFO L273 TraceCheckUtils]: 122: Hoare triple {31295#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {31296#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:59,153 INFO L273 TraceCheckUtils]: 123: Hoare triple {31296#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31296#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:59,153 INFO L273 TraceCheckUtils]: 124: Hoare triple {31296#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31296#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:59,154 INFO L273 TraceCheckUtils]: 125: Hoare triple {31296#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {31297#(<= main_~i~0 40)} is VALID [2018-11-23 11:56:59,154 INFO L273 TraceCheckUtils]: 126: Hoare triple {31297#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31297#(<= main_~i~0 40)} is VALID [2018-11-23 11:56:59,155 INFO L273 TraceCheckUtils]: 127: Hoare triple {31297#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31297#(<= main_~i~0 40)} is VALID [2018-11-23 11:56:59,155 INFO L273 TraceCheckUtils]: 128: Hoare triple {31297#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {31298#(<= main_~i~0 41)} is VALID [2018-11-23 11:56:59,156 INFO L273 TraceCheckUtils]: 129: Hoare triple {31298#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31298#(<= main_~i~0 41)} is VALID [2018-11-23 11:56:59,156 INFO L273 TraceCheckUtils]: 130: Hoare triple {31298#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31298#(<= main_~i~0 41)} is VALID [2018-11-23 11:56:59,157 INFO L273 TraceCheckUtils]: 131: Hoare triple {31298#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {31299#(<= main_~i~0 42)} is VALID [2018-11-23 11:56:59,158 INFO L273 TraceCheckUtils]: 132: Hoare triple {31299#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31299#(<= main_~i~0 42)} is VALID [2018-11-23 11:56:59,158 INFO L273 TraceCheckUtils]: 133: Hoare triple {31299#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31299#(<= main_~i~0 42)} is VALID [2018-11-23 11:56:59,159 INFO L273 TraceCheckUtils]: 134: Hoare triple {31299#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {31300#(<= main_~i~0 43)} is VALID [2018-11-23 11:56:59,159 INFO L273 TraceCheckUtils]: 135: Hoare triple {31300#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31300#(<= main_~i~0 43)} is VALID [2018-11-23 11:56:59,160 INFO L273 TraceCheckUtils]: 136: Hoare triple {31300#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31300#(<= main_~i~0 43)} is VALID [2018-11-23 11:56:59,161 INFO L273 TraceCheckUtils]: 137: Hoare triple {31300#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {31301#(<= main_~i~0 44)} is VALID [2018-11-23 11:56:59,161 INFO L273 TraceCheckUtils]: 138: Hoare triple {31301#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31301#(<= main_~i~0 44)} is VALID [2018-11-23 11:56:59,162 INFO L273 TraceCheckUtils]: 139: Hoare triple {31301#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31301#(<= main_~i~0 44)} is VALID [2018-11-23 11:56:59,162 INFO L273 TraceCheckUtils]: 140: Hoare triple {31301#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {31302#(<= main_~i~0 45)} is VALID [2018-11-23 11:56:59,163 INFO L273 TraceCheckUtils]: 141: Hoare triple {31302#(<= main_~i~0 45)} assume !(~i~0 < 100000); {31256#false} is VALID [2018-11-23 11:56:59,163 INFO L273 TraceCheckUtils]: 142: Hoare triple {31256#false} havoc ~x~0;~x~0 := 0; {31256#false} is VALID [2018-11-23 11:56:59,163 INFO L273 TraceCheckUtils]: 143: Hoare triple {31256#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {31256#false} is VALID [2018-11-23 11:56:59,164 INFO L256 TraceCheckUtils]: 144: Hoare triple {31256#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {31256#false} is VALID [2018-11-23 11:56:59,164 INFO L273 TraceCheckUtils]: 145: Hoare triple {31256#false} ~cond := #in~cond; {31256#false} is VALID [2018-11-23 11:56:59,164 INFO L273 TraceCheckUtils]: 146: Hoare triple {31256#false} assume 0 == ~cond; {31256#false} is VALID [2018-11-23 11:56:59,164 INFO L273 TraceCheckUtils]: 147: Hoare triple {31256#false} assume !false; {31256#false} is VALID [2018-11-23 11:56:59,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 0 proven. 3015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:59,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:59,179 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:59,188 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:56:59,297 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-11-23 11:56:59,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:59,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:59,678 INFO L256 TraceCheckUtils]: 0: Hoare triple {31255#true} call ULTIMATE.init(); {31255#true} is VALID [2018-11-23 11:56:59,678 INFO L273 TraceCheckUtils]: 1: Hoare triple {31255#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31255#true} is VALID [2018-11-23 11:56:59,679 INFO L273 TraceCheckUtils]: 2: Hoare triple {31255#true} assume true; {31255#true} is VALID [2018-11-23 11:56:59,679 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31255#true} {31255#true} #55#return; {31255#true} is VALID [2018-11-23 11:56:59,679 INFO L256 TraceCheckUtils]: 4: Hoare triple {31255#true} call #t~ret4 := main(); {31255#true} is VALID [2018-11-23 11:56:59,680 INFO L273 TraceCheckUtils]: 5: Hoare triple {31255#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {31321#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:59,680 INFO L273 TraceCheckUtils]: 6: Hoare triple {31321#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31321#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:59,681 INFO L273 TraceCheckUtils]: 7: Hoare triple {31321#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31321#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:59,681 INFO L273 TraceCheckUtils]: 8: Hoare triple {31321#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {31258#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:59,682 INFO L273 TraceCheckUtils]: 9: Hoare triple {31258#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31258#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:59,682 INFO L273 TraceCheckUtils]: 10: Hoare triple {31258#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31258#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:59,682 INFO L273 TraceCheckUtils]: 11: Hoare triple {31258#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {31259#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:59,683 INFO L273 TraceCheckUtils]: 12: Hoare triple {31259#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31259#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:59,683 INFO L273 TraceCheckUtils]: 13: Hoare triple {31259#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31259#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:59,684 INFO L273 TraceCheckUtils]: 14: Hoare triple {31259#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {31260#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:59,684 INFO L273 TraceCheckUtils]: 15: Hoare triple {31260#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31260#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:59,685 INFO L273 TraceCheckUtils]: 16: Hoare triple {31260#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31260#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:59,685 INFO L273 TraceCheckUtils]: 17: Hoare triple {31260#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {31261#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:59,686 INFO L273 TraceCheckUtils]: 18: Hoare triple {31261#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31261#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:59,686 INFO L273 TraceCheckUtils]: 19: Hoare triple {31261#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31261#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:59,687 INFO L273 TraceCheckUtils]: 20: Hoare triple {31261#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {31262#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:59,687 INFO L273 TraceCheckUtils]: 21: Hoare triple {31262#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31262#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:59,688 INFO L273 TraceCheckUtils]: 22: Hoare triple {31262#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31262#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:59,689 INFO L273 TraceCheckUtils]: 23: Hoare triple {31262#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {31263#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:59,689 INFO L273 TraceCheckUtils]: 24: Hoare triple {31263#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31263#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:59,690 INFO L273 TraceCheckUtils]: 25: Hoare triple {31263#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31263#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:59,690 INFO L273 TraceCheckUtils]: 26: Hoare triple {31263#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {31264#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:59,691 INFO L273 TraceCheckUtils]: 27: Hoare triple {31264#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31264#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:59,691 INFO L273 TraceCheckUtils]: 28: Hoare triple {31264#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31264#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:59,692 INFO L273 TraceCheckUtils]: 29: Hoare triple {31264#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {31265#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:59,692 INFO L273 TraceCheckUtils]: 30: Hoare triple {31265#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31265#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:59,693 INFO L273 TraceCheckUtils]: 31: Hoare triple {31265#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31265#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:59,694 INFO L273 TraceCheckUtils]: 32: Hoare triple {31265#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {31266#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:59,694 INFO L273 TraceCheckUtils]: 33: Hoare triple {31266#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31266#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:59,695 INFO L273 TraceCheckUtils]: 34: Hoare triple {31266#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31266#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:59,695 INFO L273 TraceCheckUtils]: 35: Hoare triple {31266#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {31267#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:59,696 INFO L273 TraceCheckUtils]: 36: Hoare triple {31267#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31267#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:59,696 INFO L273 TraceCheckUtils]: 37: Hoare triple {31267#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31267#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:59,697 INFO L273 TraceCheckUtils]: 38: Hoare triple {31267#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {31268#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:59,698 INFO L273 TraceCheckUtils]: 39: Hoare triple {31268#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31268#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:59,698 INFO L273 TraceCheckUtils]: 40: Hoare triple {31268#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31268#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:59,699 INFO L273 TraceCheckUtils]: 41: Hoare triple {31268#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {31269#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:59,699 INFO L273 TraceCheckUtils]: 42: Hoare triple {31269#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31269#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:59,700 INFO L273 TraceCheckUtils]: 43: Hoare triple {31269#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31269#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:59,700 INFO L273 TraceCheckUtils]: 44: Hoare triple {31269#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {31270#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:59,701 INFO L273 TraceCheckUtils]: 45: Hoare triple {31270#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31270#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:59,701 INFO L273 TraceCheckUtils]: 46: Hoare triple {31270#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31270#(<= main_~i~0 13)} is VALID [2018-11-23 11:56:59,702 INFO L273 TraceCheckUtils]: 47: Hoare triple {31270#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {31271#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:59,703 INFO L273 TraceCheckUtils]: 48: Hoare triple {31271#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31271#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:59,703 INFO L273 TraceCheckUtils]: 49: Hoare triple {31271#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31271#(<= main_~i~0 14)} is VALID [2018-11-23 11:56:59,704 INFO L273 TraceCheckUtils]: 50: Hoare triple {31271#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {31272#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:59,704 INFO L273 TraceCheckUtils]: 51: Hoare triple {31272#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31272#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:59,705 INFO L273 TraceCheckUtils]: 52: Hoare triple {31272#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31272#(<= main_~i~0 15)} is VALID [2018-11-23 11:56:59,705 INFO L273 TraceCheckUtils]: 53: Hoare triple {31272#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {31273#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:59,706 INFO L273 TraceCheckUtils]: 54: Hoare triple {31273#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31273#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:59,706 INFO L273 TraceCheckUtils]: 55: Hoare triple {31273#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31273#(<= main_~i~0 16)} is VALID [2018-11-23 11:56:59,707 INFO L273 TraceCheckUtils]: 56: Hoare triple {31273#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {31274#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:59,708 INFO L273 TraceCheckUtils]: 57: Hoare triple {31274#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31274#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:59,708 INFO L273 TraceCheckUtils]: 58: Hoare triple {31274#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31274#(<= main_~i~0 17)} is VALID [2018-11-23 11:56:59,709 INFO L273 TraceCheckUtils]: 59: Hoare triple {31274#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {31275#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:59,709 INFO L273 TraceCheckUtils]: 60: Hoare triple {31275#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31275#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:59,710 INFO L273 TraceCheckUtils]: 61: Hoare triple {31275#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31275#(<= main_~i~0 18)} is VALID [2018-11-23 11:56:59,711 INFO L273 TraceCheckUtils]: 62: Hoare triple {31275#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {31276#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:59,711 INFO L273 TraceCheckUtils]: 63: Hoare triple {31276#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31276#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:59,712 INFO L273 TraceCheckUtils]: 64: Hoare triple {31276#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31276#(<= main_~i~0 19)} is VALID [2018-11-23 11:56:59,712 INFO L273 TraceCheckUtils]: 65: Hoare triple {31276#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {31277#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:59,713 INFO L273 TraceCheckUtils]: 66: Hoare triple {31277#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31277#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:59,713 INFO L273 TraceCheckUtils]: 67: Hoare triple {31277#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31277#(<= main_~i~0 20)} is VALID [2018-11-23 11:56:59,714 INFO L273 TraceCheckUtils]: 68: Hoare triple {31277#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {31278#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:59,715 INFO L273 TraceCheckUtils]: 69: Hoare triple {31278#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31278#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:59,715 INFO L273 TraceCheckUtils]: 70: Hoare triple {31278#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31278#(<= main_~i~0 21)} is VALID [2018-11-23 11:56:59,716 INFO L273 TraceCheckUtils]: 71: Hoare triple {31278#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {31279#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:59,716 INFO L273 TraceCheckUtils]: 72: Hoare triple {31279#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31279#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:59,717 INFO L273 TraceCheckUtils]: 73: Hoare triple {31279#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31279#(<= main_~i~0 22)} is VALID [2018-11-23 11:56:59,717 INFO L273 TraceCheckUtils]: 74: Hoare triple {31279#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {31280#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:59,718 INFO L273 TraceCheckUtils]: 75: Hoare triple {31280#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31280#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:59,718 INFO L273 TraceCheckUtils]: 76: Hoare triple {31280#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31280#(<= main_~i~0 23)} is VALID [2018-11-23 11:56:59,719 INFO L273 TraceCheckUtils]: 77: Hoare triple {31280#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {31281#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:59,720 INFO L273 TraceCheckUtils]: 78: Hoare triple {31281#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31281#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:59,720 INFO L273 TraceCheckUtils]: 79: Hoare triple {31281#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31281#(<= main_~i~0 24)} is VALID [2018-11-23 11:56:59,721 INFO L273 TraceCheckUtils]: 80: Hoare triple {31281#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {31282#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:59,721 INFO L273 TraceCheckUtils]: 81: Hoare triple {31282#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31282#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:59,722 INFO L273 TraceCheckUtils]: 82: Hoare triple {31282#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31282#(<= main_~i~0 25)} is VALID [2018-11-23 11:56:59,722 INFO L273 TraceCheckUtils]: 83: Hoare triple {31282#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {31283#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:59,723 INFO L273 TraceCheckUtils]: 84: Hoare triple {31283#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31283#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:59,723 INFO L273 TraceCheckUtils]: 85: Hoare triple {31283#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31283#(<= main_~i~0 26)} is VALID [2018-11-23 11:56:59,724 INFO L273 TraceCheckUtils]: 86: Hoare triple {31283#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {31284#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:59,725 INFO L273 TraceCheckUtils]: 87: Hoare triple {31284#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31284#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:59,725 INFO L273 TraceCheckUtils]: 88: Hoare triple {31284#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31284#(<= main_~i~0 27)} is VALID [2018-11-23 11:56:59,726 INFO L273 TraceCheckUtils]: 89: Hoare triple {31284#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {31285#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:59,726 INFO L273 TraceCheckUtils]: 90: Hoare triple {31285#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31285#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:59,727 INFO L273 TraceCheckUtils]: 91: Hoare triple {31285#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31285#(<= main_~i~0 28)} is VALID [2018-11-23 11:56:59,728 INFO L273 TraceCheckUtils]: 92: Hoare triple {31285#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {31286#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:59,728 INFO L273 TraceCheckUtils]: 93: Hoare triple {31286#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31286#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:59,729 INFO L273 TraceCheckUtils]: 94: Hoare triple {31286#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31286#(<= main_~i~0 29)} is VALID [2018-11-23 11:56:59,729 INFO L273 TraceCheckUtils]: 95: Hoare triple {31286#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {31287#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:59,730 INFO L273 TraceCheckUtils]: 96: Hoare triple {31287#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31287#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:59,730 INFO L273 TraceCheckUtils]: 97: Hoare triple {31287#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31287#(<= main_~i~0 30)} is VALID [2018-11-23 11:56:59,731 INFO L273 TraceCheckUtils]: 98: Hoare triple {31287#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {31288#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:59,731 INFO L273 TraceCheckUtils]: 99: Hoare triple {31288#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31288#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:59,732 INFO L273 TraceCheckUtils]: 100: Hoare triple {31288#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31288#(<= main_~i~0 31)} is VALID [2018-11-23 11:56:59,733 INFO L273 TraceCheckUtils]: 101: Hoare triple {31288#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {31289#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:59,733 INFO L273 TraceCheckUtils]: 102: Hoare triple {31289#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31289#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:59,734 INFO L273 TraceCheckUtils]: 103: Hoare triple {31289#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31289#(<= main_~i~0 32)} is VALID [2018-11-23 11:56:59,734 INFO L273 TraceCheckUtils]: 104: Hoare triple {31289#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {31290#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:59,735 INFO L273 TraceCheckUtils]: 105: Hoare triple {31290#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31290#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:59,735 INFO L273 TraceCheckUtils]: 106: Hoare triple {31290#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31290#(<= main_~i~0 33)} is VALID [2018-11-23 11:56:59,736 INFO L273 TraceCheckUtils]: 107: Hoare triple {31290#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {31291#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:59,737 INFO L273 TraceCheckUtils]: 108: Hoare triple {31291#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31291#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:59,737 INFO L273 TraceCheckUtils]: 109: Hoare triple {31291#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31291#(<= main_~i~0 34)} is VALID [2018-11-23 11:56:59,738 INFO L273 TraceCheckUtils]: 110: Hoare triple {31291#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {31292#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:59,738 INFO L273 TraceCheckUtils]: 111: Hoare triple {31292#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31292#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:59,739 INFO L273 TraceCheckUtils]: 112: Hoare triple {31292#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31292#(<= main_~i~0 35)} is VALID [2018-11-23 11:56:59,739 INFO L273 TraceCheckUtils]: 113: Hoare triple {31292#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {31293#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:59,740 INFO L273 TraceCheckUtils]: 114: Hoare triple {31293#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31293#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:59,740 INFO L273 TraceCheckUtils]: 115: Hoare triple {31293#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31293#(<= main_~i~0 36)} is VALID [2018-11-23 11:56:59,741 INFO L273 TraceCheckUtils]: 116: Hoare triple {31293#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {31294#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:59,742 INFO L273 TraceCheckUtils]: 117: Hoare triple {31294#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31294#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:59,742 INFO L273 TraceCheckUtils]: 118: Hoare triple {31294#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31294#(<= main_~i~0 37)} is VALID [2018-11-23 11:56:59,743 INFO L273 TraceCheckUtils]: 119: Hoare triple {31294#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {31295#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:59,743 INFO L273 TraceCheckUtils]: 120: Hoare triple {31295#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31295#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:59,744 INFO L273 TraceCheckUtils]: 121: Hoare triple {31295#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31295#(<= main_~i~0 38)} is VALID [2018-11-23 11:56:59,744 INFO L273 TraceCheckUtils]: 122: Hoare triple {31295#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {31296#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:59,745 INFO L273 TraceCheckUtils]: 123: Hoare triple {31296#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31296#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:59,745 INFO L273 TraceCheckUtils]: 124: Hoare triple {31296#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31296#(<= main_~i~0 39)} is VALID [2018-11-23 11:56:59,746 INFO L273 TraceCheckUtils]: 125: Hoare triple {31296#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {31297#(<= main_~i~0 40)} is VALID [2018-11-23 11:56:59,747 INFO L273 TraceCheckUtils]: 126: Hoare triple {31297#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31297#(<= main_~i~0 40)} is VALID [2018-11-23 11:56:59,747 INFO L273 TraceCheckUtils]: 127: Hoare triple {31297#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31297#(<= main_~i~0 40)} is VALID [2018-11-23 11:56:59,748 INFO L273 TraceCheckUtils]: 128: Hoare triple {31297#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {31298#(<= main_~i~0 41)} is VALID [2018-11-23 11:56:59,748 INFO L273 TraceCheckUtils]: 129: Hoare triple {31298#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31298#(<= main_~i~0 41)} is VALID [2018-11-23 11:56:59,749 INFO L273 TraceCheckUtils]: 130: Hoare triple {31298#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31298#(<= main_~i~0 41)} is VALID [2018-11-23 11:56:59,750 INFO L273 TraceCheckUtils]: 131: Hoare triple {31298#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {31299#(<= main_~i~0 42)} is VALID [2018-11-23 11:56:59,750 INFO L273 TraceCheckUtils]: 132: Hoare triple {31299#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31299#(<= main_~i~0 42)} is VALID [2018-11-23 11:56:59,751 INFO L273 TraceCheckUtils]: 133: Hoare triple {31299#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31299#(<= main_~i~0 42)} is VALID [2018-11-23 11:56:59,751 INFO L273 TraceCheckUtils]: 134: Hoare triple {31299#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {31300#(<= main_~i~0 43)} is VALID [2018-11-23 11:56:59,752 INFO L273 TraceCheckUtils]: 135: Hoare triple {31300#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31300#(<= main_~i~0 43)} is VALID [2018-11-23 11:56:59,752 INFO L273 TraceCheckUtils]: 136: Hoare triple {31300#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31300#(<= main_~i~0 43)} is VALID [2018-11-23 11:56:59,753 INFO L273 TraceCheckUtils]: 137: Hoare triple {31300#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {31301#(<= main_~i~0 44)} is VALID [2018-11-23 11:56:59,753 INFO L273 TraceCheckUtils]: 138: Hoare triple {31301#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31301#(<= main_~i~0 44)} is VALID [2018-11-23 11:56:59,754 INFO L273 TraceCheckUtils]: 139: Hoare triple {31301#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {31301#(<= main_~i~0 44)} is VALID [2018-11-23 11:56:59,755 INFO L273 TraceCheckUtils]: 140: Hoare triple {31301#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {31302#(<= main_~i~0 45)} is VALID [2018-11-23 11:56:59,755 INFO L273 TraceCheckUtils]: 141: Hoare triple {31302#(<= main_~i~0 45)} assume !(~i~0 < 100000); {31256#false} is VALID [2018-11-23 11:56:59,756 INFO L273 TraceCheckUtils]: 142: Hoare triple {31256#false} havoc ~x~0;~x~0 := 0; {31256#false} is VALID [2018-11-23 11:56:59,756 INFO L273 TraceCheckUtils]: 143: Hoare triple {31256#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {31256#false} is VALID [2018-11-23 11:56:59,756 INFO L256 TraceCheckUtils]: 144: Hoare triple {31256#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {31256#false} is VALID [2018-11-23 11:56:59,756 INFO L273 TraceCheckUtils]: 145: Hoare triple {31256#false} ~cond := #in~cond; {31256#false} is VALID [2018-11-23 11:56:59,756 INFO L273 TraceCheckUtils]: 146: Hoare triple {31256#false} assume 0 == ~cond; {31256#false} is VALID [2018-11-23 11:56:59,756 INFO L273 TraceCheckUtils]: 147: Hoare triple {31256#false} assume !false; {31256#false} is VALID [2018-11-23 11:56:59,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 0 proven. 3015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:56:59,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:59,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2018-11-23 11:56:59,801 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 148 [2018-11-23 11:56:59,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:59,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states. [2018-11-23 11:57:00,055 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:00,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-23 11:57:00,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-23 11:57:00,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 11:57:00,056 INFO L87 Difference]: Start difference. First operand 153 states and 199 transitions. Second operand 49 states. [2018-11-23 11:57:00,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:00,731 INFO L93 Difference]: Finished difference Result 169 states and 218 transitions. [2018-11-23 11:57:00,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 11:57:00,731 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 148 [2018-11-23 11:57:00,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:00,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 11:57:00,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 218 transitions. [2018-11-23 11:57:00,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 11:57:00,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 218 transitions. [2018-11-23 11:57:00,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 218 transitions. [2018-11-23 11:57:00,938 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:00,941 INFO L225 Difference]: With dead ends: 169 [2018-11-23 11:57:00,941 INFO L226 Difference]: Without dead ends: 158 [2018-11-23 11:57:00,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 11:57:00,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-23 11:57:00,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2018-11-23 11:57:00,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:00,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand 156 states. [2018-11-23 11:57:00,984 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 156 states. [2018-11-23 11:57:00,984 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 156 states. [2018-11-23 11:57:00,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:00,987 INFO L93 Difference]: Finished difference Result 158 states and 206 transitions. [2018-11-23 11:57:00,987 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 206 transitions. [2018-11-23 11:57:00,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:00,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:00,987 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 158 states. [2018-11-23 11:57:00,987 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 158 states. [2018-11-23 11:57:00,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:00,990 INFO L93 Difference]: Finished difference Result 158 states and 206 transitions. [2018-11-23 11:57:00,990 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 206 transitions. [2018-11-23 11:57:00,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:00,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:00,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:00,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:00,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-23 11:57:00,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 203 transitions. [2018-11-23 11:57:00,993 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 203 transitions. Word has length 148 [2018-11-23 11:57:00,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:00,994 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 203 transitions. [2018-11-23 11:57:00,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-23 11:57:00,994 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 203 transitions. [2018-11-23 11:57:00,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-23 11:57:00,995 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:00,995 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:00,995 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:00,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:00,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1494294791, now seen corresponding path program 46 times [2018-11-23 11:57:00,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:00,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:00,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:00,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:00,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:02,095 INFO L256 TraceCheckUtils]: 0: Hoare triple {32499#true} call ULTIMATE.init(); {32499#true} is VALID [2018-11-23 11:57:02,096 INFO L273 TraceCheckUtils]: 1: Hoare triple {32499#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32499#true} is VALID [2018-11-23 11:57:02,096 INFO L273 TraceCheckUtils]: 2: Hoare triple {32499#true} assume true; {32499#true} is VALID [2018-11-23 11:57:02,096 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32499#true} {32499#true} #55#return; {32499#true} is VALID [2018-11-23 11:57:02,096 INFO L256 TraceCheckUtils]: 4: Hoare triple {32499#true} call #t~ret4 := main(); {32499#true} is VALID [2018-11-23 11:57:02,097 INFO L273 TraceCheckUtils]: 5: Hoare triple {32499#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {32501#(= main_~i~0 0)} is VALID [2018-11-23 11:57:02,097 INFO L273 TraceCheckUtils]: 6: Hoare triple {32501#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32501#(= main_~i~0 0)} is VALID [2018-11-23 11:57:02,098 INFO L273 TraceCheckUtils]: 7: Hoare triple {32501#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32501#(= main_~i~0 0)} is VALID [2018-11-23 11:57:02,098 INFO L273 TraceCheckUtils]: 8: Hoare triple {32501#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {32502#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:02,098 INFO L273 TraceCheckUtils]: 9: Hoare triple {32502#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32502#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:02,099 INFO L273 TraceCheckUtils]: 10: Hoare triple {32502#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32502#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:02,099 INFO L273 TraceCheckUtils]: 11: Hoare triple {32502#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {32503#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:02,100 INFO L273 TraceCheckUtils]: 12: Hoare triple {32503#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32503#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:02,100 INFO L273 TraceCheckUtils]: 13: Hoare triple {32503#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32503#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:02,101 INFO L273 TraceCheckUtils]: 14: Hoare triple {32503#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {32504#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:02,101 INFO L273 TraceCheckUtils]: 15: Hoare triple {32504#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32504#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:02,102 INFO L273 TraceCheckUtils]: 16: Hoare triple {32504#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32504#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:02,102 INFO L273 TraceCheckUtils]: 17: Hoare triple {32504#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {32505#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:02,103 INFO L273 TraceCheckUtils]: 18: Hoare triple {32505#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32505#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:02,103 INFO L273 TraceCheckUtils]: 19: Hoare triple {32505#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32505#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:02,104 INFO L273 TraceCheckUtils]: 20: Hoare triple {32505#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {32506#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:02,105 INFO L273 TraceCheckUtils]: 21: Hoare triple {32506#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32506#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:02,105 INFO L273 TraceCheckUtils]: 22: Hoare triple {32506#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32506#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:02,106 INFO L273 TraceCheckUtils]: 23: Hoare triple {32506#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {32507#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:02,106 INFO L273 TraceCheckUtils]: 24: Hoare triple {32507#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32507#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:02,107 INFO L273 TraceCheckUtils]: 25: Hoare triple {32507#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32507#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:02,108 INFO L273 TraceCheckUtils]: 26: Hoare triple {32507#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {32508#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:02,108 INFO L273 TraceCheckUtils]: 27: Hoare triple {32508#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32508#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:02,109 INFO L273 TraceCheckUtils]: 28: Hoare triple {32508#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32508#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:02,109 INFO L273 TraceCheckUtils]: 29: Hoare triple {32508#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {32509#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:02,110 INFO L273 TraceCheckUtils]: 30: Hoare triple {32509#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32509#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:02,110 INFO L273 TraceCheckUtils]: 31: Hoare triple {32509#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32509#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:02,111 INFO L273 TraceCheckUtils]: 32: Hoare triple {32509#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {32510#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:02,112 INFO L273 TraceCheckUtils]: 33: Hoare triple {32510#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32510#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:02,112 INFO L273 TraceCheckUtils]: 34: Hoare triple {32510#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32510#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:02,113 INFO L273 TraceCheckUtils]: 35: Hoare triple {32510#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {32511#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:02,113 INFO L273 TraceCheckUtils]: 36: Hoare triple {32511#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32511#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:02,114 INFO L273 TraceCheckUtils]: 37: Hoare triple {32511#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32511#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:02,114 INFO L273 TraceCheckUtils]: 38: Hoare triple {32511#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {32512#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:02,115 INFO L273 TraceCheckUtils]: 39: Hoare triple {32512#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32512#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:02,115 INFO L273 TraceCheckUtils]: 40: Hoare triple {32512#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32512#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:02,116 INFO L273 TraceCheckUtils]: 41: Hoare triple {32512#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {32513#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:02,117 INFO L273 TraceCheckUtils]: 42: Hoare triple {32513#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32513#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:02,117 INFO L273 TraceCheckUtils]: 43: Hoare triple {32513#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32513#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:02,118 INFO L273 TraceCheckUtils]: 44: Hoare triple {32513#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {32514#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:02,118 INFO L273 TraceCheckUtils]: 45: Hoare triple {32514#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32514#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:02,119 INFO L273 TraceCheckUtils]: 46: Hoare triple {32514#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32514#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:02,120 INFO L273 TraceCheckUtils]: 47: Hoare triple {32514#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {32515#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:02,120 INFO L273 TraceCheckUtils]: 48: Hoare triple {32515#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32515#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:02,121 INFO L273 TraceCheckUtils]: 49: Hoare triple {32515#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32515#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:02,121 INFO L273 TraceCheckUtils]: 50: Hoare triple {32515#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {32516#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:02,122 INFO L273 TraceCheckUtils]: 51: Hoare triple {32516#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32516#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:02,122 INFO L273 TraceCheckUtils]: 52: Hoare triple {32516#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32516#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:02,123 INFO L273 TraceCheckUtils]: 53: Hoare triple {32516#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {32517#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:02,123 INFO L273 TraceCheckUtils]: 54: Hoare triple {32517#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32517#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:02,124 INFO L273 TraceCheckUtils]: 55: Hoare triple {32517#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32517#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:02,125 INFO L273 TraceCheckUtils]: 56: Hoare triple {32517#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {32518#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:02,125 INFO L273 TraceCheckUtils]: 57: Hoare triple {32518#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32518#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:02,126 INFO L273 TraceCheckUtils]: 58: Hoare triple {32518#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32518#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:02,126 INFO L273 TraceCheckUtils]: 59: Hoare triple {32518#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {32519#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:02,127 INFO L273 TraceCheckUtils]: 60: Hoare triple {32519#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32519#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:02,127 INFO L273 TraceCheckUtils]: 61: Hoare triple {32519#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32519#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:02,128 INFO L273 TraceCheckUtils]: 62: Hoare triple {32519#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {32520#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:02,129 INFO L273 TraceCheckUtils]: 63: Hoare triple {32520#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32520#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:02,129 INFO L273 TraceCheckUtils]: 64: Hoare triple {32520#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32520#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:02,130 INFO L273 TraceCheckUtils]: 65: Hoare triple {32520#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {32521#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:02,130 INFO L273 TraceCheckUtils]: 66: Hoare triple {32521#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32521#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:02,131 INFO L273 TraceCheckUtils]: 67: Hoare triple {32521#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32521#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:02,131 INFO L273 TraceCheckUtils]: 68: Hoare triple {32521#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {32522#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:02,132 INFO L273 TraceCheckUtils]: 69: Hoare triple {32522#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32522#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:02,132 INFO L273 TraceCheckUtils]: 70: Hoare triple {32522#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32522#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:02,133 INFO L273 TraceCheckUtils]: 71: Hoare triple {32522#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {32523#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:02,134 INFO L273 TraceCheckUtils]: 72: Hoare triple {32523#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32523#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:02,134 INFO L273 TraceCheckUtils]: 73: Hoare triple {32523#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32523#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:02,135 INFO L273 TraceCheckUtils]: 74: Hoare triple {32523#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {32524#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:02,135 INFO L273 TraceCheckUtils]: 75: Hoare triple {32524#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32524#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:02,136 INFO L273 TraceCheckUtils]: 76: Hoare triple {32524#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32524#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:02,137 INFO L273 TraceCheckUtils]: 77: Hoare triple {32524#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {32525#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:02,137 INFO L273 TraceCheckUtils]: 78: Hoare triple {32525#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32525#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:02,138 INFO L273 TraceCheckUtils]: 79: Hoare triple {32525#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32525#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:02,138 INFO L273 TraceCheckUtils]: 80: Hoare triple {32525#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {32526#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:02,139 INFO L273 TraceCheckUtils]: 81: Hoare triple {32526#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32526#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:02,139 INFO L273 TraceCheckUtils]: 82: Hoare triple {32526#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32526#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:02,140 INFO L273 TraceCheckUtils]: 83: Hoare triple {32526#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {32527#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:02,141 INFO L273 TraceCheckUtils]: 84: Hoare triple {32527#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32527#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:02,141 INFO L273 TraceCheckUtils]: 85: Hoare triple {32527#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32527#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:02,142 INFO L273 TraceCheckUtils]: 86: Hoare triple {32527#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {32528#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:02,142 INFO L273 TraceCheckUtils]: 87: Hoare triple {32528#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32528#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:02,143 INFO L273 TraceCheckUtils]: 88: Hoare triple {32528#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32528#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:02,143 INFO L273 TraceCheckUtils]: 89: Hoare triple {32528#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {32529#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:02,144 INFO L273 TraceCheckUtils]: 90: Hoare triple {32529#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32529#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:02,144 INFO L273 TraceCheckUtils]: 91: Hoare triple {32529#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32529#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:02,145 INFO L273 TraceCheckUtils]: 92: Hoare triple {32529#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {32530#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:02,146 INFO L273 TraceCheckUtils]: 93: Hoare triple {32530#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32530#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:02,146 INFO L273 TraceCheckUtils]: 94: Hoare triple {32530#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32530#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:02,147 INFO L273 TraceCheckUtils]: 95: Hoare triple {32530#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {32531#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:02,147 INFO L273 TraceCheckUtils]: 96: Hoare triple {32531#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32531#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:02,148 INFO L273 TraceCheckUtils]: 97: Hoare triple {32531#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32531#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:02,149 INFO L273 TraceCheckUtils]: 98: Hoare triple {32531#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {32532#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:02,149 INFO L273 TraceCheckUtils]: 99: Hoare triple {32532#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32532#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:02,150 INFO L273 TraceCheckUtils]: 100: Hoare triple {32532#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32532#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:02,150 INFO L273 TraceCheckUtils]: 101: Hoare triple {32532#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {32533#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:02,151 INFO L273 TraceCheckUtils]: 102: Hoare triple {32533#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32533#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:02,151 INFO L273 TraceCheckUtils]: 103: Hoare triple {32533#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32533#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:02,152 INFO L273 TraceCheckUtils]: 104: Hoare triple {32533#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {32534#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:02,152 INFO L273 TraceCheckUtils]: 105: Hoare triple {32534#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32534#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:02,153 INFO L273 TraceCheckUtils]: 106: Hoare triple {32534#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32534#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:02,154 INFO L273 TraceCheckUtils]: 107: Hoare triple {32534#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {32535#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:02,154 INFO L273 TraceCheckUtils]: 108: Hoare triple {32535#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32535#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:02,155 INFO L273 TraceCheckUtils]: 109: Hoare triple {32535#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32535#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:02,155 INFO L273 TraceCheckUtils]: 110: Hoare triple {32535#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {32536#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:02,156 INFO L273 TraceCheckUtils]: 111: Hoare triple {32536#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32536#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:02,156 INFO L273 TraceCheckUtils]: 112: Hoare triple {32536#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32536#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:02,157 INFO L273 TraceCheckUtils]: 113: Hoare triple {32536#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {32537#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:02,158 INFO L273 TraceCheckUtils]: 114: Hoare triple {32537#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32537#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:02,158 INFO L273 TraceCheckUtils]: 115: Hoare triple {32537#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32537#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:02,159 INFO L273 TraceCheckUtils]: 116: Hoare triple {32537#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {32538#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:02,159 INFO L273 TraceCheckUtils]: 117: Hoare triple {32538#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32538#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:02,160 INFO L273 TraceCheckUtils]: 118: Hoare triple {32538#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32538#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:02,160 INFO L273 TraceCheckUtils]: 119: Hoare triple {32538#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {32539#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:02,161 INFO L273 TraceCheckUtils]: 120: Hoare triple {32539#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32539#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:02,161 INFO L273 TraceCheckUtils]: 121: Hoare triple {32539#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32539#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:02,162 INFO L273 TraceCheckUtils]: 122: Hoare triple {32539#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {32540#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:02,163 INFO L273 TraceCheckUtils]: 123: Hoare triple {32540#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32540#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:02,163 INFO L273 TraceCheckUtils]: 124: Hoare triple {32540#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32540#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:02,164 INFO L273 TraceCheckUtils]: 125: Hoare triple {32540#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {32541#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:02,164 INFO L273 TraceCheckUtils]: 126: Hoare triple {32541#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32541#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:02,165 INFO L273 TraceCheckUtils]: 127: Hoare triple {32541#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32541#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:02,166 INFO L273 TraceCheckUtils]: 128: Hoare triple {32541#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {32542#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:02,166 INFO L273 TraceCheckUtils]: 129: Hoare triple {32542#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32542#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:02,167 INFO L273 TraceCheckUtils]: 130: Hoare triple {32542#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32542#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:02,167 INFO L273 TraceCheckUtils]: 131: Hoare triple {32542#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {32543#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:02,168 INFO L273 TraceCheckUtils]: 132: Hoare triple {32543#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32543#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:02,168 INFO L273 TraceCheckUtils]: 133: Hoare triple {32543#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32543#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:02,169 INFO L273 TraceCheckUtils]: 134: Hoare triple {32543#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {32544#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:02,169 INFO L273 TraceCheckUtils]: 135: Hoare triple {32544#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32544#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:02,170 INFO L273 TraceCheckUtils]: 136: Hoare triple {32544#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32544#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:02,171 INFO L273 TraceCheckUtils]: 137: Hoare triple {32544#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {32545#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:02,171 INFO L273 TraceCheckUtils]: 138: Hoare triple {32545#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32545#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:02,172 INFO L273 TraceCheckUtils]: 139: Hoare triple {32545#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32545#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:02,172 INFO L273 TraceCheckUtils]: 140: Hoare triple {32545#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {32546#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:02,173 INFO L273 TraceCheckUtils]: 141: Hoare triple {32546#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32546#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:02,173 INFO L273 TraceCheckUtils]: 142: Hoare triple {32546#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32546#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:02,174 INFO L273 TraceCheckUtils]: 143: Hoare triple {32546#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {32547#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:02,175 INFO L273 TraceCheckUtils]: 144: Hoare triple {32547#(<= main_~i~0 46)} assume !(~i~0 < 100000); {32500#false} is VALID [2018-11-23 11:57:02,175 INFO L273 TraceCheckUtils]: 145: Hoare triple {32500#false} havoc ~x~0;~x~0 := 0; {32500#false} is VALID [2018-11-23 11:57:02,175 INFO L273 TraceCheckUtils]: 146: Hoare triple {32500#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {32500#false} is VALID [2018-11-23 11:57:02,175 INFO L256 TraceCheckUtils]: 147: Hoare triple {32500#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {32500#false} is VALID [2018-11-23 11:57:02,176 INFO L273 TraceCheckUtils]: 148: Hoare triple {32500#false} ~cond := #in~cond; {32500#false} is VALID [2018-11-23 11:57:02,176 INFO L273 TraceCheckUtils]: 149: Hoare triple {32500#false} assume 0 == ~cond; {32500#false} is VALID [2018-11-23 11:57:02,176 INFO L273 TraceCheckUtils]: 150: Hoare triple {32500#false} assume !false; {32500#false} is VALID [2018-11-23 11:57:02,192 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 11:57:02,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:02,192 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:02,202 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:57:02,269 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:57:02,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:57:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:02,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:02,701 INFO L256 TraceCheckUtils]: 0: Hoare triple {32499#true} call ULTIMATE.init(); {32499#true} is VALID [2018-11-23 11:57:02,701 INFO L273 TraceCheckUtils]: 1: Hoare triple {32499#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32499#true} is VALID [2018-11-23 11:57:02,701 INFO L273 TraceCheckUtils]: 2: Hoare triple {32499#true} assume true; {32499#true} is VALID [2018-11-23 11:57:02,701 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32499#true} {32499#true} #55#return; {32499#true} is VALID [2018-11-23 11:57:02,701 INFO L256 TraceCheckUtils]: 4: Hoare triple {32499#true} call #t~ret4 := main(); {32499#true} is VALID [2018-11-23 11:57:02,702 INFO L273 TraceCheckUtils]: 5: Hoare triple {32499#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {32566#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:02,703 INFO L273 TraceCheckUtils]: 6: Hoare triple {32566#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32566#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:02,703 INFO L273 TraceCheckUtils]: 7: Hoare triple {32566#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32566#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:02,704 INFO L273 TraceCheckUtils]: 8: Hoare triple {32566#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {32502#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:02,704 INFO L273 TraceCheckUtils]: 9: Hoare triple {32502#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32502#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:02,705 INFO L273 TraceCheckUtils]: 10: Hoare triple {32502#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32502#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:02,706 INFO L273 TraceCheckUtils]: 11: Hoare triple {32502#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {32503#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:02,706 INFO L273 TraceCheckUtils]: 12: Hoare triple {32503#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32503#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:02,707 INFO L273 TraceCheckUtils]: 13: Hoare triple {32503#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32503#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:02,707 INFO L273 TraceCheckUtils]: 14: Hoare triple {32503#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {32504#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:02,708 INFO L273 TraceCheckUtils]: 15: Hoare triple {32504#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32504#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:02,708 INFO L273 TraceCheckUtils]: 16: Hoare triple {32504#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32504#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:02,709 INFO L273 TraceCheckUtils]: 17: Hoare triple {32504#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {32505#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:02,710 INFO L273 TraceCheckUtils]: 18: Hoare triple {32505#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32505#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:02,710 INFO L273 TraceCheckUtils]: 19: Hoare triple {32505#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32505#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:02,711 INFO L273 TraceCheckUtils]: 20: Hoare triple {32505#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {32506#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:02,711 INFO L273 TraceCheckUtils]: 21: Hoare triple {32506#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32506#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:02,712 INFO L273 TraceCheckUtils]: 22: Hoare triple {32506#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32506#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:02,712 INFO L273 TraceCheckUtils]: 23: Hoare triple {32506#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {32507#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:02,713 INFO L273 TraceCheckUtils]: 24: Hoare triple {32507#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32507#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:02,713 INFO L273 TraceCheckUtils]: 25: Hoare triple {32507#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32507#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:02,714 INFO L273 TraceCheckUtils]: 26: Hoare triple {32507#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {32508#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:02,715 INFO L273 TraceCheckUtils]: 27: Hoare triple {32508#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32508#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:02,715 INFO L273 TraceCheckUtils]: 28: Hoare triple {32508#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32508#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:02,716 INFO L273 TraceCheckUtils]: 29: Hoare triple {32508#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {32509#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:02,716 INFO L273 TraceCheckUtils]: 30: Hoare triple {32509#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32509#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:02,717 INFO L273 TraceCheckUtils]: 31: Hoare triple {32509#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32509#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:02,718 INFO L273 TraceCheckUtils]: 32: Hoare triple {32509#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {32510#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:02,718 INFO L273 TraceCheckUtils]: 33: Hoare triple {32510#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32510#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:02,719 INFO L273 TraceCheckUtils]: 34: Hoare triple {32510#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32510#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:02,719 INFO L273 TraceCheckUtils]: 35: Hoare triple {32510#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {32511#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:02,720 INFO L273 TraceCheckUtils]: 36: Hoare triple {32511#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32511#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:02,720 INFO L273 TraceCheckUtils]: 37: Hoare triple {32511#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32511#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:02,721 INFO L273 TraceCheckUtils]: 38: Hoare triple {32511#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {32512#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:02,721 INFO L273 TraceCheckUtils]: 39: Hoare triple {32512#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32512#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:02,722 INFO L273 TraceCheckUtils]: 40: Hoare triple {32512#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32512#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:02,723 INFO L273 TraceCheckUtils]: 41: Hoare triple {32512#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {32513#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:02,723 INFO L273 TraceCheckUtils]: 42: Hoare triple {32513#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32513#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:02,724 INFO L273 TraceCheckUtils]: 43: Hoare triple {32513#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32513#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:02,724 INFO L273 TraceCheckUtils]: 44: Hoare triple {32513#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {32514#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:02,725 INFO L273 TraceCheckUtils]: 45: Hoare triple {32514#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32514#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:02,725 INFO L273 TraceCheckUtils]: 46: Hoare triple {32514#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32514#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:02,726 INFO L273 TraceCheckUtils]: 47: Hoare triple {32514#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {32515#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:02,727 INFO L273 TraceCheckUtils]: 48: Hoare triple {32515#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32515#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:02,727 INFO L273 TraceCheckUtils]: 49: Hoare triple {32515#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32515#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:02,728 INFO L273 TraceCheckUtils]: 50: Hoare triple {32515#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {32516#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:02,728 INFO L273 TraceCheckUtils]: 51: Hoare triple {32516#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32516#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:02,729 INFO L273 TraceCheckUtils]: 52: Hoare triple {32516#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32516#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:02,729 INFO L273 TraceCheckUtils]: 53: Hoare triple {32516#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {32517#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:02,730 INFO L273 TraceCheckUtils]: 54: Hoare triple {32517#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32517#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:02,730 INFO L273 TraceCheckUtils]: 55: Hoare triple {32517#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32517#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:02,731 INFO L273 TraceCheckUtils]: 56: Hoare triple {32517#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {32518#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:02,732 INFO L273 TraceCheckUtils]: 57: Hoare triple {32518#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32518#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:02,732 INFO L273 TraceCheckUtils]: 58: Hoare triple {32518#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32518#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:02,733 INFO L273 TraceCheckUtils]: 59: Hoare triple {32518#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {32519#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:02,733 INFO L273 TraceCheckUtils]: 60: Hoare triple {32519#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32519#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:02,734 INFO L273 TraceCheckUtils]: 61: Hoare triple {32519#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32519#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:02,735 INFO L273 TraceCheckUtils]: 62: Hoare triple {32519#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {32520#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:02,735 INFO L273 TraceCheckUtils]: 63: Hoare triple {32520#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32520#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:02,736 INFO L273 TraceCheckUtils]: 64: Hoare triple {32520#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32520#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:02,736 INFO L273 TraceCheckUtils]: 65: Hoare triple {32520#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {32521#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:02,737 INFO L273 TraceCheckUtils]: 66: Hoare triple {32521#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32521#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:02,737 INFO L273 TraceCheckUtils]: 67: Hoare triple {32521#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32521#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:02,738 INFO L273 TraceCheckUtils]: 68: Hoare triple {32521#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {32522#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:02,738 INFO L273 TraceCheckUtils]: 69: Hoare triple {32522#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32522#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:02,739 INFO L273 TraceCheckUtils]: 70: Hoare triple {32522#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32522#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:02,740 INFO L273 TraceCheckUtils]: 71: Hoare triple {32522#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {32523#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:02,740 INFO L273 TraceCheckUtils]: 72: Hoare triple {32523#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32523#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:02,741 INFO L273 TraceCheckUtils]: 73: Hoare triple {32523#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32523#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:02,741 INFO L273 TraceCheckUtils]: 74: Hoare triple {32523#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {32524#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:02,742 INFO L273 TraceCheckUtils]: 75: Hoare triple {32524#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32524#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:02,742 INFO L273 TraceCheckUtils]: 76: Hoare triple {32524#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32524#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:02,743 INFO L273 TraceCheckUtils]: 77: Hoare triple {32524#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {32525#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:02,744 INFO L273 TraceCheckUtils]: 78: Hoare triple {32525#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32525#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:02,744 INFO L273 TraceCheckUtils]: 79: Hoare triple {32525#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32525#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:02,745 INFO L273 TraceCheckUtils]: 80: Hoare triple {32525#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {32526#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:02,745 INFO L273 TraceCheckUtils]: 81: Hoare triple {32526#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32526#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:02,746 INFO L273 TraceCheckUtils]: 82: Hoare triple {32526#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32526#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:02,746 INFO L273 TraceCheckUtils]: 83: Hoare triple {32526#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {32527#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:02,747 INFO L273 TraceCheckUtils]: 84: Hoare triple {32527#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32527#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:02,747 INFO L273 TraceCheckUtils]: 85: Hoare triple {32527#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32527#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:02,748 INFO L273 TraceCheckUtils]: 86: Hoare triple {32527#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {32528#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:02,749 INFO L273 TraceCheckUtils]: 87: Hoare triple {32528#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32528#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:02,749 INFO L273 TraceCheckUtils]: 88: Hoare triple {32528#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32528#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:02,750 INFO L273 TraceCheckUtils]: 89: Hoare triple {32528#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {32529#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:02,750 INFO L273 TraceCheckUtils]: 90: Hoare triple {32529#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32529#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:02,751 INFO L273 TraceCheckUtils]: 91: Hoare triple {32529#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32529#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:02,752 INFO L273 TraceCheckUtils]: 92: Hoare triple {32529#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {32530#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:02,752 INFO L273 TraceCheckUtils]: 93: Hoare triple {32530#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32530#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:02,753 INFO L273 TraceCheckUtils]: 94: Hoare triple {32530#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32530#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:02,753 INFO L273 TraceCheckUtils]: 95: Hoare triple {32530#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {32531#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:02,754 INFO L273 TraceCheckUtils]: 96: Hoare triple {32531#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32531#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:02,754 INFO L273 TraceCheckUtils]: 97: Hoare triple {32531#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32531#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:02,755 INFO L273 TraceCheckUtils]: 98: Hoare triple {32531#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {32532#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:02,755 INFO L273 TraceCheckUtils]: 99: Hoare triple {32532#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32532#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:02,756 INFO L273 TraceCheckUtils]: 100: Hoare triple {32532#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32532#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:02,757 INFO L273 TraceCheckUtils]: 101: Hoare triple {32532#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {32533#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:02,757 INFO L273 TraceCheckUtils]: 102: Hoare triple {32533#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32533#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:02,758 INFO L273 TraceCheckUtils]: 103: Hoare triple {32533#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32533#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:02,758 INFO L273 TraceCheckUtils]: 104: Hoare triple {32533#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {32534#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:02,759 INFO L273 TraceCheckUtils]: 105: Hoare triple {32534#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32534#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:02,759 INFO L273 TraceCheckUtils]: 106: Hoare triple {32534#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32534#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:02,760 INFO L273 TraceCheckUtils]: 107: Hoare triple {32534#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {32535#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:02,761 INFO L273 TraceCheckUtils]: 108: Hoare triple {32535#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32535#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:02,761 INFO L273 TraceCheckUtils]: 109: Hoare triple {32535#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32535#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:02,762 INFO L273 TraceCheckUtils]: 110: Hoare triple {32535#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {32536#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:02,762 INFO L273 TraceCheckUtils]: 111: Hoare triple {32536#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32536#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:02,763 INFO L273 TraceCheckUtils]: 112: Hoare triple {32536#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32536#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:02,763 INFO L273 TraceCheckUtils]: 113: Hoare triple {32536#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {32537#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:02,764 INFO L273 TraceCheckUtils]: 114: Hoare triple {32537#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32537#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:02,764 INFO L273 TraceCheckUtils]: 115: Hoare triple {32537#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32537#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:02,765 INFO L273 TraceCheckUtils]: 116: Hoare triple {32537#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {32538#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:02,766 INFO L273 TraceCheckUtils]: 117: Hoare triple {32538#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32538#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:02,766 INFO L273 TraceCheckUtils]: 118: Hoare triple {32538#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32538#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:02,767 INFO L273 TraceCheckUtils]: 119: Hoare triple {32538#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {32539#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:02,767 INFO L273 TraceCheckUtils]: 120: Hoare triple {32539#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32539#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:02,768 INFO L273 TraceCheckUtils]: 121: Hoare triple {32539#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32539#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:02,769 INFO L273 TraceCheckUtils]: 122: Hoare triple {32539#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {32540#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:02,769 INFO L273 TraceCheckUtils]: 123: Hoare triple {32540#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32540#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:02,770 INFO L273 TraceCheckUtils]: 124: Hoare triple {32540#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32540#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:02,770 INFO L273 TraceCheckUtils]: 125: Hoare triple {32540#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {32541#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:02,771 INFO L273 TraceCheckUtils]: 126: Hoare triple {32541#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32541#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:02,771 INFO L273 TraceCheckUtils]: 127: Hoare triple {32541#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32541#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:02,772 INFO L273 TraceCheckUtils]: 128: Hoare triple {32541#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {32542#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:02,772 INFO L273 TraceCheckUtils]: 129: Hoare triple {32542#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32542#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:02,773 INFO L273 TraceCheckUtils]: 130: Hoare triple {32542#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32542#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:02,774 INFO L273 TraceCheckUtils]: 131: Hoare triple {32542#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {32543#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:02,774 INFO L273 TraceCheckUtils]: 132: Hoare triple {32543#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32543#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:02,775 INFO L273 TraceCheckUtils]: 133: Hoare triple {32543#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32543#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:02,775 INFO L273 TraceCheckUtils]: 134: Hoare triple {32543#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {32544#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:02,776 INFO L273 TraceCheckUtils]: 135: Hoare triple {32544#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32544#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:02,776 INFO L273 TraceCheckUtils]: 136: Hoare triple {32544#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32544#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:02,777 INFO L273 TraceCheckUtils]: 137: Hoare triple {32544#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {32545#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:02,778 INFO L273 TraceCheckUtils]: 138: Hoare triple {32545#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32545#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:02,778 INFO L273 TraceCheckUtils]: 139: Hoare triple {32545#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32545#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:02,779 INFO L273 TraceCheckUtils]: 140: Hoare triple {32545#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {32546#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:02,779 INFO L273 TraceCheckUtils]: 141: Hoare triple {32546#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32546#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:02,780 INFO L273 TraceCheckUtils]: 142: Hoare triple {32546#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {32546#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:02,780 INFO L273 TraceCheckUtils]: 143: Hoare triple {32546#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {32547#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:02,781 INFO L273 TraceCheckUtils]: 144: Hoare triple {32547#(<= main_~i~0 46)} assume !(~i~0 < 100000); {32500#false} is VALID [2018-11-23 11:57:02,781 INFO L273 TraceCheckUtils]: 145: Hoare triple {32500#false} havoc ~x~0;~x~0 := 0; {32500#false} is VALID [2018-11-23 11:57:02,781 INFO L273 TraceCheckUtils]: 146: Hoare triple {32500#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {32500#false} is VALID [2018-11-23 11:57:02,782 INFO L256 TraceCheckUtils]: 147: Hoare triple {32500#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {32500#false} is VALID [2018-11-23 11:57:02,782 INFO L273 TraceCheckUtils]: 148: Hoare triple {32500#false} ~cond := #in~cond; {32500#false} is VALID [2018-11-23 11:57:02,782 INFO L273 TraceCheckUtils]: 149: Hoare triple {32500#false} assume 0 == ~cond; {32500#false} is VALID [2018-11-23 11:57:02,782 INFO L273 TraceCheckUtils]: 150: Hoare triple {32500#false} assume !false; {32500#false} is VALID [2018-11-23 11:57:02,798 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 11:57:02,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:02,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2018-11-23 11:57:02,817 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 151 [2018-11-23 11:57:02,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:02,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states. [2018-11-23 11:57:02,967 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:02,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-23 11:57:02,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-23 11:57:02,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 11:57:02,968 INFO L87 Difference]: Start difference. First operand 156 states and 203 transitions. Second operand 50 states. [2018-11-23 11:57:03,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:03,875 INFO L93 Difference]: Finished difference Result 172 states and 222 transitions. [2018-11-23 11:57:03,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-23 11:57:03,875 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 151 [2018-11-23 11:57:03,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:03,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 11:57:03,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 222 transitions. [2018-11-23 11:57:03,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 11:57:03,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 222 transitions. [2018-11-23 11:57:03,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 222 transitions. [2018-11-23 11:57:04,087 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:04,090 INFO L225 Difference]: With dead ends: 172 [2018-11-23 11:57:04,091 INFO L226 Difference]: Without dead ends: 161 [2018-11-23 11:57:04,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 11:57:04,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-23 11:57:04,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2018-11-23 11:57:04,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:04,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand 159 states. [2018-11-23 11:57:04,155 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 159 states. [2018-11-23 11:57:04,155 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 159 states. [2018-11-23 11:57:04,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:04,158 INFO L93 Difference]: Finished difference Result 161 states and 210 transitions. [2018-11-23 11:57:04,159 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 210 transitions. [2018-11-23 11:57:04,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:04,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:04,159 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 161 states. [2018-11-23 11:57:04,159 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 161 states. [2018-11-23 11:57:04,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:04,161 INFO L93 Difference]: Finished difference Result 161 states and 210 transitions. [2018-11-23 11:57:04,161 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 210 transitions. [2018-11-23 11:57:04,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:04,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:04,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:04,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:04,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-23 11:57:04,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 207 transitions. [2018-11-23 11:57:04,164 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 207 transitions. Word has length 151 [2018-11-23 11:57:04,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:04,164 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 207 transitions. [2018-11-23 11:57:04,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-23 11:57:04,164 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 207 transitions. [2018-11-23 11:57:04,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-23 11:57:04,165 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:04,165 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:04,165 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:04,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:04,165 INFO L82 PathProgramCache]: Analyzing trace with hash -154729821, now seen corresponding path program 47 times [2018-11-23 11:57:04,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:04,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:04,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:04,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:04,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:05,483 INFO L256 TraceCheckUtils]: 0: Hoare triple {33767#true} call ULTIMATE.init(); {33767#true} is VALID [2018-11-23 11:57:05,484 INFO L273 TraceCheckUtils]: 1: Hoare triple {33767#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33767#true} is VALID [2018-11-23 11:57:05,484 INFO L273 TraceCheckUtils]: 2: Hoare triple {33767#true} assume true; {33767#true} is VALID [2018-11-23 11:57:05,484 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33767#true} {33767#true} #55#return; {33767#true} is VALID [2018-11-23 11:57:05,484 INFO L256 TraceCheckUtils]: 4: Hoare triple {33767#true} call #t~ret4 := main(); {33767#true} is VALID [2018-11-23 11:57:05,485 INFO L273 TraceCheckUtils]: 5: Hoare triple {33767#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {33769#(= main_~i~0 0)} is VALID [2018-11-23 11:57:05,485 INFO L273 TraceCheckUtils]: 6: Hoare triple {33769#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33769#(= main_~i~0 0)} is VALID [2018-11-23 11:57:05,486 INFO L273 TraceCheckUtils]: 7: Hoare triple {33769#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33769#(= main_~i~0 0)} is VALID [2018-11-23 11:57:05,487 INFO L273 TraceCheckUtils]: 8: Hoare triple {33769#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {33770#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:05,487 INFO L273 TraceCheckUtils]: 9: Hoare triple {33770#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33770#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:05,487 INFO L273 TraceCheckUtils]: 10: Hoare triple {33770#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33770#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:05,488 INFO L273 TraceCheckUtils]: 11: Hoare triple {33770#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {33771#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:05,488 INFO L273 TraceCheckUtils]: 12: Hoare triple {33771#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33771#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:05,488 INFO L273 TraceCheckUtils]: 13: Hoare triple {33771#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33771#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:05,489 INFO L273 TraceCheckUtils]: 14: Hoare triple {33771#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {33772#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:05,489 INFO L273 TraceCheckUtils]: 15: Hoare triple {33772#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33772#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:05,490 INFO L273 TraceCheckUtils]: 16: Hoare triple {33772#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33772#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:05,490 INFO L273 TraceCheckUtils]: 17: Hoare triple {33772#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {33773#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:05,491 INFO L273 TraceCheckUtils]: 18: Hoare triple {33773#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33773#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:05,491 INFO L273 TraceCheckUtils]: 19: Hoare triple {33773#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33773#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:05,492 INFO L273 TraceCheckUtils]: 20: Hoare triple {33773#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {33774#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:05,493 INFO L273 TraceCheckUtils]: 21: Hoare triple {33774#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33774#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:05,493 INFO L273 TraceCheckUtils]: 22: Hoare triple {33774#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33774#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:05,494 INFO L273 TraceCheckUtils]: 23: Hoare triple {33774#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {33775#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:05,494 INFO L273 TraceCheckUtils]: 24: Hoare triple {33775#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33775#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:05,495 INFO L273 TraceCheckUtils]: 25: Hoare triple {33775#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33775#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:05,495 INFO L273 TraceCheckUtils]: 26: Hoare triple {33775#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {33776#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:05,496 INFO L273 TraceCheckUtils]: 27: Hoare triple {33776#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33776#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:05,496 INFO L273 TraceCheckUtils]: 28: Hoare triple {33776#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33776#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:05,497 INFO L273 TraceCheckUtils]: 29: Hoare triple {33776#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {33777#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:05,498 INFO L273 TraceCheckUtils]: 30: Hoare triple {33777#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33777#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:05,498 INFO L273 TraceCheckUtils]: 31: Hoare triple {33777#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33777#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:05,499 INFO L273 TraceCheckUtils]: 32: Hoare triple {33777#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {33778#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:05,499 INFO L273 TraceCheckUtils]: 33: Hoare triple {33778#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33778#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:05,500 INFO L273 TraceCheckUtils]: 34: Hoare triple {33778#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33778#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:05,500 INFO L273 TraceCheckUtils]: 35: Hoare triple {33778#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {33779#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:05,501 INFO L273 TraceCheckUtils]: 36: Hoare triple {33779#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33779#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:05,501 INFO L273 TraceCheckUtils]: 37: Hoare triple {33779#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33779#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:05,502 INFO L273 TraceCheckUtils]: 38: Hoare triple {33779#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {33780#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:05,503 INFO L273 TraceCheckUtils]: 39: Hoare triple {33780#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33780#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:05,503 INFO L273 TraceCheckUtils]: 40: Hoare triple {33780#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33780#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:05,504 INFO L273 TraceCheckUtils]: 41: Hoare triple {33780#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {33781#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:05,504 INFO L273 TraceCheckUtils]: 42: Hoare triple {33781#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33781#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:05,505 INFO L273 TraceCheckUtils]: 43: Hoare triple {33781#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33781#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:05,506 INFO L273 TraceCheckUtils]: 44: Hoare triple {33781#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {33782#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:05,506 INFO L273 TraceCheckUtils]: 45: Hoare triple {33782#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33782#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:05,507 INFO L273 TraceCheckUtils]: 46: Hoare triple {33782#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33782#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:05,507 INFO L273 TraceCheckUtils]: 47: Hoare triple {33782#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {33783#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:05,508 INFO L273 TraceCheckUtils]: 48: Hoare triple {33783#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33783#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:05,508 INFO L273 TraceCheckUtils]: 49: Hoare triple {33783#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33783#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:05,509 INFO L273 TraceCheckUtils]: 50: Hoare triple {33783#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {33784#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:05,509 INFO L273 TraceCheckUtils]: 51: Hoare triple {33784#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33784#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:05,510 INFO L273 TraceCheckUtils]: 52: Hoare triple {33784#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33784#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:05,511 INFO L273 TraceCheckUtils]: 53: Hoare triple {33784#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {33785#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:05,511 INFO L273 TraceCheckUtils]: 54: Hoare triple {33785#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33785#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:05,512 INFO L273 TraceCheckUtils]: 55: Hoare triple {33785#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33785#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:05,512 INFO L273 TraceCheckUtils]: 56: Hoare triple {33785#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {33786#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:05,513 INFO L273 TraceCheckUtils]: 57: Hoare triple {33786#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33786#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:05,513 INFO L273 TraceCheckUtils]: 58: Hoare triple {33786#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33786#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:05,514 INFO L273 TraceCheckUtils]: 59: Hoare triple {33786#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {33787#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:05,515 INFO L273 TraceCheckUtils]: 60: Hoare triple {33787#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33787#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:05,515 INFO L273 TraceCheckUtils]: 61: Hoare triple {33787#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33787#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:05,516 INFO L273 TraceCheckUtils]: 62: Hoare triple {33787#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {33788#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:05,516 INFO L273 TraceCheckUtils]: 63: Hoare triple {33788#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33788#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:05,517 INFO L273 TraceCheckUtils]: 64: Hoare triple {33788#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33788#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:05,517 INFO L273 TraceCheckUtils]: 65: Hoare triple {33788#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {33789#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:05,518 INFO L273 TraceCheckUtils]: 66: Hoare triple {33789#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33789#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:05,518 INFO L273 TraceCheckUtils]: 67: Hoare triple {33789#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33789#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:05,519 INFO L273 TraceCheckUtils]: 68: Hoare triple {33789#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {33790#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:05,520 INFO L273 TraceCheckUtils]: 69: Hoare triple {33790#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33790#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:05,520 INFO L273 TraceCheckUtils]: 70: Hoare triple {33790#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33790#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:05,521 INFO L273 TraceCheckUtils]: 71: Hoare triple {33790#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {33791#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:05,521 INFO L273 TraceCheckUtils]: 72: Hoare triple {33791#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33791#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:05,522 INFO L273 TraceCheckUtils]: 73: Hoare triple {33791#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33791#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:05,522 INFO L273 TraceCheckUtils]: 74: Hoare triple {33791#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {33792#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:05,523 INFO L273 TraceCheckUtils]: 75: Hoare triple {33792#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33792#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:05,523 INFO L273 TraceCheckUtils]: 76: Hoare triple {33792#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33792#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:05,524 INFO L273 TraceCheckUtils]: 77: Hoare triple {33792#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {33793#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:05,525 INFO L273 TraceCheckUtils]: 78: Hoare triple {33793#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33793#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:05,525 INFO L273 TraceCheckUtils]: 79: Hoare triple {33793#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33793#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:05,526 INFO L273 TraceCheckUtils]: 80: Hoare triple {33793#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {33794#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:05,526 INFO L273 TraceCheckUtils]: 81: Hoare triple {33794#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33794#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:05,527 INFO L273 TraceCheckUtils]: 82: Hoare triple {33794#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33794#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:05,528 INFO L273 TraceCheckUtils]: 83: Hoare triple {33794#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {33795#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:05,528 INFO L273 TraceCheckUtils]: 84: Hoare triple {33795#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33795#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:05,529 INFO L273 TraceCheckUtils]: 85: Hoare triple {33795#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33795#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:05,529 INFO L273 TraceCheckUtils]: 86: Hoare triple {33795#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {33796#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:05,530 INFO L273 TraceCheckUtils]: 87: Hoare triple {33796#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33796#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:05,530 INFO L273 TraceCheckUtils]: 88: Hoare triple {33796#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33796#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:05,531 INFO L273 TraceCheckUtils]: 89: Hoare triple {33796#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {33797#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:05,531 INFO L273 TraceCheckUtils]: 90: Hoare triple {33797#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33797#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:05,532 INFO L273 TraceCheckUtils]: 91: Hoare triple {33797#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33797#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:05,533 INFO L273 TraceCheckUtils]: 92: Hoare triple {33797#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {33798#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:05,533 INFO L273 TraceCheckUtils]: 93: Hoare triple {33798#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33798#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:05,534 INFO L273 TraceCheckUtils]: 94: Hoare triple {33798#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33798#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:05,534 INFO L273 TraceCheckUtils]: 95: Hoare triple {33798#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {33799#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:05,535 INFO L273 TraceCheckUtils]: 96: Hoare triple {33799#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33799#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:05,535 INFO L273 TraceCheckUtils]: 97: Hoare triple {33799#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33799#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:05,536 INFO L273 TraceCheckUtils]: 98: Hoare triple {33799#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {33800#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:05,537 INFO L273 TraceCheckUtils]: 99: Hoare triple {33800#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33800#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:05,537 INFO L273 TraceCheckUtils]: 100: Hoare triple {33800#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33800#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:05,538 INFO L273 TraceCheckUtils]: 101: Hoare triple {33800#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {33801#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:05,538 INFO L273 TraceCheckUtils]: 102: Hoare triple {33801#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33801#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:05,539 INFO L273 TraceCheckUtils]: 103: Hoare triple {33801#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33801#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:05,539 INFO L273 TraceCheckUtils]: 104: Hoare triple {33801#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {33802#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:05,540 INFO L273 TraceCheckUtils]: 105: Hoare triple {33802#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33802#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:05,540 INFO L273 TraceCheckUtils]: 106: Hoare triple {33802#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33802#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:05,541 INFO L273 TraceCheckUtils]: 107: Hoare triple {33802#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {33803#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:05,542 INFO L273 TraceCheckUtils]: 108: Hoare triple {33803#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33803#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:05,542 INFO L273 TraceCheckUtils]: 109: Hoare triple {33803#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33803#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:05,543 INFO L273 TraceCheckUtils]: 110: Hoare triple {33803#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {33804#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:05,543 INFO L273 TraceCheckUtils]: 111: Hoare triple {33804#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33804#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:05,544 INFO L273 TraceCheckUtils]: 112: Hoare triple {33804#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33804#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:05,545 INFO L273 TraceCheckUtils]: 113: Hoare triple {33804#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {33805#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:05,545 INFO L273 TraceCheckUtils]: 114: Hoare triple {33805#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33805#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:05,546 INFO L273 TraceCheckUtils]: 115: Hoare triple {33805#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33805#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:05,546 INFO L273 TraceCheckUtils]: 116: Hoare triple {33805#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {33806#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:05,547 INFO L273 TraceCheckUtils]: 117: Hoare triple {33806#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33806#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:05,547 INFO L273 TraceCheckUtils]: 118: Hoare triple {33806#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33806#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:05,548 INFO L273 TraceCheckUtils]: 119: Hoare triple {33806#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {33807#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:05,548 INFO L273 TraceCheckUtils]: 120: Hoare triple {33807#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33807#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:05,549 INFO L273 TraceCheckUtils]: 121: Hoare triple {33807#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33807#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:05,550 INFO L273 TraceCheckUtils]: 122: Hoare triple {33807#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {33808#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:05,550 INFO L273 TraceCheckUtils]: 123: Hoare triple {33808#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33808#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:05,551 INFO L273 TraceCheckUtils]: 124: Hoare triple {33808#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33808#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:05,551 INFO L273 TraceCheckUtils]: 125: Hoare triple {33808#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {33809#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:05,552 INFO L273 TraceCheckUtils]: 126: Hoare triple {33809#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33809#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:05,552 INFO L273 TraceCheckUtils]: 127: Hoare triple {33809#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33809#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:05,553 INFO L273 TraceCheckUtils]: 128: Hoare triple {33809#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {33810#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:05,554 INFO L273 TraceCheckUtils]: 129: Hoare triple {33810#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33810#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:05,554 INFO L273 TraceCheckUtils]: 130: Hoare triple {33810#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33810#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:05,555 INFO L273 TraceCheckUtils]: 131: Hoare triple {33810#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {33811#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:05,555 INFO L273 TraceCheckUtils]: 132: Hoare triple {33811#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33811#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:05,556 INFO L273 TraceCheckUtils]: 133: Hoare triple {33811#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33811#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:05,556 INFO L273 TraceCheckUtils]: 134: Hoare triple {33811#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {33812#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:05,557 INFO L273 TraceCheckUtils]: 135: Hoare triple {33812#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33812#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:05,557 INFO L273 TraceCheckUtils]: 136: Hoare triple {33812#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33812#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:05,558 INFO L273 TraceCheckUtils]: 137: Hoare triple {33812#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {33813#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:05,559 INFO L273 TraceCheckUtils]: 138: Hoare triple {33813#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33813#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:05,559 INFO L273 TraceCheckUtils]: 139: Hoare triple {33813#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33813#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:05,560 INFO L273 TraceCheckUtils]: 140: Hoare triple {33813#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {33814#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:05,560 INFO L273 TraceCheckUtils]: 141: Hoare triple {33814#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33814#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:05,561 INFO L273 TraceCheckUtils]: 142: Hoare triple {33814#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33814#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:05,562 INFO L273 TraceCheckUtils]: 143: Hoare triple {33814#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {33815#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:05,562 INFO L273 TraceCheckUtils]: 144: Hoare triple {33815#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33815#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:05,563 INFO L273 TraceCheckUtils]: 145: Hoare triple {33815#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33815#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:05,563 INFO L273 TraceCheckUtils]: 146: Hoare triple {33815#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {33816#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:05,564 INFO L273 TraceCheckUtils]: 147: Hoare triple {33816#(<= main_~i~0 47)} assume !(~i~0 < 100000); {33768#false} is VALID [2018-11-23 11:57:05,564 INFO L273 TraceCheckUtils]: 148: Hoare triple {33768#false} havoc ~x~0;~x~0 := 0; {33768#false} is VALID [2018-11-23 11:57:05,564 INFO L273 TraceCheckUtils]: 149: Hoare triple {33768#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {33768#false} is VALID [2018-11-23 11:57:05,564 INFO L256 TraceCheckUtils]: 150: Hoare triple {33768#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {33768#false} is VALID [2018-11-23 11:57:05,565 INFO L273 TraceCheckUtils]: 151: Hoare triple {33768#false} ~cond := #in~cond; {33768#false} is VALID [2018-11-23 11:57:05,565 INFO L273 TraceCheckUtils]: 152: Hoare triple {33768#false} assume 0 == ~cond; {33768#false} is VALID [2018-11-23 11:57:05,565 INFO L273 TraceCheckUtils]: 153: Hoare triple {33768#false} assume !false; {33768#false} is VALID [2018-11-23 11:57:05,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 0 proven. 3290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:05,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:05,582 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:05,599 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:57:05,783 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-11-23 11:57:05,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:57:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:05,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:06,134 INFO L256 TraceCheckUtils]: 0: Hoare triple {33767#true} call ULTIMATE.init(); {33767#true} is VALID [2018-11-23 11:57:06,135 INFO L273 TraceCheckUtils]: 1: Hoare triple {33767#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33767#true} is VALID [2018-11-23 11:57:06,135 INFO L273 TraceCheckUtils]: 2: Hoare triple {33767#true} assume true; {33767#true} is VALID [2018-11-23 11:57:06,135 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33767#true} {33767#true} #55#return; {33767#true} is VALID [2018-11-23 11:57:06,135 INFO L256 TraceCheckUtils]: 4: Hoare triple {33767#true} call #t~ret4 := main(); {33767#true} is VALID [2018-11-23 11:57:06,136 INFO L273 TraceCheckUtils]: 5: Hoare triple {33767#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {33835#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:06,137 INFO L273 TraceCheckUtils]: 6: Hoare triple {33835#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33835#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:06,137 INFO L273 TraceCheckUtils]: 7: Hoare triple {33835#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33835#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:06,138 INFO L273 TraceCheckUtils]: 8: Hoare triple {33835#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {33770#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:06,138 INFO L273 TraceCheckUtils]: 9: Hoare triple {33770#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33770#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:06,139 INFO L273 TraceCheckUtils]: 10: Hoare triple {33770#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33770#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:06,139 INFO L273 TraceCheckUtils]: 11: Hoare triple {33770#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {33771#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:06,139 INFO L273 TraceCheckUtils]: 12: Hoare triple {33771#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33771#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:06,140 INFO L273 TraceCheckUtils]: 13: Hoare triple {33771#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33771#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:06,140 INFO L273 TraceCheckUtils]: 14: Hoare triple {33771#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {33772#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:06,140 INFO L273 TraceCheckUtils]: 15: Hoare triple {33772#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33772#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:06,141 INFO L273 TraceCheckUtils]: 16: Hoare triple {33772#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33772#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:06,142 INFO L273 TraceCheckUtils]: 17: Hoare triple {33772#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {33773#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:06,142 INFO L273 TraceCheckUtils]: 18: Hoare triple {33773#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33773#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:06,143 INFO L273 TraceCheckUtils]: 19: Hoare triple {33773#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33773#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:06,143 INFO L273 TraceCheckUtils]: 20: Hoare triple {33773#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {33774#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:06,144 INFO L273 TraceCheckUtils]: 21: Hoare triple {33774#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33774#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:06,144 INFO L273 TraceCheckUtils]: 22: Hoare triple {33774#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33774#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:06,145 INFO L273 TraceCheckUtils]: 23: Hoare triple {33774#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {33775#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:06,146 INFO L273 TraceCheckUtils]: 24: Hoare triple {33775#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33775#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:06,146 INFO L273 TraceCheckUtils]: 25: Hoare triple {33775#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33775#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:06,147 INFO L273 TraceCheckUtils]: 26: Hoare triple {33775#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {33776#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:06,147 INFO L273 TraceCheckUtils]: 27: Hoare triple {33776#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33776#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:06,148 INFO L273 TraceCheckUtils]: 28: Hoare triple {33776#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33776#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:06,148 INFO L273 TraceCheckUtils]: 29: Hoare triple {33776#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {33777#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:06,149 INFO L273 TraceCheckUtils]: 30: Hoare triple {33777#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33777#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:06,149 INFO L273 TraceCheckUtils]: 31: Hoare triple {33777#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33777#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:06,150 INFO L273 TraceCheckUtils]: 32: Hoare triple {33777#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {33778#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:06,151 INFO L273 TraceCheckUtils]: 33: Hoare triple {33778#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33778#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:06,151 INFO L273 TraceCheckUtils]: 34: Hoare triple {33778#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33778#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:06,152 INFO L273 TraceCheckUtils]: 35: Hoare triple {33778#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {33779#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:06,152 INFO L273 TraceCheckUtils]: 36: Hoare triple {33779#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33779#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:06,153 INFO L273 TraceCheckUtils]: 37: Hoare triple {33779#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33779#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:06,154 INFO L273 TraceCheckUtils]: 38: Hoare triple {33779#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {33780#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:06,154 INFO L273 TraceCheckUtils]: 39: Hoare triple {33780#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33780#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:06,154 INFO L273 TraceCheckUtils]: 40: Hoare triple {33780#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33780#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:06,155 INFO L273 TraceCheckUtils]: 41: Hoare triple {33780#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {33781#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:06,156 INFO L273 TraceCheckUtils]: 42: Hoare triple {33781#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33781#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:06,156 INFO L273 TraceCheckUtils]: 43: Hoare triple {33781#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33781#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:06,157 INFO L273 TraceCheckUtils]: 44: Hoare triple {33781#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {33782#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:06,157 INFO L273 TraceCheckUtils]: 45: Hoare triple {33782#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33782#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:06,158 INFO L273 TraceCheckUtils]: 46: Hoare triple {33782#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33782#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:06,159 INFO L273 TraceCheckUtils]: 47: Hoare triple {33782#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {33783#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:06,159 INFO L273 TraceCheckUtils]: 48: Hoare triple {33783#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33783#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:06,160 INFO L273 TraceCheckUtils]: 49: Hoare triple {33783#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33783#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:06,160 INFO L273 TraceCheckUtils]: 50: Hoare triple {33783#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {33784#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:06,161 INFO L273 TraceCheckUtils]: 51: Hoare triple {33784#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33784#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:06,161 INFO L273 TraceCheckUtils]: 52: Hoare triple {33784#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33784#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:06,162 INFO L273 TraceCheckUtils]: 53: Hoare triple {33784#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {33785#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:06,162 INFO L273 TraceCheckUtils]: 54: Hoare triple {33785#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33785#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:06,163 INFO L273 TraceCheckUtils]: 55: Hoare triple {33785#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33785#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:06,164 INFO L273 TraceCheckUtils]: 56: Hoare triple {33785#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {33786#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:06,164 INFO L273 TraceCheckUtils]: 57: Hoare triple {33786#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33786#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:06,165 INFO L273 TraceCheckUtils]: 58: Hoare triple {33786#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33786#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:06,165 INFO L273 TraceCheckUtils]: 59: Hoare triple {33786#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {33787#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:06,166 INFO L273 TraceCheckUtils]: 60: Hoare triple {33787#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33787#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:06,166 INFO L273 TraceCheckUtils]: 61: Hoare triple {33787#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33787#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:06,167 INFO L273 TraceCheckUtils]: 62: Hoare triple {33787#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {33788#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:06,168 INFO L273 TraceCheckUtils]: 63: Hoare triple {33788#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33788#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:06,168 INFO L273 TraceCheckUtils]: 64: Hoare triple {33788#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33788#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:06,169 INFO L273 TraceCheckUtils]: 65: Hoare triple {33788#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {33789#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:06,169 INFO L273 TraceCheckUtils]: 66: Hoare triple {33789#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33789#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:06,170 INFO L273 TraceCheckUtils]: 67: Hoare triple {33789#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33789#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:06,171 INFO L273 TraceCheckUtils]: 68: Hoare triple {33789#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {33790#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:06,171 INFO L273 TraceCheckUtils]: 69: Hoare triple {33790#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33790#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:06,172 INFO L273 TraceCheckUtils]: 70: Hoare triple {33790#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33790#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:06,172 INFO L273 TraceCheckUtils]: 71: Hoare triple {33790#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {33791#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:06,173 INFO L273 TraceCheckUtils]: 72: Hoare triple {33791#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33791#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:06,173 INFO L273 TraceCheckUtils]: 73: Hoare triple {33791#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33791#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:06,174 INFO L273 TraceCheckUtils]: 74: Hoare triple {33791#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {33792#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:06,174 INFO L273 TraceCheckUtils]: 75: Hoare triple {33792#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33792#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:06,175 INFO L273 TraceCheckUtils]: 76: Hoare triple {33792#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33792#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:06,176 INFO L273 TraceCheckUtils]: 77: Hoare triple {33792#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {33793#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:06,176 INFO L273 TraceCheckUtils]: 78: Hoare triple {33793#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33793#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:06,177 INFO L273 TraceCheckUtils]: 79: Hoare triple {33793#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33793#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:06,177 INFO L273 TraceCheckUtils]: 80: Hoare triple {33793#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {33794#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:06,178 INFO L273 TraceCheckUtils]: 81: Hoare triple {33794#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33794#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:06,178 INFO L273 TraceCheckUtils]: 82: Hoare triple {33794#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33794#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:06,179 INFO L273 TraceCheckUtils]: 83: Hoare triple {33794#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {33795#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:06,179 INFO L273 TraceCheckUtils]: 84: Hoare triple {33795#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33795#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:06,180 INFO L273 TraceCheckUtils]: 85: Hoare triple {33795#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33795#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:06,181 INFO L273 TraceCheckUtils]: 86: Hoare triple {33795#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {33796#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:06,181 INFO L273 TraceCheckUtils]: 87: Hoare triple {33796#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33796#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:06,182 INFO L273 TraceCheckUtils]: 88: Hoare triple {33796#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33796#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:06,182 INFO L273 TraceCheckUtils]: 89: Hoare triple {33796#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {33797#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:06,183 INFO L273 TraceCheckUtils]: 90: Hoare triple {33797#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33797#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:06,183 INFO L273 TraceCheckUtils]: 91: Hoare triple {33797#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33797#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:06,184 INFO L273 TraceCheckUtils]: 92: Hoare triple {33797#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {33798#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:06,185 INFO L273 TraceCheckUtils]: 93: Hoare triple {33798#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33798#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:06,185 INFO L273 TraceCheckUtils]: 94: Hoare triple {33798#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33798#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:06,186 INFO L273 TraceCheckUtils]: 95: Hoare triple {33798#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {33799#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:06,186 INFO L273 TraceCheckUtils]: 96: Hoare triple {33799#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33799#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:06,187 INFO L273 TraceCheckUtils]: 97: Hoare triple {33799#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33799#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:06,187 INFO L273 TraceCheckUtils]: 98: Hoare triple {33799#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {33800#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:06,188 INFO L273 TraceCheckUtils]: 99: Hoare triple {33800#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33800#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:06,188 INFO L273 TraceCheckUtils]: 100: Hoare triple {33800#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33800#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:06,189 INFO L273 TraceCheckUtils]: 101: Hoare triple {33800#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {33801#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:06,190 INFO L273 TraceCheckUtils]: 102: Hoare triple {33801#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33801#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:06,190 INFO L273 TraceCheckUtils]: 103: Hoare triple {33801#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33801#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:06,191 INFO L273 TraceCheckUtils]: 104: Hoare triple {33801#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {33802#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:06,191 INFO L273 TraceCheckUtils]: 105: Hoare triple {33802#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33802#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:06,192 INFO L273 TraceCheckUtils]: 106: Hoare triple {33802#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33802#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:06,193 INFO L273 TraceCheckUtils]: 107: Hoare triple {33802#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {33803#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:06,193 INFO L273 TraceCheckUtils]: 108: Hoare triple {33803#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33803#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:06,194 INFO L273 TraceCheckUtils]: 109: Hoare triple {33803#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33803#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:06,194 INFO L273 TraceCheckUtils]: 110: Hoare triple {33803#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {33804#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:06,195 INFO L273 TraceCheckUtils]: 111: Hoare triple {33804#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33804#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:06,195 INFO L273 TraceCheckUtils]: 112: Hoare triple {33804#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33804#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:06,196 INFO L273 TraceCheckUtils]: 113: Hoare triple {33804#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {33805#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:06,196 INFO L273 TraceCheckUtils]: 114: Hoare triple {33805#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33805#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:06,197 INFO L273 TraceCheckUtils]: 115: Hoare triple {33805#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33805#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:06,198 INFO L273 TraceCheckUtils]: 116: Hoare triple {33805#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {33806#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:06,198 INFO L273 TraceCheckUtils]: 117: Hoare triple {33806#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33806#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:06,199 INFO L273 TraceCheckUtils]: 118: Hoare triple {33806#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33806#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:06,199 INFO L273 TraceCheckUtils]: 119: Hoare triple {33806#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {33807#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:06,200 INFO L273 TraceCheckUtils]: 120: Hoare triple {33807#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33807#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:06,200 INFO L273 TraceCheckUtils]: 121: Hoare triple {33807#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33807#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:06,201 INFO L273 TraceCheckUtils]: 122: Hoare triple {33807#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {33808#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:06,202 INFO L273 TraceCheckUtils]: 123: Hoare triple {33808#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33808#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:06,202 INFO L273 TraceCheckUtils]: 124: Hoare triple {33808#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33808#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:06,203 INFO L273 TraceCheckUtils]: 125: Hoare triple {33808#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {33809#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:06,203 INFO L273 TraceCheckUtils]: 126: Hoare triple {33809#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33809#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:06,204 INFO L273 TraceCheckUtils]: 127: Hoare triple {33809#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33809#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:06,204 INFO L273 TraceCheckUtils]: 128: Hoare triple {33809#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {33810#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:06,205 INFO L273 TraceCheckUtils]: 129: Hoare triple {33810#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33810#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:06,205 INFO L273 TraceCheckUtils]: 130: Hoare triple {33810#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33810#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:06,206 INFO L273 TraceCheckUtils]: 131: Hoare triple {33810#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {33811#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:06,207 INFO L273 TraceCheckUtils]: 132: Hoare triple {33811#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33811#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:06,207 INFO L273 TraceCheckUtils]: 133: Hoare triple {33811#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33811#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:06,208 INFO L273 TraceCheckUtils]: 134: Hoare triple {33811#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {33812#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:06,208 INFO L273 TraceCheckUtils]: 135: Hoare triple {33812#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33812#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:06,209 INFO L273 TraceCheckUtils]: 136: Hoare triple {33812#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33812#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:06,210 INFO L273 TraceCheckUtils]: 137: Hoare triple {33812#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {33813#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:06,210 INFO L273 TraceCheckUtils]: 138: Hoare triple {33813#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33813#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:06,210 INFO L273 TraceCheckUtils]: 139: Hoare triple {33813#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33813#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:06,211 INFO L273 TraceCheckUtils]: 140: Hoare triple {33813#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {33814#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:06,212 INFO L273 TraceCheckUtils]: 141: Hoare triple {33814#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33814#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:06,212 INFO L273 TraceCheckUtils]: 142: Hoare triple {33814#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33814#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:06,213 INFO L273 TraceCheckUtils]: 143: Hoare triple {33814#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {33815#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:06,213 INFO L273 TraceCheckUtils]: 144: Hoare triple {33815#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33815#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:06,214 INFO L273 TraceCheckUtils]: 145: Hoare triple {33815#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {33815#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:06,215 INFO L273 TraceCheckUtils]: 146: Hoare triple {33815#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {33816#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:06,215 INFO L273 TraceCheckUtils]: 147: Hoare triple {33816#(<= main_~i~0 47)} assume !(~i~0 < 100000); {33768#false} is VALID [2018-11-23 11:57:06,215 INFO L273 TraceCheckUtils]: 148: Hoare triple {33768#false} havoc ~x~0;~x~0 := 0; {33768#false} is VALID [2018-11-23 11:57:06,216 INFO L273 TraceCheckUtils]: 149: Hoare triple {33768#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {33768#false} is VALID [2018-11-23 11:57:06,216 INFO L256 TraceCheckUtils]: 150: Hoare triple {33768#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {33768#false} is VALID [2018-11-23 11:57:06,216 INFO L273 TraceCheckUtils]: 151: Hoare triple {33768#false} ~cond := #in~cond; {33768#false} is VALID [2018-11-23 11:57:06,216 INFO L273 TraceCheckUtils]: 152: Hoare triple {33768#false} assume 0 == ~cond; {33768#false} is VALID [2018-11-23 11:57:06,216 INFO L273 TraceCheckUtils]: 153: Hoare triple {33768#false} assume !false; {33768#false} is VALID [2018-11-23 11:57:06,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 0 proven. 3290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:06,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:06,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 51 [2018-11-23 11:57:06,252 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 154 [2018-11-23 11:57:06,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:06,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states. [2018-11-23 11:57:06,409 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:06,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-23 11:57:06,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-23 11:57:06,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 11:57:06,410 INFO L87 Difference]: Start difference. First operand 159 states and 207 transitions. Second operand 51 states. [2018-11-23 11:57:07,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:07,178 INFO L93 Difference]: Finished difference Result 175 states and 226 transitions. [2018-11-23 11:57:07,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-23 11:57:07,178 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 154 [2018-11-23 11:57:07,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:07,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 11:57:07,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 226 transitions. [2018-11-23 11:57:07,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 11:57:07,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 226 transitions. [2018-11-23 11:57:07,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 226 transitions. [2018-11-23 11:57:07,394 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:07,397 INFO L225 Difference]: With dead ends: 175 [2018-11-23 11:57:07,397 INFO L226 Difference]: Without dead ends: 164 [2018-11-23 11:57:07,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 11:57:07,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-11-23 11:57:07,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2018-11-23 11:57:07,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:07,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand 162 states. [2018-11-23 11:57:07,441 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 162 states. [2018-11-23 11:57:07,441 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 162 states. [2018-11-23 11:57:07,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:07,444 INFO L93 Difference]: Finished difference Result 164 states and 214 transitions. [2018-11-23 11:57:07,444 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 214 transitions. [2018-11-23 11:57:07,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:07,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:07,444 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 164 states. [2018-11-23 11:57:07,444 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 164 states. [2018-11-23 11:57:07,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:07,447 INFO L93 Difference]: Finished difference Result 164 states and 214 transitions. [2018-11-23 11:57:07,447 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 214 transitions. [2018-11-23 11:57:07,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:07,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:07,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:07,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:07,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-23 11:57:07,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 211 transitions. [2018-11-23 11:57:07,450 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 211 transitions. Word has length 154 [2018-11-23 11:57:07,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:07,450 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 211 transitions. [2018-11-23 11:57:07,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-23 11:57:07,451 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 211 transitions. [2018-11-23 11:57:07,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-23 11:57:07,451 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:07,452 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:07,452 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:07,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:07,452 INFO L82 PathProgramCache]: Analyzing trace with hash -2010822983, now seen corresponding path program 48 times [2018-11-23 11:57:07,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:07,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:07,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:07,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:07,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:07,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:08,632 INFO L256 TraceCheckUtils]: 0: Hoare triple {35059#true} call ULTIMATE.init(); {35059#true} is VALID [2018-11-23 11:57:08,632 INFO L273 TraceCheckUtils]: 1: Hoare triple {35059#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35059#true} is VALID [2018-11-23 11:57:08,632 INFO L273 TraceCheckUtils]: 2: Hoare triple {35059#true} assume true; {35059#true} is VALID [2018-11-23 11:57:08,633 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35059#true} {35059#true} #55#return; {35059#true} is VALID [2018-11-23 11:57:08,633 INFO L256 TraceCheckUtils]: 4: Hoare triple {35059#true} call #t~ret4 := main(); {35059#true} is VALID [2018-11-23 11:57:08,633 INFO L273 TraceCheckUtils]: 5: Hoare triple {35059#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {35061#(= main_~i~0 0)} is VALID [2018-11-23 11:57:08,633 INFO L273 TraceCheckUtils]: 6: Hoare triple {35061#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35061#(= main_~i~0 0)} is VALID [2018-11-23 11:57:08,634 INFO L273 TraceCheckUtils]: 7: Hoare triple {35061#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35061#(= main_~i~0 0)} is VALID [2018-11-23 11:57:08,634 INFO L273 TraceCheckUtils]: 8: Hoare triple {35061#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {35062#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:08,635 INFO L273 TraceCheckUtils]: 9: Hoare triple {35062#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35062#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:08,635 INFO L273 TraceCheckUtils]: 10: Hoare triple {35062#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35062#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:08,636 INFO L273 TraceCheckUtils]: 11: Hoare triple {35062#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {35063#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:08,636 INFO L273 TraceCheckUtils]: 12: Hoare triple {35063#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35063#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:08,637 INFO L273 TraceCheckUtils]: 13: Hoare triple {35063#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35063#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:08,638 INFO L273 TraceCheckUtils]: 14: Hoare triple {35063#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {35064#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:08,638 INFO L273 TraceCheckUtils]: 15: Hoare triple {35064#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35064#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:08,639 INFO L273 TraceCheckUtils]: 16: Hoare triple {35064#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35064#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:08,639 INFO L273 TraceCheckUtils]: 17: Hoare triple {35064#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {35065#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:08,640 INFO L273 TraceCheckUtils]: 18: Hoare triple {35065#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35065#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:08,640 INFO L273 TraceCheckUtils]: 19: Hoare triple {35065#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35065#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:08,641 INFO L273 TraceCheckUtils]: 20: Hoare triple {35065#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {35066#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:08,642 INFO L273 TraceCheckUtils]: 21: Hoare triple {35066#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35066#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:08,642 INFO L273 TraceCheckUtils]: 22: Hoare triple {35066#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35066#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:08,643 INFO L273 TraceCheckUtils]: 23: Hoare triple {35066#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {35067#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:08,643 INFO L273 TraceCheckUtils]: 24: Hoare triple {35067#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35067#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:08,644 INFO L273 TraceCheckUtils]: 25: Hoare triple {35067#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35067#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:08,644 INFO L273 TraceCheckUtils]: 26: Hoare triple {35067#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {35068#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:08,645 INFO L273 TraceCheckUtils]: 27: Hoare triple {35068#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35068#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:08,645 INFO L273 TraceCheckUtils]: 28: Hoare triple {35068#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35068#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:08,646 INFO L273 TraceCheckUtils]: 29: Hoare triple {35068#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {35069#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:08,647 INFO L273 TraceCheckUtils]: 30: Hoare triple {35069#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35069#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:08,647 INFO L273 TraceCheckUtils]: 31: Hoare triple {35069#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35069#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:08,648 INFO L273 TraceCheckUtils]: 32: Hoare triple {35069#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {35070#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:08,648 INFO L273 TraceCheckUtils]: 33: Hoare triple {35070#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35070#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:08,649 INFO L273 TraceCheckUtils]: 34: Hoare triple {35070#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35070#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:08,649 INFO L273 TraceCheckUtils]: 35: Hoare triple {35070#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {35071#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:08,650 INFO L273 TraceCheckUtils]: 36: Hoare triple {35071#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35071#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:08,650 INFO L273 TraceCheckUtils]: 37: Hoare triple {35071#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35071#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:08,651 INFO L273 TraceCheckUtils]: 38: Hoare triple {35071#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {35072#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:08,652 INFO L273 TraceCheckUtils]: 39: Hoare triple {35072#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35072#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:08,652 INFO L273 TraceCheckUtils]: 40: Hoare triple {35072#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35072#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:08,653 INFO L273 TraceCheckUtils]: 41: Hoare triple {35072#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {35073#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:08,653 INFO L273 TraceCheckUtils]: 42: Hoare triple {35073#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35073#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:08,654 INFO L273 TraceCheckUtils]: 43: Hoare triple {35073#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35073#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:08,654 INFO L273 TraceCheckUtils]: 44: Hoare triple {35073#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {35074#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:08,655 INFO L273 TraceCheckUtils]: 45: Hoare triple {35074#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35074#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:08,655 INFO L273 TraceCheckUtils]: 46: Hoare triple {35074#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35074#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:08,656 INFO L273 TraceCheckUtils]: 47: Hoare triple {35074#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {35075#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:08,656 INFO L273 TraceCheckUtils]: 48: Hoare triple {35075#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35075#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:08,657 INFO L273 TraceCheckUtils]: 49: Hoare triple {35075#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35075#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:08,658 INFO L273 TraceCheckUtils]: 50: Hoare triple {35075#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {35076#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:08,658 INFO L273 TraceCheckUtils]: 51: Hoare triple {35076#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35076#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:08,659 INFO L273 TraceCheckUtils]: 52: Hoare triple {35076#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35076#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:08,659 INFO L273 TraceCheckUtils]: 53: Hoare triple {35076#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {35077#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:08,660 INFO L273 TraceCheckUtils]: 54: Hoare triple {35077#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35077#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:08,660 INFO L273 TraceCheckUtils]: 55: Hoare triple {35077#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35077#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:08,661 INFO L273 TraceCheckUtils]: 56: Hoare triple {35077#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {35078#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:08,661 INFO L273 TraceCheckUtils]: 57: Hoare triple {35078#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35078#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:08,662 INFO L273 TraceCheckUtils]: 58: Hoare triple {35078#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35078#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:08,663 INFO L273 TraceCheckUtils]: 59: Hoare triple {35078#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {35079#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:08,663 INFO L273 TraceCheckUtils]: 60: Hoare triple {35079#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35079#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:08,664 INFO L273 TraceCheckUtils]: 61: Hoare triple {35079#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35079#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:08,664 INFO L273 TraceCheckUtils]: 62: Hoare triple {35079#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {35080#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:08,665 INFO L273 TraceCheckUtils]: 63: Hoare triple {35080#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35080#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:08,665 INFO L273 TraceCheckUtils]: 64: Hoare triple {35080#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35080#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:08,666 INFO L273 TraceCheckUtils]: 65: Hoare triple {35080#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {35081#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:08,667 INFO L273 TraceCheckUtils]: 66: Hoare triple {35081#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35081#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:08,667 INFO L273 TraceCheckUtils]: 67: Hoare triple {35081#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35081#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:08,668 INFO L273 TraceCheckUtils]: 68: Hoare triple {35081#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {35082#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:08,668 INFO L273 TraceCheckUtils]: 69: Hoare triple {35082#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35082#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:08,669 INFO L273 TraceCheckUtils]: 70: Hoare triple {35082#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35082#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:08,669 INFO L273 TraceCheckUtils]: 71: Hoare triple {35082#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {35083#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:08,670 INFO L273 TraceCheckUtils]: 72: Hoare triple {35083#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35083#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:08,670 INFO L273 TraceCheckUtils]: 73: Hoare triple {35083#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35083#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:08,671 INFO L273 TraceCheckUtils]: 74: Hoare triple {35083#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {35084#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:08,672 INFO L273 TraceCheckUtils]: 75: Hoare triple {35084#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35084#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:08,672 INFO L273 TraceCheckUtils]: 76: Hoare triple {35084#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35084#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:08,673 INFO L273 TraceCheckUtils]: 77: Hoare triple {35084#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {35085#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:08,673 INFO L273 TraceCheckUtils]: 78: Hoare triple {35085#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35085#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:08,674 INFO L273 TraceCheckUtils]: 79: Hoare triple {35085#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35085#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:08,675 INFO L273 TraceCheckUtils]: 80: Hoare triple {35085#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {35086#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:08,675 INFO L273 TraceCheckUtils]: 81: Hoare triple {35086#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35086#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:08,676 INFO L273 TraceCheckUtils]: 82: Hoare triple {35086#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35086#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:08,676 INFO L273 TraceCheckUtils]: 83: Hoare triple {35086#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {35087#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:08,677 INFO L273 TraceCheckUtils]: 84: Hoare triple {35087#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35087#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:08,677 INFO L273 TraceCheckUtils]: 85: Hoare triple {35087#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35087#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:08,678 INFO L273 TraceCheckUtils]: 86: Hoare triple {35087#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {35088#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:08,678 INFO L273 TraceCheckUtils]: 87: Hoare triple {35088#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35088#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:08,679 INFO L273 TraceCheckUtils]: 88: Hoare triple {35088#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35088#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:08,680 INFO L273 TraceCheckUtils]: 89: Hoare triple {35088#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {35089#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:08,680 INFO L273 TraceCheckUtils]: 90: Hoare triple {35089#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35089#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:08,681 INFO L273 TraceCheckUtils]: 91: Hoare triple {35089#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35089#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:08,681 INFO L273 TraceCheckUtils]: 92: Hoare triple {35089#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {35090#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:08,682 INFO L273 TraceCheckUtils]: 93: Hoare triple {35090#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35090#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:08,682 INFO L273 TraceCheckUtils]: 94: Hoare triple {35090#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35090#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:08,683 INFO L273 TraceCheckUtils]: 95: Hoare triple {35090#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {35091#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:08,684 INFO L273 TraceCheckUtils]: 96: Hoare triple {35091#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35091#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:08,684 INFO L273 TraceCheckUtils]: 97: Hoare triple {35091#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35091#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:08,685 INFO L273 TraceCheckUtils]: 98: Hoare triple {35091#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {35092#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:08,685 INFO L273 TraceCheckUtils]: 99: Hoare triple {35092#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35092#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:08,686 INFO L273 TraceCheckUtils]: 100: Hoare triple {35092#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35092#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:08,686 INFO L273 TraceCheckUtils]: 101: Hoare triple {35092#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {35093#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:08,687 INFO L273 TraceCheckUtils]: 102: Hoare triple {35093#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35093#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:08,687 INFO L273 TraceCheckUtils]: 103: Hoare triple {35093#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35093#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:08,688 INFO L273 TraceCheckUtils]: 104: Hoare triple {35093#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {35094#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:08,689 INFO L273 TraceCheckUtils]: 105: Hoare triple {35094#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35094#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:08,689 INFO L273 TraceCheckUtils]: 106: Hoare triple {35094#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35094#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:08,690 INFO L273 TraceCheckUtils]: 107: Hoare triple {35094#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {35095#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:08,690 INFO L273 TraceCheckUtils]: 108: Hoare triple {35095#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35095#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:08,691 INFO L273 TraceCheckUtils]: 109: Hoare triple {35095#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35095#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:08,691 INFO L273 TraceCheckUtils]: 110: Hoare triple {35095#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {35096#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:08,692 INFO L273 TraceCheckUtils]: 111: Hoare triple {35096#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35096#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:08,692 INFO L273 TraceCheckUtils]: 112: Hoare triple {35096#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35096#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:08,693 INFO L273 TraceCheckUtils]: 113: Hoare triple {35096#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {35097#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:08,694 INFO L273 TraceCheckUtils]: 114: Hoare triple {35097#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35097#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:08,694 INFO L273 TraceCheckUtils]: 115: Hoare triple {35097#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35097#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:08,695 INFO L273 TraceCheckUtils]: 116: Hoare triple {35097#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {35098#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:08,695 INFO L273 TraceCheckUtils]: 117: Hoare triple {35098#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35098#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:08,696 INFO L273 TraceCheckUtils]: 118: Hoare triple {35098#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35098#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:08,697 INFO L273 TraceCheckUtils]: 119: Hoare triple {35098#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {35099#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:08,697 INFO L273 TraceCheckUtils]: 120: Hoare triple {35099#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35099#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:08,698 INFO L273 TraceCheckUtils]: 121: Hoare triple {35099#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35099#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:08,698 INFO L273 TraceCheckUtils]: 122: Hoare triple {35099#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {35100#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:08,699 INFO L273 TraceCheckUtils]: 123: Hoare triple {35100#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35100#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:08,699 INFO L273 TraceCheckUtils]: 124: Hoare triple {35100#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35100#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:08,700 INFO L273 TraceCheckUtils]: 125: Hoare triple {35100#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {35101#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:08,700 INFO L273 TraceCheckUtils]: 126: Hoare triple {35101#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35101#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:08,701 INFO L273 TraceCheckUtils]: 127: Hoare triple {35101#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35101#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:08,702 INFO L273 TraceCheckUtils]: 128: Hoare triple {35101#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {35102#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:08,702 INFO L273 TraceCheckUtils]: 129: Hoare triple {35102#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35102#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:08,703 INFO L273 TraceCheckUtils]: 130: Hoare triple {35102#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35102#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:08,703 INFO L273 TraceCheckUtils]: 131: Hoare triple {35102#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {35103#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:08,704 INFO L273 TraceCheckUtils]: 132: Hoare triple {35103#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35103#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:08,704 INFO L273 TraceCheckUtils]: 133: Hoare triple {35103#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35103#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:08,705 INFO L273 TraceCheckUtils]: 134: Hoare triple {35103#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {35104#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:08,706 INFO L273 TraceCheckUtils]: 135: Hoare triple {35104#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35104#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:08,706 INFO L273 TraceCheckUtils]: 136: Hoare triple {35104#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35104#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:08,707 INFO L273 TraceCheckUtils]: 137: Hoare triple {35104#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {35105#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:08,707 INFO L273 TraceCheckUtils]: 138: Hoare triple {35105#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35105#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:08,708 INFO L273 TraceCheckUtils]: 139: Hoare triple {35105#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35105#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:08,708 INFO L273 TraceCheckUtils]: 140: Hoare triple {35105#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {35106#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:08,709 INFO L273 TraceCheckUtils]: 141: Hoare triple {35106#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35106#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:08,709 INFO L273 TraceCheckUtils]: 142: Hoare triple {35106#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35106#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:08,710 INFO L273 TraceCheckUtils]: 143: Hoare triple {35106#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {35107#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:08,711 INFO L273 TraceCheckUtils]: 144: Hoare triple {35107#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35107#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:08,711 INFO L273 TraceCheckUtils]: 145: Hoare triple {35107#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35107#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:08,712 INFO L273 TraceCheckUtils]: 146: Hoare triple {35107#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {35108#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:08,712 INFO L273 TraceCheckUtils]: 147: Hoare triple {35108#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35108#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:08,713 INFO L273 TraceCheckUtils]: 148: Hoare triple {35108#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35108#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:08,714 INFO L273 TraceCheckUtils]: 149: Hoare triple {35108#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {35109#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:08,714 INFO L273 TraceCheckUtils]: 150: Hoare triple {35109#(<= main_~i~0 48)} assume !(~i~0 < 100000); {35060#false} is VALID [2018-11-23 11:57:08,714 INFO L273 TraceCheckUtils]: 151: Hoare triple {35060#false} havoc ~x~0;~x~0 := 0; {35060#false} is VALID [2018-11-23 11:57:08,715 INFO L273 TraceCheckUtils]: 152: Hoare triple {35060#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {35060#false} is VALID [2018-11-23 11:57:08,715 INFO L256 TraceCheckUtils]: 153: Hoare triple {35060#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {35060#false} is VALID [2018-11-23 11:57:08,715 INFO L273 TraceCheckUtils]: 154: Hoare triple {35060#false} ~cond := #in~cond; {35060#false} is VALID [2018-11-23 11:57:08,715 INFO L273 TraceCheckUtils]: 155: Hoare triple {35060#false} assume 0 == ~cond; {35060#false} is VALID [2018-11-23 11:57:08,715 INFO L273 TraceCheckUtils]: 156: Hoare triple {35060#false} assume !false; {35060#false} is VALID [2018-11-23 11:57:08,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 0 proven. 3432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:08,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:08,732 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:08,741 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:57:09,064 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-11-23 11:57:09,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:57:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:09,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:09,933 INFO L256 TraceCheckUtils]: 0: Hoare triple {35059#true} call ULTIMATE.init(); {35059#true} is VALID [2018-11-23 11:57:09,934 INFO L273 TraceCheckUtils]: 1: Hoare triple {35059#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35059#true} is VALID [2018-11-23 11:57:09,934 INFO L273 TraceCheckUtils]: 2: Hoare triple {35059#true} assume true; {35059#true} is VALID [2018-11-23 11:57:09,934 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35059#true} {35059#true} #55#return; {35059#true} is VALID [2018-11-23 11:57:09,934 INFO L256 TraceCheckUtils]: 4: Hoare triple {35059#true} call #t~ret4 := main(); {35059#true} is VALID [2018-11-23 11:57:09,935 INFO L273 TraceCheckUtils]: 5: Hoare triple {35059#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {35128#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:09,935 INFO L273 TraceCheckUtils]: 6: Hoare triple {35128#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35128#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:09,936 INFO L273 TraceCheckUtils]: 7: Hoare triple {35128#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35128#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:09,936 INFO L273 TraceCheckUtils]: 8: Hoare triple {35128#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {35062#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:09,936 INFO L273 TraceCheckUtils]: 9: Hoare triple {35062#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35062#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:09,937 INFO L273 TraceCheckUtils]: 10: Hoare triple {35062#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35062#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:09,937 INFO L273 TraceCheckUtils]: 11: Hoare triple {35062#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {35063#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:09,938 INFO L273 TraceCheckUtils]: 12: Hoare triple {35063#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35063#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:09,938 INFO L273 TraceCheckUtils]: 13: Hoare triple {35063#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35063#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:09,939 INFO L273 TraceCheckUtils]: 14: Hoare triple {35063#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {35064#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:09,939 INFO L273 TraceCheckUtils]: 15: Hoare triple {35064#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35064#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:09,940 INFO L273 TraceCheckUtils]: 16: Hoare triple {35064#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35064#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:09,941 INFO L273 TraceCheckUtils]: 17: Hoare triple {35064#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {35065#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:09,941 INFO L273 TraceCheckUtils]: 18: Hoare triple {35065#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35065#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:09,942 INFO L273 TraceCheckUtils]: 19: Hoare triple {35065#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35065#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:09,942 INFO L273 TraceCheckUtils]: 20: Hoare triple {35065#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {35066#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:09,943 INFO L273 TraceCheckUtils]: 21: Hoare triple {35066#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35066#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:09,943 INFO L273 TraceCheckUtils]: 22: Hoare triple {35066#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35066#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:09,944 INFO L273 TraceCheckUtils]: 23: Hoare triple {35066#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {35067#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:09,945 INFO L273 TraceCheckUtils]: 24: Hoare triple {35067#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35067#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:09,945 INFO L273 TraceCheckUtils]: 25: Hoare triple {35067#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35067#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:09,946 INFO L273 TraceCheckUtils]: 26: Hoare triple {35067#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {35068#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:09,946 INFO L273 TraceCheckUtils]: 27: Hoare triple {35068#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35068#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:09,947 INFO L273 TraceCheckUtils]: 28: Hoare triple {35068#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35068#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:09,947 INFO L273 TraceCheckUtils]: 29: Hoare triple {35068#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {35069#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:09,948 INFO L273 TraceCheckUtils]: 30: Hoare triple {35069#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35069#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:09,948 INFO L273 TraceCheckUtils]: 31: Hoare triple {35069#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35069#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:09,949 INFO L273 TraceCheckUtils]: 32: Hoare triple {35069#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {35070#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:09,950 INFO L273 TraceCheckUtils]: 33: Hoare triple {35070#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35070#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:09,950 INFO L273 TraceCheckUtils]: 34: Hoare triple {35070#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35070#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:09,951 INFO L273 TraceCheckUtils]: 35: Hoare triple {35070#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {35071#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:09,951 INFO L273 TraceCheckUtils]: 36: Hoare triple {35071#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35071#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:09,952 INFO L273 TraceCheckUtils]: 37: Hoare triple {35071#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35071#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:09,952 INFO L273 TraceCheckUtils]: 38: Hoare triple {35071#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {35072#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:09,953 INFO L273 TraceCheckUtils]: 39: Hoare triple {35072#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35072#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:09,953 INFO L273 TraceCheckUtils]: 40: Hoare triple {35072#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35072#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:09,954 INFO L273 TraceCheckUtils]: 41: Hoare triple {35072#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {35073#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:09,955 INFO L273 TraceCheckUtils]: 42: Hoare triple {35073#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35073#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:09,955 INFO L273 TraceCheckUtils]: 43: Hoare triple {35073#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35073#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:09,956 INFO L273 TraceCheckUtils]: 44: Hoare triple {35073#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {35074#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:09,956 INFO L273 TraceCheckUtils]: 45: Hoare triple {35074#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35074#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:09,957 INFO L273 TraceCheckUtils]: 46: Hoare triple {35074#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35074#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:09,958 INFO L273 TraceCheckUtils]: 47: Hoare triple {35074#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {35075#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:09,958 INFO L273 TraceCheckUtils]: 48: Hoare triple {35075#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35075#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:09,959 INFO L273 TraceCheckUtils]: 49: Hoare triple {35075#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35075#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:09,959 INFO L273 TraceCheckUtils]: 50: Hoare triple {35075#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {35076#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:09,960 INFO L273 TraceCheckUtils]: 51: Hoare triple {35076#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35076#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:09,960 INFO L273 TraceCheckUtils]: 52: Hoare triple {35076#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35076#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:09,961 INFO L273 TraceCheckUtils]: 53: Hoare triple {35076#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {35077#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:09,961 INFO L273 TraceCheckUtils]: 54: Hoare triple {35077#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35077#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:09,962 INFO L273 TraceCheckUtils]: 55: Hoare triple {35077#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35077#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:09,963 INFO L273 TraceCheckUtils]: 56: Hoare triple {35077#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {35078#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:09,963 INFO L273 TraceCheckUtils]: 57: Hoare triple {35078#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35078#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:09,964 INFO L273 TraceCheckUtils]: 58: Hoare triple {35078#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35078#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:09,964 INFO L273 TraceCheckUtils]: 59: Hoare triple {35078#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {35079#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:09,965 INFO L273 TraceCheckUtils]: 60: Hoare triple {35079#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35079#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:09,965 INFO L273 TraceCheckUtils]: 61: Hoare triple {35079#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35079#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:09,966 INFO L273 TraceCheckUtils]: 62: Hoare triple {35079#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {35080#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:09,967 INFO L273 TraceCheckUtils]: 63: Hoare triple {35080#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35080#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:09,967 INFO L273 TraceCheckUtils]: 64: Hoare triple {35080#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35080#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:09,968 INFO L273 TraceCheckUtils]: 65: Hoare triple {35080#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {35081#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:09,968 INFO L273 TraceCheckUtils]: 66: Hoare triple {35081#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35081#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:09,969 INFO L273 TraceCheckUtils]: 67: Hoare triple {35081#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35081#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:09,969 INFO L273 TraceCheckUtils]: 68: Hoare triple {35081#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {35082#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:09,970 INFO L273 TraceCheckUtils]: 69: Hoare triple {35082#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35082#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:09,970 INFO L273 TraceCheckUtils]: 70: Hoare triple {35082#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35082#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:09,971 INFO L273 TraceCheckUtils]: 71: Hoare triple {35082#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {35083#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:09,972 INFO L273 TraceCheckUtils]: 72: Hoare triple {35083#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35083#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:09,972 INFO L273 TraceCheckUtils]: 73: Hoare triple {35083#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35083#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:09,973 INFO L273 TraceCheckUtils]: 74: Hoare triple {35083#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {35084#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:09,973 INFO L273 TraceCheckUtils]: 75: Hoare triple {35084#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35084#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:09,974 INFO L273 TraceCheckUtils]: 76: Hoare triple {35084#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35084#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:09,975 INFO L273 TraceCheckUtils]: 77: Hoare triple {35084#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {35085#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:09,975 INFO L273 TraceCheckUtils]: 78: Hoare triple {35085#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35085#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:09,976 INFO L273 TraceCheckUtils]: 79: Hoare triple {35085#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35085#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:09,976 INFO L273 TraceCheckUtils]: 80: Hoare triple {35085#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {35086#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:09,977 INFO L273 TraceCheckUtils]: 81: Hoare triple {35086#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35086#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:09,977 INFO L273 TraceCheckUtils]: 82: Hoare triple {35086#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35086#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:09,978 INFO L273 TraceCheckUtils]: 83: Hoare triple {35086#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {35087#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:09,978 INFO L273 TraceCheckUtils]: 84: Hoare triple {35087#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35087#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:09,979 INFO L273 TraceCheckUtils]: 85: Hoare triple {35087#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35087#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:09,980 INFO L273 TraceCheckUtils]: 86: Hoare triple {35087#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {35088#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:09,980 INFO L273 TraceCheckUtils]: 87: Hoare triple {35088#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35088#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:09,981 INFO L273 TraceCheckUtils]: 88: Hoare triple {35088#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35088#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:09,981 INFO L273 TraceCheckUtils]: 89: Hoare triple {35088#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {35089#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:09,982 INFO L273 TraceCheckUtils]: 90: Hoare triple {35089#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35089#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:09,982 INFO L273 TraceCheckUtils]: 91: Hoare triple {35089#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35089#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:09,983 INFO L273 TraceCheckUtils]: 92: Hoare triple {35089#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {35090#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:09,984 INFO L273 TraceCheckUtils]: 93: Hoare triple {35090#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35090#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:09,984 INFO L273 TraceCheckUtils]: 94: Hoare triple {35090#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35090#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:09,985 INFO L273 TraceCheckUtils]: 95: Hoare triple {35090#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {35091#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:09,985 INFO L273 TraceCheckUtils]: 96: Hoare triple {35091#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35091#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:09,986 INFO L273 TraceCheckUtils]: 97: Hoare triple {35091#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35091#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:09,986 INFO L273 TraceCheckUtils]: 98: Hoare triple {35091#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {35092#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:09,987 INFO L273 TraceCheckUtils]: 99: Hoare triple {35092#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35092#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:09,987 INFO L273 TraceCheckUtils]: 100: Hoare triple {35092#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35092#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:09,988 INFO L273 TraceCheckUtils]: 101: Hoare triple {35092#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {35093#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:09,989 INFO L273 TraceCheckUtils]: 102: Hoare triple {35093#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35093#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:09,989 INFO L273 TraceCheckUtils]: 103: Hoare triple {35093#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35093#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:09,990 INFO L273 TraceCheckUtils]: 104: Hoare triple {35093#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {35094#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:09,990 INFO L273 TraceCheckUtils]: 105: Hoare triple {35094#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35094#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:09,991 INFO L273 TraceCheckUtils]: 106: Hoare triple {35094#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35094#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:09,992 INFO L273 TraceCheckUtils]: 107: Hoare triple {35094#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {35095#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:09,992 INFO L273 TraceCheckUtils]: 108: Hoare triple {35095#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35095#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:09,993 INFO L273 TraceCheckUtils]: 109: Hoare triple {35095#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35095#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:09,993 INFO L273 TraceCheckUtils]: 110: Hoare triple {35095#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {35096#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:09,994 INFO L273 TraceCheckUtils]: 111: Hoare triple {35096#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35096#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:09,994 INFO L273 TraceCheckUtils]: 112: Hoare triple {35096#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35096#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:09,995 INFO L273 TraceCheckUtils]: 113: Hoare triple {35096#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {35097#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:09,996 INFO L273 TraceCheckUtils]: 114: Hoare triple {35097#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35097#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:09,996 INFO L273 TraceCheckUtils]: 115: Hoare triple {35097#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35097#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:09,997 INFO L273 TraceCheckUtils]: 116: Hoare triple {35097#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {35098#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:09,997 INFO L273 TraceCheckUtils]: 117: Hoare triple {35098#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35098#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:09,998 INFO L273 TraceCheckUtils]: 118: Hoare triple {35098#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35098#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:09,998 INFO L273 TraceCheckUtils]: 119: Hoare triple {35098#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {35099#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:09,999 INFO L273 TraceCheckUtils]: 120: Hoare triple {35099#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35099#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:09,999 INFO L273 TraceCheckUtils]: 121: Hoare triple {35099#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35099#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:10,000 INFO L273 TraceCheckUtils]: 122: Hoare triple {35099#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {35100#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:10,001 INFO L273 TraceCheckUtils]: 123: Hoare triple {35100#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35100#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:10,001 INFO L273 TraceCheckUtils]: 124: Hoare triple {35100#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35100#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:10,002 INFO L273 TraceCheckUtils]: 125: Hoare triple {35100#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {35101#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:10,002 INFO L273 TraceCheckUtils]: 126: Hoare triple {35101#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35101#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:10,003 INFO L273 TraceCheckUtils]: 127: Hoare triple {35101#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35101#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:10,004 INFO L273 TraceCheckUtils]: 128: Hoare triple {35101#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {35102#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:10,004 INFO L273 TraceCheckUtils]: 129: Hoare triple {35102#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35102#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:10,005 INFO L273 TraceCheckUtils]: 130: Hoare triple {35102#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35102#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:10,005 INFO L273 TraceCheckUtils]: 131: Hoare triple {35102#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {35103#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:10,006 INFO L273 TraceCheckUtils]: 132: Hoare triple {35103#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35103#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:10,006 INFO L273 TraceCheckUtils]: 133: Hoare triple {35103#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35103#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:10,007 INFO L273 TraceCheckUtils]: 134: Hoare triple {35103#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {35104#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:10,007 INFO L273 TraceCheckUtils]: 135: Hoare triple {35104#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35104#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:10,008 INFO L273 TraceCheckUtils]: 136: Hoare triple {35104#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35104#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:10,009 INFO L273 TraceCheckUtils]: 137: Hoare triple {35104#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {35105#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:10,009 INFO L273 TraceCheckUtils]: 138: Hoare triple {35105#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35105#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:10,010 INFO L273 TraceCheckUtils]: 139: Hoare triple {35105#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35105#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:10,010 INFO L273 TraceCheckUtils]: 140: Hoare triple {35105#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {35106#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:10,011 INFO L273 TraceCheckUtils]: 141: Hoare triple {35106#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35106#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:10,011 INFO L273 TraceCheckUtils]: 142: Hoare triple {35106#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35106#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:10,012 INFO L273 TraceCheckUtils]: 143: Hoare triple {35106#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {35107#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:10,013 INFO L273 TraceCheckUtils]: 144: Hoare triple {35107#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35107#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:10,013 INFO L273 TraceCheckUtils]: 145: Hoare triple {35107#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35107#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:10,014 INFO L273 TraceCheckUtils]: 146: Hoare triple {35107#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {35108#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:10,014 INFO L273 TraceCheckUtils]: 147: Hoare triple {35108#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35108#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:10,015 INFO L273 TraceCheckUtils]: 148: Hoare triple {35108#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {35108#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:10,015 INFO L273 TraceCheckUtils]: 149: Hoare triple {35108#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {35109#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:10,016 INFO L273 TraceCheckUtils]: 150: Hoare triple {35109#(<= main_~i~0 48)} assume !(~i~0 < 100000); {35060#false} is VALID [2018-11-23 11:57:10,016 INFO L273 TraceCheckUtils]: 151: Hoare triple {35060#false} havoc ~x~0;~x~0 := 0; {35060#false} is VALID [2018-11-23 11:57:10,017 INFO L273 TraceCheckUtils]: 152: Hoare triple {35060#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {35060#false} is VALID [2018-11-23 11:57:10,017 INFO L256 TraceCheckUtils]: 153: Hoare triple {35060#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {35060#false} is VALID [2018-11-23 11:57:10,017 INFO L273 TraceCheckUtils]: 154: Hoare triple {35060#false} ~cond := #in~cond; {35060#false} is VALID [2018-11-23 11:57:10,017 INFO L273 TraceCheckUtils]: 155: Hoare triple {35060#false} assume 0 == ~cond; {35060#false} is VALID [2018-11-23 11:57:10,017 INFO L273 TraceCheckUtils]: 156: Hoare triple {35060#false} assume !false; {35060#false} is VALID [2018-11-23 11:57:10,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 0 proven. 3432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:10,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:10,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 52 [2018-11-23 11:57:10,053 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 157 [2018-11-23 11:57:10,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:10,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states. [2018-11-23 11:57:10,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:10,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-23 11:57:10,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-23 11:57:10,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 11:57:10,236 INFO L87 Difference]: Start difference. First operand 162 states and 211 transitions. Second operand 52 states. [2018-11-23 11:57:11,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:11,260 INFO L93 Difference]: Finished difference Result 178 states and 230 transitions. [2018-11-23 11:57:11,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-23 11:57:11,260 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 157 [2018-11-23 11:57:11,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:11,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 11:57:11,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 230 transitions. [2018-11-23 11:57:11,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 11:57:11,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 230 transitions. [2018-11-23 11:57:11,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 230 transitions. [2018-11-23 11:57:11,478 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:11,482 INFO L225 Difference]: With dead ends: 178 [2018-11-23 11:57:11,482 INFO L226 Difference]: Without dead ends: 167 [2018-11-23 11:57:11,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 11:57:11,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-23 11:57:11,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-11-23 11:57:11,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:11,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand 165 states. [2018-11-23 11:57:11,530 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand 165 states. [2018-11-23 11:57:11,530 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 165 states. [2018-11-23 11:57:11,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:11,532 INFO L93 Difference]: Finished difference Result 167 states and 218 transitions. [2018-11-23 11:57:11,532 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 218 transitions. [2018-11-23 11:57:11,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:11,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:11,533 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 167 states. [2018-11-23 11:57:11,533 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 167 states. [2018-11-23 11:57:11,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:11,535 INFO L93 Difference]: Finished difference Result 167 states and 218 transitions. [2018-11-23 11:57:11,535 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 218 transitions. [2018-11-23 11:57:11,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:11,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:11,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:11,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:11,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-23 11:57:11,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 215 transitions. [2018-11-23 11:57:11,537 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 215 transitions. Word has length 157 [2018-11-23 11:57:11,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:11,538 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 215 transitions. [2018-11-23 11:57:11,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-23 11:57:11,538 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 215 transitions. [2018-11-23 11:57:11,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-23 11:57:11,538 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:11,538 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:11,539 INFO L423 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:11,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:11,539 INFO L82 PathProgramCache]: Analyzing trace with hash 821723875, now seen corresponding path program 49 times [2018-11-23 11:57:11,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:11,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:11,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:11,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:11,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:12,705 INFO L256 TraceCheckUtils]: 0: Hoare triple {36375#true} call ULTIMATE.init(); {36375#true} is VALID [2018-11-23 11:57:12,706 INFO L273 TraceCheckUtils]: 1: Hoare triple {36375#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36375#true} is VALID [2018-11-23 11:57:12,706 INFO L273 TraceCheckUtils]: 2: Hoare triple {36375#true} assume true; {36375#true} is VALID [2018-11-23 11:57:12,706 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36375#true} {36375#true} #55#return; {36375#true} is VALID [2018-11-23 11:57:12,706 INFO L256 TraceCheckUtils]: 4: Hoare triple {36375#true} call #t~ret4 := main(); {36375#true} is VALID [2018-11-23 11:57:12,707 INFO L273 TraceCheckUtils]: 5: Hoare triple {36375#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {36377#(= main_~i~0 0)} is VALID [2018-11-23 11:57:12,707 INFO L273 TraceCheckUtils]: 6: Hoare triple {36377#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36377#(= main_~i~0 0)} is VALID [2018-11-23 11:57:12,708 INFO L273 TraceCheckUtils]: 7: Hoare triple {36377#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36377#(= main_~i~0 0)} is VALID [2018-11-23 11:57:12,708 INFO L273 TraceCheckUtils]: 8: Hoare triple {36377#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {36378#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:12,708 INFO L273 TraceCheckUtils]: 9: Hoare triple {36378#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36378#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:12,709 INFO L273 TraceCheckUtils]: 10: Hoare triple {36378#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36378#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:12,709 INFO L273 TraceCheckUtils]: 11: Hoare triple {36378#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {36379#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:12,709 INFO L273 TraceCheckUtils]: 12: Hoare triple {36379#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36379#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:12,710 INFO L273 TraceCheckUtils]: 13: Hoare triple {36379#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36379#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:12,710 INFO L273 TraceCheckUtils]: 14: Hoare triple {36379#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {36380#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:12,710 INFO L273 TraceCheckUtils]: 15: Hoare triple {36380#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36380#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:12,711 INFO L273 TraceCheckUtils]: 16: Hoare triple {36380#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36380#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:12,712 INFO L273 TraceCheckUtils]: 17: Hoare triple {36380#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {36381#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:12,712 INFO L273 TraceCheckUtils]: 18: Hoare triple {36381#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36381#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:12,713 INFO L273 TraceCheckUtils]: 19: Hoare triple {36381#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36381#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:12,713 INFO L273 TraceCheckUtils]: 20: Hoare triple {36381#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {36382#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:12,714 INFO L273 TraceCheckUtils]: 21: Hoare triple {36382#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36382#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:12,714 INFO L273 TraceCheckUtils]: 22: Hoare triple {36382#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36382#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:12,715 INFO L273 TraceCheckUtils]: 23: Hoare triple {36382#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {36383#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:12,716 INFO L273 TraceCheckUtils]: 24: Hoare triple {36383#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36383#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:12,716 INFO L273 TraceCheckUtils]: 25: Hoare triple {36383#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36383#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:12,717 INFO L273 TraceCheckUtils]: 26: Hoare triple {36383#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {36384#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:12,717 INFO L273 TraceCheckUtils]: 27: Hoare triple {36384#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36384#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:12,718 INFO L273 TraceCheckUtils]: 28: Hoare triple {36384#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36384#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:12,718 INFO L273 TraceCheckUtils]: 29: Hoare triple {36384#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {36385#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:12,719 INFO L273 TraceCheckUtils]: 30: Hoare triple {36385#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36385#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:12,719 INFO L273 TraceCheckUtils]: 31: Hoare triple {36385#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36385#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:12,720 INFO L273 TraceCheckUtils]: 32: Hoare triple {36385#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {36386#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:12,721 INFO L273 TraceCheckUtils]: 33: Hoare triple {36386#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36386#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:12,721 INFO L273 TraceCheckUtils]: 34: Hoare triple {36386#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36386#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:12,722 INFO L273 TraceCheckUtils]: 35: Hoare triple {36386#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {36387#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:12,722 INFO L273 TraceCheckUtils]: 36: Hoare triple {36387#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36387#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:12,723 INFO L273 TraceCheckUtils]: 37: Hoare triple {36387#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36387#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:12,724 INFO L273 TraceCheckUtils]: 38: Hoare triple {36387#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {36388#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:12,724 INFO L273 TraceCheckUtils]: 39: Hoare triple {36388#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36388#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:12,724 INFO L273 TraceCheckUtils]: 40: Hoare triple {36388#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36388#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:12,725 INFO L273 TraceCheckUtils]: 41: Hoare triple {36388#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {36389#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:12,726 INFO L273 TraceCheckUtils]: 42: Hoare triple {36389#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36389#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:12,726 INFO L273 TraceCheckUtils]: 43: Hoare triple {36389#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36389#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:12,727 INFO L273 TraceCheckUtils]: 44: Hoare triple {36389#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {36390#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:12,727 INFO L273 TraceCheckUtils]: 45: Hoare triple {36390#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36390#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:12,728 INFO L273 TraceCheckUtils]: 46: Hoare triple {36390#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36390#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:12,729 INFO L273 TraceCheckUtils]: 47: Hoare triple {36390#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {36391#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:12,729 INFO L273 TraceCheckUtils]: 48: Hoare triple {36391#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36391#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:12,730 INFO L273 TraceCheckUtils]: 49: Hoare triple {36391#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36391#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:12,730 INFO L273 TraceCheckUtils]: 50: Hoare triple {36391#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {36392#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:12,731 INFO L273 TraceCheckUtils]: 51: Hoare triple {36392#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36392#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:12,731 INFO L273 TraceCheckUtils]: 52: Hoare triple {36392#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36392#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:12,732 INFO L273 TraceCheckUtils]: 53: Hoare triple {36392#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {36393#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:12,733 INFO L273 TraceCheckUtils]: 54: Hoare triple {36393#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36393#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:12,733 INFO L273 TraceCheckUtils]: 55: Hoare triple {36393#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36393#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:12,734 INFO L273 TraceCheckUtils]: 56: Hoare triple {36393#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {36394#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:12,734 INFO L273 TraceCheckUtils]: 57: Hoare triple {36394#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36394#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:12,735 INFO L273 TraceCheckUtils]: 58: Hoare triple {36394#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36394#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:12,735 INFO L273 TraceCheckUtils]: 59: Hoare triple {36394#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {36395#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:12,736 INFO L273 TraceCheckUtils]: 60: Hoare triple {36395#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36395#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:12,736 INFO L273 TraceCheckUtils]: 61: Hoare triple {36395#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36395#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:12,737 INFO L273 TraceCheckUtils]: 62: Hoare triple {36395#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {36396#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:12,738 INFO L273 TraceCheckUtils]: 63: Hoare triple {36396#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36396#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:12,738 INFO L273 TraceCheckUtils]: 64: Hoare triple {36396#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36396#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:12,739 INFO L273 TraceCheckUtils]: 65: Hoare triple {36396#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {36397#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:12,739 INFO L273 TraceCheckUtils]: 66: Hoare triple {36397#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36397#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:12,740 INFO L273 TraceCheckUtils]: 67: Hoare triple {36397#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36397#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:12,741 INFO L273 TraceCheckUtils]: 68: Hoare triple {36397#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {36398#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:12,741 INFO L273 TraceCheckUtils]: 69: Hoare triple {36398#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36398#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:12,742 INFO L273 TraceCheckUtils]: 70: Hoare triple {36398#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36398#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:12,742 INFO L273 TraceCheckUtils]: 71: Hoare triple {36398#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {36399#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:12,743 INFO L273 TraceCheckUtils]: 72: Hoare triple {36399#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36399#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:12,743 INFO L273 TraceCheckUtils]: 73: Hoare triple {36399#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36399#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:12,744 INFO L273 TraceCheckUtils]: 74: Hoare triple {36399#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {36400#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:12,745 INFO L273 TraceCheckUtils]: 75: Hoare triple {36400#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36400#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:12,745 INFO L273 TraceCheckUtils]: 76: Hoare triple {36400#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36400#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:12,746 INFO L273 TraceCheckUtils]: 77: Hoare triple {36400#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {36401#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:12,746 INFO L273 TraceCheckUtils]: 78: Hoare triple {36401#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36401#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:12,747 INFO L273 TraceCheckUtils]: 79: Hoare triple {36401#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36401#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:12,747 INFO L273 TraceCheckUtils]: 80: Hoare triple {36401#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {36402#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:12,748 INFO L273 TraceCheckUtils]: 81: Hoare triple {36402#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36402#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:12,748 INFO L273 TraceCheckUtils]: 82: Hoare triple {36402#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36402#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:12,749 INFO L273 TraceCheckUtils]: 83: Hoare triple {36402#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {36403#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:12,750 INFO L273 TraceCheckUtils]: 84: Hoare triple {36403#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36403#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:12,750 INFO L273 TraceCheckUtils]: 85: Hoare triple {36403#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36403#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:12,751 INFO L273 TraceCheckUtils]: 86: Hoare triple {36403#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {36404#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:12,751 INFO L273 TraceCheckUtils]: 87: Hoare triple {36404#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36404#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:12,752 INFO L273 TraceCheckUtils]: 88: Hoare triple {36404#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36404#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:12,752 INFO L273 TraceCheckUtils]: 89: Hoare triple {36404#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {36405#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:12,753 INFO L273 TraceCheckUtils]: 90: Hoare triple {36405#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36405#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:12,753 INFO L273 TraceCheckUtils]: 91: Hoare triple {36405#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36405#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:12,754 INFO L273 TraceCheckUtils]: 92: Hoare triple {36405#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {36406#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:12,755 INFO L273 TraceCheckUtils]: 93: Hoare triple {36406#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36406#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:12,755 INFO L273 TraceCheckUtils]: 94: Hoare triple {36406#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36406#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:12,756 INFO L273 TraceCheckUtils]: 95: Hoare triple {36406#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {36407#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:12,756 INFO L273 TraceCheckUtils]: 96: Hoare triple {36407#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36407#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:12,757 INFO L273 TraceCheckUtils]: 97: Hoare triple {36407#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36407#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:12,758 INFO L273 TraceCheckUtils]: 98: Hoare triple {36407#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {36408#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:12,758 INFO L273 TraceCheckUtils]: 99: Hoare triple {36408#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36408#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:12,759 INFO L273 TraceCheckUtils]: 100: Hoare triple {36408#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36408#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:12,759 INFO L273 TraceCheckUtils]: 101: Hoare triple {36408#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {36409#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:12,760 INFO L273 TraceCheckUtils]: 102: Hoare triple {36409#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36409#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:12,760 INFO L273 TraceCheckUtils]: 103: Hoare triple {36409#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36409#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:12,761 INFO L273 TraceCheckUtils]: 104: Hoare triple {36409#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {36410#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:12,762 INFO L273 TraceCheckUtils]: 105: Hoare triple {36410#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36410#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:12,762 INFO L273 TraceCheckUtils]: 106: Hoare triple {36410#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36410#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:12,763 INFO L273 TraceCheckUtils]: 107: Hoare triple {36410#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {36411#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:12,763 INFO L273 TraceCheckUtils]: 108: Hoare triple {36411#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36411#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:12,764 INFO L273 TraceCheckUtils]: 109: Hoare triple {36411#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36411#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:12,764 INFO L273 TraceCheckUtils]: 110: Hoare triple {36411#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {36412#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:12,765 INFO L273 TraceCheckUtils]: 111: Hoare triple {36412#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36412#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:12,765 INFO L273 TraceCheckUtils]: 112: Hoare triple {36412#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36412#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:12,766 INFO L273 TraceCheckUtils]: 113: Hoare triple {36412#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {36413#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:12,767 INFO L273 TraceCheckUtils]: 114: Hoare triple {36413#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36413#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:12,767 INFO L273 TraceCheckUtils]: 115: Hoare triple {36413#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36413#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:12,768 INFO L273 TraceCheckUtils]: 116: Hoare triple {36413#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {36414#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:12,768 INFO L273 TraceCheckUtils]: 117: Hoare triple {36414#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36414#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:12,769 INFO L273 TraceCheckUtils]: 118: Hoare triple {36414#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36414#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:12,769 INFO L273 TraceCheckUtils]: 119: Hoare triple {36414#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {36415#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:12,770 INFO L273 TraceCheckUtils]: 120: Hoare triple {36415#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36415#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:12,770 INFO L273 TraceCheckUtils]: 121: Hoare triple {36415#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36415#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:12,771 INFO L273 TraceCheckUtils]: 122: Hoare triple {36415#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {36416#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:12,772 INFO L273 TraceCheckUtils]: 123: Hoare triple {36416#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36416#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:12,772 INFO L273 TraceCheckUtils]: 124: Hoare triple {36416#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36416#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:12,773 INFO L273 TraceCheckUtils]: 125: Hoare triple {36416#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {36417#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:12,773 INFO L273 TraceCheckUtils]: 126: Hoare triple {36417#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36417#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:12,774 INFO L273 TraceCheckUtils]: 127: Hoare triple {36417#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36417#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:12,775 INFO L273 TraceCheckUtils]: 128: Hoare triple {36417#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {36418#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:12,775 INFO L273 TraceCheckUtils]: 129: Hoare triple {36418#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36418#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:12,776 INFO L273 TraceCheckUtils]: 130: Hoare triple {36418#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36418#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:12,776 INFO L273 TraceCheckUtils]: 131: Hoare triple {36418#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {36419#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:12,777 INFO L273 TraceCheckUtils]: 132: Hoare triple {36419#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36419#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:12,777 INFO L273 TraceCheckUtils]: 133: Hoare triple {36419#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36419#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:12,778 INFO L273 TraceCheckUtils]: 134: Hoare triple {36419#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {36420#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:12,778 INFO L273 TraceCheckUtils]: 135: Hoare triple {36420#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36420#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:12,779 INFO L273 TraceCheckUtils]: 136: Hoare triple {36420#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36420#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:12,780 INFO L273 TraceCheckUtils]: 137: Hoare triple {36420#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {36421#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:12,780 INFO L273 TraceCheckUtils]: 138: Hoare triple {36421#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36421#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:12,781 INFO L273 TraceCheckUtils]: 139: Hoare triple {36421#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36421#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:12,781 INFO L273 TraceCheckUtils]: 140: Hoare triple {36421#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {36422#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:12,782 INFO L273 TraceCheckUtils]: 141: Hoare triple {36422#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36422#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:12,782 INFO L273 TraceCheckUtils]: 142: Hoare triple {36422#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36422#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:12,783 INFO L273 TraceCheckUtils]: 143: Hoare triple {36422#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {36423#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:12,784 INFO L273 TraceCheckUtils]: 144: Hoare triple {36423#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36423#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:12,784 INFO L273 TraceCheckUtils]: 145: Hoare triple {36423#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36423#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:12,785 INFO L273 TraceCheckUtils]: 146: Hoare triple {36423#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {36424#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:12,785 INFO L273 TraceCheckUtils]: 147: Hoare triple {36424#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36424#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:12,786 INFO L273 TraceCheckUtils]: 148: Hoare triple {36424#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36424#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:12,787 INFO L273 TraceCheckUtils]: 149: Hoare triple {36424#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {36425#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:12,787 INFO L273 TraceCheckUtils]: 150: Hoare triple {36425#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36425#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:12,787 INFO L273 TraceCheckUtils]: 151: Hoare triple {36425#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36425#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:12,788 INFO L273 TraceCheckUtils]: 152: Hoare triple {36425#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {36426#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:12,789 INFO L273 TraceCheckUtils]: 153: Hoare triple {36426#(<= main_~i~0 49)} assume !(~i~0 < 100000); {36376#false} is VALID [2018-11-23 11:57:12,789 INFO L273 TraceCheckUtils]: 154: Hoare triple {36376#false} havoc ~x~0;~x~0 := 0; {36376#false} is VALID [2018-11-23 11:57:12,789 INFO L273 TraceCheckUtils]: 155: Hoare triple {36376#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {36376#false} is VALID [2018-11-23 11:57:12,789 INFO L256 TraceCheckUtils]: 156: Hoare triple {36376#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {36376#false} is VALID [2018-11-23 11:57:12,790 INFO L273 TraceCheckUtils]: 157: Hoare triple {36376#false} ~cond := #in~cond; {36376#false} is VALID [2018-11-23 11:57:12,790 INFO L273 TraceCheckUtils]: 158: Hoare triple {36376#false} assume 0 == ~cond; {36376#false} is VALID [2018-11-23 11:57:12,790 INFO L273 TraceCheckUtils]: 159: Hoare triple {36376#false} assume !false; {36376#false} is VALID [2018-11-23 11:57:12,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 0 proven. 3577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:12,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:12,808 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:12,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:57:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:12,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:13,335 INFO L256 TraceCheckUtils]: 0: Hoare triple {36375#true} call ULTIMATE.init(); {36375#true} is VALID [2018-11-23 11:57:13,335 INFO L273 TraceCheckUtils]: 1: Hoare triple {36375#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36375#true} is VALID [2018-11-23 11:57:13,335 INFO L273 TraceCheckUtils]: 2: Hoare triple {36375#true} assume true; {36375#true} is VALID [2018-11-23 11:57:13,335 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36375#true} {36375#true} #55#return; {36375#true} is VALID [2018-11-23 11:57:13,336 INFO L256 TraceCheckUtils]: 4: Hoare triple {36375#true} call #t~ret4 := main(); {36375#true} is VALID [2018-11-23 11:57:13,336 INFO L273 TraceCheckUtils]: 5: Hoare triple {36375#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {36445#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:13,337 INFO L273 TraceCheckUtils]: 6: Hoare triple {36445#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36445#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:13,337 INFO L273 TraceCheckUtils]: 7: Hoare triple {36445#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36445#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:13,338 INFO L273 TraceCheckUtils]: 8: Hoare triple {36445#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {36378#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:13,338 INFO L273 TraceCheckUtils]: 9: Hoare triple {36378#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36378#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:13,338 INFO L273 TraceCheckUtils]: 10: Hoare triple {36378#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36378#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:13,339 INFO L273 TraceCheckUtils]: 11: Hoare triple {36378#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {36379#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:13,339 INFO L273 TraceCheckUtils]: 12: Hoare triple {36379#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36379#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:13,340 INFO L273 TraceCheckUtils]: 13: Hoare triple {36379#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36379#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:13,340 INFO L273 TraceCheckUtils]: 14: Hoare triple {36379#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {36380#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:13,341 INFO L273 TraceCheckUtils]: 15: Hoare triple {36380#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36380#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:13,341 INFO L273 TraceCheckUtils]: 16: Hoare triple {36380#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36380#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:13,342 INFO L273 TraceCheckUtils]: 17: Hoare triple {36380#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {36381#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:13,342 INFO L273 TraceCheckUtils]: 18: Hoare triple {36381#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36381#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:13,343 INFO L273 TraceCheckUtils]: 19: Hoare triple {36381#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36381#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:13,344 INFO L273 TraceCheckUtils]: 20: Hoare triple {36381#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {36382#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:13,344 INFO L273 TraceCheckUtils]: 21: Hoare triple {36382#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36382#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:13,345 INFO L273 TraceCheckUtils]: 22: Hoare triple {36382#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36382#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:13,345 INFO L273 TraceCheckUtils]: 23: Hoare triple {36382#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {36383#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:13,346 INFO L273 TraceCheckUtils]: 24: Hoare triple {36383#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36383#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:13,346 INFO L273 TraceCheckUtils]: 25: Hoare triple {36383#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36383#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:13,347 INFO L273 TraceCheckUtils]: 26: Hoare triple {36383#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {36384#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:13,348 INFO L273 TraceCheckUtils]: 27: Hoare triple {36384#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36384#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:13,348 INFO L273 TraceCheckUtils]: 28: Hoare triple {36384#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36384#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:13,349 INFO L273 TraceCheckUtils]: 29: Hoare triple {36384#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {36385#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:13,349 INFO L273 TraceCheckUtils]: 30: Hoare triple {36385#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36385#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:13,350 INFO L273 TraceCheckUtils]: 31: Hoare triple {36385#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36385#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:13,350 INFO L273 TraceCheckUtils]: 32: Hoare triple {36385#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {36386#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:13,351 INFO L273 TraceCheckUtils]: 33: Hoare triple {36386#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36386#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:13,351 INFO L273 TraceCheckUtils]: 34: Hoare triple {36386#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36386#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:13,352 INFO L273 TraceCheckUtils]: 35: Hoare triple {36386#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {36387#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:13,353 INFO L273 TraceCheckUtils]: 36: Hoare triple {36387#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36387#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:13,353 INFO L273 TraceCheckUtils]: 37: Hoare triple {36387#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36387#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:13,354 INFO L273 TraceCheckUtils]: 38: Hoare triple {36387#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {36388#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:13,354 INFO L273 TraceCheckUtils]: 39: Hoare triple {36388#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36388#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:13,355 INFO L273 TraceCheckUtils]: 40: Hoare triple {36388#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36388#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:13,356 INFO L273 TraceCheckUtils]: 41: Hoare triple {36388#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {36389#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:13,356 INFO L273 TraceCheckUtils]: 42: Hoare triple {36389#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36389#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:13,357 INFO L273 TraceCheckUtils]: 43: Hoare triple {36389#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36389#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:13,357 INFO L273 TraceCheckUtils]: 44: Hoare triple {36389#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {36390#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:13,358 INFO L273 TraceCheckUtils]: 45: Hoare triple {36390#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36390#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:13,358 INFO L273 TraceCheckUtils]: 46: Hoare triple {36390#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36390#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:13,359 INFO L273 TraceCheckUtils]: 47: Hoare triple {36390#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {36391#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:13,359 INFO L273 TraceCheckUtils]: 48: Hoare triple {36391#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36391#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:13,360 INFO L273 TraceCheckUtils]: 49: Hoare triple {36391#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36391#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:13,361 INFO L273 TraceCheckUtils]: 50: Hoare triple {36391#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {36392#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:13,361 INFO L273 TraceCheckUtils]: 51: Hoare triple {36392#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36392#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:13,361 INFO L273 TraceCheckUtils]: 52: Hoare triple {36392#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36392#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:13,362 INFO L273 TraceCheckUtils]: 53: Hoare triple {36392#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {36393#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:13,363 INFO L273 TraceCheckUtils]: 54: Hoare triple {36393#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36393#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:13,363 INFO L273 TraceCheckUtils]: 55: Hoare triple {36393#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36393#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:13,364 INFO L273 TraceCheckUtils]: 56: Hoare triple {36393#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {36394#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:13,364 INFO L273 TraceCheckUtils]: 57: Hoare triple {36394#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36394#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:13,365 INFO L273 TraceCheckUtils]: 58: Hoare triple {36394#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36394#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:13,365 INFO L273 TraceCheckUtils]: 59: Hoare triple {36394#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {36395#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:13,366 INFO L273 TraceCheckUtils]: 60: Hoare triple {36395#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36395#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:13,366 INFO L273 TraceCheckUtils]: 61: Hoare triple {36395#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36395#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:13,367 INFO L273 TraceCheckUtils]: 62: Hoare triple {36395#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {36396#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:13,368 INFO L273 TraceCheckUtils]: 63: Hoare triple {36396#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36396#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:13,368 INFO L273 TraceCheckUtils]: 64: Hoare triple {36396#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36396#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:13,369 INFO L273 TraceCheckUtils]: 65: Hoare triple {36396#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {36397#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:13,369 INFO L273 TraceCheckUtils]: 66: Hoare triple {36397#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36397#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:13,370 INFO L273 TraceCheckUtils]: 67: Hoare triple {36397#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36397#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:13,370 INFO L273 TraceCheckUtils]: 68: Hoare triple {36397#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {36398#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:13,371 INFO L273 TraceCheckUtils]: 69: Hoare triple {36398#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36398#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:13,371 INFO L273 TraceCheckUtils]: 70: Hoare triple {36398#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36398#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:13,372 INFO L273 TraceCheckUtils]: 71: Hoare triple {36398#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {36399#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:13,373 INFO L273 TraceCheckUtils]: 72: Hoare triple {36399#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36399#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:13,373 INFO L273 TraceCheckUtils]: 73: Hoare triple {36399#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36399#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:13,374 INFO L273 TraceCheckUtils]: 74: Hoare triple {36399#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {36400#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:13,374 INFO L273 TraceCheckUtils]: 75: Hoare triple {36400#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36400#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:13,375 INFO L273 TraceCheckUtils]: 76: Hoare triple {36400#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36400#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:13,375 INFO L273 TraceCheckUtils]: 77: Hoare triple {36400#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {36401#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:13,376 INFO L273 TraceCheckUtils]: 78: Hoare triple {36401#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36401#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:13,376 INFO L273 TraceCheckUtils]: 79: Hoare triple {36401#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36401#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:13,377 INFO L273 TraceCheckUtils]: 80: Hoare triple {36401#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {36402#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:13,378 INFO L273 TraceCheckUtils]: 81: Hoare triple {36402#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36402#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:13,378 INFO L273 TraceCheckUtils]: 82: Hoare triple {36402#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36402#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:13,379 INFO L273 TraceCheckUtils]: 83: Hoare triple {36402#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {36403#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:13,379 INFO L273 TraceCheckUtils]: 84: Hoare triple {36403#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36403#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:13,380 INFO L273 TraceCheckUtils]: 85: Hoare triple {36403#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36403#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:13,380 INFO L273 TraceCheckUtils]: 86: Hoare triple {36403#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {36404#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:13,381 INFO L273 TraceCheckUtils]: 87: Hoare triple {36404#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36404#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:13,381 INFO L273 TraceCheckUtils]: 88: Hoare triple {36404#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36404#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:13,382 INFO L273 TraceCheckUtils]: 89: Hoare triple {36404#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {36405#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:13,383 INFO L273 TraceCheckUtils]: 90: Hoare triple {36405#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36405#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:13,383 INFO L273 TraceCheckUtils]: 91: Hoare triple {36405#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36405#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:13,384 INFO L273 TraceCheckUtils]: 92: Hoare triple {36405#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {36406#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:13,384 INFO L273 TraceCheckUtils]: 93: Hoare triple {36406#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36406#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:13,385 INFO L273 TraceCheckUtils]: 94: Hoare triple {36406#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36406#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:13,385 INFO L273 TraceCheckUtils]: 95: Hoare triple {36406#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {36407#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:13,386 INFO L273 TraceCheckUtils]: 96: Hoare triple {36407#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36407#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:13,386 INFO L273 TraceCheckUtils]: 97: Hoare triple {36407#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36407#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:13,387 INFO L273 TraceCheckUtils]: 98: Hoare triple {36407#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {36408#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:13,388 INFO L273 TraceCheckUtils]: 99: Hoare triple {36408#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36408#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:13,388 INFO L273 TraceCheckUtils]: 100: Hoare triple {36408#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36408#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:13,389 INFO L273 TraceCheckUtils]: 101: Hoare triple {36408#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {36409#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:13,389 INFO L273 TraceCheckUtils]: 102: Hoare triple {36409#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36409#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:13,390 INFO L273 TraceCheckUtils]: 103: Hoare triple {36409#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36409#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:13,391 INFO L273 TraceCheckUtils]: 104: Hoare triple {36409#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {36410#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:13,391 INFO L273 TraceCheckUtils]: 105: Hoare triple {36410#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36410#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:13,392 INFO L273 TraceCheckUtils]: 106: Hoare triple {36410#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36410#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:13,392 INFO L273 TraceCheckUtils]: 107: Hoare triple {36410#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {36411#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:13,393 INFO L273 TraceCheckUtils]: 108: Hoare triple {36411#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36411#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:13,393 INFO L273 TraceCheckUtils]: 109: Hoare triple {36411#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36411#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:13,394 INFO L273 TraceCheckUtils]: 110: Hoare triple {36411#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {36412#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:13,394 INFO L273 TraceCheckUtils]: 111: Hoare triple {36412#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36412#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:13,395 INFO L273 TraceCheckUtils]: 112: Hoare triple {36412#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36412#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:13,396 INFO L273 TraceCheckUtils]: 113: Hoare triple {36412#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {36413#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:13,396 INFO L273 TraceCheckUtils]: 114: Hoare triple {36413#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36413#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:13,397 INFO L273 TraceCheckUtils]: 115: Hoare triple {36413#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36413#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:13,397 INFO L273 TraceCheckUtils]: 116: Hoare triple {36413#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {36414#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:13,398 INFO L273 TraceCheckUtils]: 117: Hoare triple {36414#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36414#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:13,398 INFO L273 TraceCheckUtils]: 118: Hoare triple {36414#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36414#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:13,399 INFO L273 TraceCheckUtils]: 119: Hoare triple {36414#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {36415#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:13,400 INFO L273 TraceCheckUtils]: 120: Hoare triple {36415#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36415#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:13,400 INFO L273 TraceCheckUtils]: 121: Hoare triple {36415#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36415#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:13,401 INFO L273 TraceCheckUtils]: 122: Hoare triple {36415#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {36416#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:13,401 INFO L273 TraceCheckUtils]: 123: Hoare triple {36416#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36416#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:13,402 INFO L273 TraceCheckUtils]: 124: Hoare triple {36416#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36416#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:13,402 INFO L273 TraceCheckUtils]: 125: Hoare triple {36416#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {36417#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:13,403 INFO L273 TraceCheckUtils]: 126: Hoare triple {36417#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36417#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:13,403 INFO L273 TraceCheckUtils]: 127: Hoare triple {36417#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36417#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:13,404 INFO L273 TraceCheckUtils]: 128: Hoare triple {36417#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {36418#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:13,405 INFO L273 TraceCheckUtils]: 129: Hoare triple {36418#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36418#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:13,405 INFO L273 TraceCheckUtils]: 130: Hoare triple {36418#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36418#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:13,406 INFO L273 TraceCheckUtils]: 131: Hoare triple {36418#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {36419#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:13,406 INFO L273 TraceCheckUtils]: 132: Hoare triple {36419#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36419#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:13,407 INFO L273 TraceCheckUtils]: 133: Hoare triple {36419#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36419#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:13,408 INFO L273 TraceCheckUtils]: 134: Hoare triple {36419#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {36420#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:13,408 INFO L273 TraceCheckUtils]: 135: Hoare triple {36420#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36420#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:13,409 INFO L273 TraceCheckUtils]: 136: Hoare triple {36420#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36420#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:13,409 INFO L273 TraceCheckUtils]: 137: Hoare triple {36420#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {36421#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:13,410 INFO L273 TraceCheckUtils]: 138: Hoare triple {36421#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36421#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:13,410 INFO L273 TraceCheckUtils]: 139: Hoare triple {36421#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36421#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:13,411 INFO L273 TraceCheckUtils]: 140: Hoare triple {36421#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {36422#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:13,411 INFO L273 TraceCheckUtils]: 141: Hoare triple {36422#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36422#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:13,412 INFO L273 TraceCheckUtils]: 142: Hoare triple {36422#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36422#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:13,413 INFO L273 TraceCheckUtils]: 143: Hoare triple {36422#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {36423#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:13,413 INFO L273 TraceCheckUtils]: 144: Hoare triple {36423#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36423#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:13,414 INFO L273 TraceCheckUtils]: 145: Hoare triple {36423#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36423#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:13,414 INFO L273 TraceCheckUtils]: 146: Hoare triple {36423#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {36424#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:13,415 INFO L273 TraceCheckUtils]: 147: Hoare triple {36424#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36424#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:13,415 INFO L273 TraceCheckUtils]: 148: Hoare triple {36424#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36424#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:13,416 INFO L273 TraceCheckUtils]: 149: Hoare triple {36424#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {36425#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:13,417 INFO L273 TraceCheckUtils]: 150: Hoare triple {36425#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36425#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:13,417 INFO L273 TraceCheckUtils]: 151: Hoare triple {36425#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {36425#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:13,418 INFO L273 TraceCheckUtils]: 152: Hoare triple {36425#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {36426#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:13,418 INFO L273 TraceCheckUtils]: 153: Hoare triple {36426#(<= main_~i~0 49)} assume !(~i~0 < 100000); {36376#false} is VALID [2018-11-23 11:57:13,419 INFO L273 TraceCheckUtils]: 154: Hoare triple {36376#false} havoc ~x~0;~x~0 := 0; {36376#false} is VALID [2018-11-23 11:57:13,419 INFO L273 TraceCheckUtils]: 155: Hoare triple {36376#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {36376#false} is VALID [2018-11-23 11:57:13,419 INFO L256 TraceCheckUtils]: 156: Hoare triple {36376#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {36376#false} is VALID [2018-11-23 11:57:13,419 INFO L273 TraceCheckUtils]: 157: Hoare triple {36376#false} ~cond := #in~cond; {36376#false} is VALID [2018-11-23 11:57:13,419 INFO L273 TraceCheckUtils]: 158: Hoare triple {36376#false} assume 0 == ~cond; {36376#false} is VALID [2018-11-23 11:57:13,419 INFO L273 TraceCheckUtils]: 159: Hoare triple {36376#false} assume !false; {36376#false} is VALID [2018-11-23 11:57:13,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 0 proven. 3577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:13,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:13,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2018-11-23 11:57:13,456 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 160 [2018-11-23 11:57:13,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:13,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states. [2018-11-23 11:57:13,615 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:13,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-23 11:57:13,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-23 11:57:13,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-11-23 11:57:13,616 INFO L87 Difference]: Start difference. First operand 165 states and 215 transitions. Second operand 53 states. [2018-11-23 11:57:14,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:14,683 INFO L93 Difference]: Finished difference Result 181 states and 234 transitions. [2018-11-23 11:57:14,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-23 11:57:14,684 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 160 [2018-11-23 11:57:14,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:14,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 11:57:14,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 234 transitions. [2018-11-23 11:57:14,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 11:57:14,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 234 transitions. [2018-11-23 11:57:14,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 234 transitions. [2018-11-23 11:57:14,906 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:14,909 INFO L225 Difference]: With dead ends: 181 [2018-11-23 11:57:14,910 INFO L226 Difference]: Without dead ends: 170 [2018-11-23 11:57:14,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-11-23 11:57:14,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-11-23 11:57:14,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2018-11-23 11:57:14,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:14,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand 168 states. [2018-11-23 11:57:14,949 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand 168 states. [2018-11-23 11:57:14,949 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 168 states. [2018-11-23 11:57:14,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:14,951 INFO L93 Difference]: Finished difference Result 170 states and 222 transitions. [2018-11-23 11:57:14,951 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 222 transitions. [2018-11-23 11:57:14,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:14,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:14,952 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand 170 states. [2018-11-23 11:57:14,952 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 170 states. [2018-11-23 11:57:14,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:14,954 INFO L93 Difference]: Finished difference Result 170 states and 222 transitions. [2018-11-23 11:57:14,954 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 222 transitions. [2018-11-23 11:57:14,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:14,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:14,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:14,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:14,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-23 11:57:14,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 219 transitions. [2018-11-23 11:57:14,956 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 219 transitions. Word has length 160 [2018-11-23 11:57:14,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:14,957 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 219 transitions. [2018-11-23 11:57:14,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-23 11:57:14,957 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 219 transitions. [2018-11-23 11:57:14,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-23 11:57:14,957 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:14,958 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:14,958 INFO L423 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:14,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:14,958 INFO L82 PathProgramCache]: Analyzing trace with hash 2002706041, now seen corresponding path program 50 times [2018-11-23 11:57:14,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:14,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:14,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:14,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:57:14,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:16,421 INFO L256 TraceCheckUtils]: 0: Hoare triple {37715#true} call ULTIMATE.init(); {37715#true} is VALID [2018-11-23 11:57:16,422 INFO L273 TraceCheckUtils]: 1: Hoare triple {37715#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37715#true} is VALID [2018-11-23 11:57:16,422 INFO L273 TraceCheckUtils]: 2: Hoare triple {37715#true} assume true; {37715#true} is VALID [2018-11-23 11:57:16,422 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37715#true} {37715#true} #55#return; {37715#true} is VALID [2018-11-23 11:57:16,422 INFO L256 TraceCheckUtils]: 4: Hoare triple {37715#true} call #t~ret4 := main(); {37715#true} is VALID [2018-11-23 11:57:16,423 INFO L273 TraceCheckUtils]: 5: Hoare triple {37715#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {37717#(= main_~i~0 0)} is VALID [2018-11-23 11:57:16,423 INFO L273 TraceCheckUtils]: 6: Hoare triple {37717#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37717#(= main_~i~0 0)} is VALID [2018-11-23 11:57:16,424 INFO L273 TraceCheckUtils]: 7: Hoare triple {37717#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37717#(= main_~i~0 0)} is VALID [2018-11-23 11:57:16,424 INFO L273 TraceCheckUtils]: 8: Hoare triple {37717#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {37718#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:16,424 INFO L273 TraceCheckUtils]: 9: Hoare triple {37718#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37718#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:16,425 INFO L273 TraceCheckUtils]: 10: Hoare triple {37718#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37718#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:16,425 INFO L273 TraceCheckUtils]: 11: Hoare triple {37718#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {37719#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:16,425 INFO L273 TraceCheckUtils]: 12: Hoare triple {37719#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37719#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:16,426 INFO L273 TraceCheckUtils]: 13: Hoare triple {37719#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37719#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:16,426 INFO L273 TraceCheckUtils]: 14: Hoare triple {37719#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {37720#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:16,427 INFO L273 TraceCheckUtils]: 15: Hoare triple {37720#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37720#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:16,427 INFO L273 TraceCheckUtils]: 16: Hoare triple {37720#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37720#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:16,428 INFO L273 TraceCheckUtils]: 17: Hoare triple {37720#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {37721#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:16,428 INFO L273 TraceCheckUtils]: 18: Hoare triple {37721#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37721#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:16,429 INFO L273 TraceCheckUtils]: 19: Hoare triple {37721#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37721#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:16,429 INFO L273 TraceCheckUtils]: 20: Hoare triple {37721#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {37722#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:16,430 INFO L273 TraceCheckUtils]: 21: Hoare triple {37722#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37722#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:16,430 INFO L273 TraceCheckUtils]: 22: Hoare triple {37722#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37722#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:16,431 INFO L273 TraceCheckUtils]: 23: Hoare triple {37722#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {37723#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:16,432 INFO L273 TraceCheckUtils]: 24: Hoare triple {37723#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37723#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:16,432 INFO L273 TraceCheckUtils]: 25: Hoare triple {37723#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37723#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:16,433 INFO L273 TraceCheckUtils]: 26: Hoare triple {37723#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {37724#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:16,433 INFO L273 TraceCheckUtils]: 27: Hoare triple {37724#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37724#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:16,434 INFO L273 TraceCheckUtils]: 28: Hoare triple {37724#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37724#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:16,434 INFO L273 TraceCheckUtils]: 29: Hoare triple {37724#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {37725#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:16,435 INFO L273 TraceCheckUtils]: 30: Hoare triple {37725#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37725#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:16,435 INFO L273 TraceCheckUtils]: 31: Hoare triple {37725#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37725#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:16,436 INFO L273 TraceCheckUtils]: 32: Hoare triple {37725#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {37726#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:16,437 INFO L273 TraceCheckUtils]: 33: Hoare triple {37726#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37726#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:16,437 INFO L273 TraceCheckUtils]: 34: Hoare triple {37726#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37726#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:16,438 INFO L273 TraceCheckUtils]: 35: Hoare triple {37726#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {37727#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:16,438 INFO L273 TraceCheckUtils]: 36: Hoare triple {37727#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37727#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:16,439 INFO L273 TraceCheckUtils]: 37: Hoare triple {37727#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37727#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:16,440 INFO L273 TraceCheckUtils]: 38: Hoare triple {37727#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {37728#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:16,440 INFO L273 TraceCheckUtils]: 39: Hoare triple {37728#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37728#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:16,441 INFO L273 TraceCheckUtils]: 40: Hoare triple {37728#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37728#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:16,441 INFO L273 TraceCheckUtils]: 41: Hoare triple {37728#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {37729#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:16,442 INFO L273 TraceCheckUtils]: 42: Hoare triple {37729#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37729#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:16,442 INFO L273 TraceCheckUtils]: 43: Hoare triple {37729#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37729#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:16,443 INFO L273 TraceCheckUtils]: 44: Hoare triple {37729#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {37730#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:16,443 INFO L273 TraceCheckUtils]: 45: Hoare triple {37730#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37730#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:16,444 INFO L273 TraceCheckUtils]: 46: Hoare triple {37730#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37730#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:16,445 INFO L273 TraceCheckUtils]: 47: Hoare triple {37730#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {37731#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:16,445 INFO L273 TraceCheckUtils]: 48: Hoare triple {37731#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37731#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:16,446 INFO L273 TraceCheckUtils]: 49: Hoare triple {37731#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37731#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:16,446 INFO L273 TraceCheckUtils]: 50: Hoare triple {37731#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {37732#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:16,447 INFO L273 TraceCheckUtils]: 51: Hoare triple {37732#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37732#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:16,447 INFO L273 TraceCheckUtils]: 52: Hoare triple {37732#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37732#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:16,448 INFO L273 TraceCheckUtils]: 53: Hoare triple {37732#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {37733#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:16,449 INFO L273 TraceCheckUtils]: 54: Hoare triple {37733#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37733#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:16,449 INFO L273 TraceCheckUtils]: 55: Hoare triple {37733#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37733#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:16,450 INFO L273 TraceCheckUtils]: 56: Hoare triple {37733#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {37734#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:16,450 INFO L273 TraceCheckUtils]: 57: Hoare triple {37734#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37734#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:16,451 INFO L273 TraceCheckUtils]: 58: Hoare triple {37734#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37734#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:16,451 INFO L273 TraceCheckUtils]: 59: Hoare triple {37734#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {37735#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:16,452 INFO L273 TraceCheckUtils]: 60: Hoare triple {37735#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37735#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:16,452 INFO L273 TraceCheckUtils]: 61: Hoare triple {37735#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37735#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:16,453 INFO L273 TraceCheckUtils]: 62: Hoare triple {37735#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {37736#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:16,454 INFO L273 TraceCheckUtils]: 63: Hoare triple {37736#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37736#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:16,454 INFO L273 TraceCheckUtils]: 64: Hoare triple {37736#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37736#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:16,455 INFO L273 TraceCheckUtils]: 65: Hoare triple {37736#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {37737#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:16,455 INFO L273 TraceCheckUtils]: 66: Hoare triple {37737#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37737#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:16,456 INFO L273 TraceCheckUtils]: 67: Hoare triple {37737#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37737#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:16,457 INFO L273 TraceCheckUtils]: 68: Hoare triple {37737#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {37738#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:16,457 INFO L273 TraceCheckUtils]: 69: Hoare triple {37738#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37738#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:16,458 INFO L273 TraceCheckUtils]: 70: Hoare triple {37738#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37738#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:16,458 INFO L273 TraceCheckUtils]: 71: Hoare triple {37738#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {37739#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:16,459 INFO L273 TraceCheckUtils]: 72: Hoare triple {37739#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37739#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:16,459 INFO L273 TraceCheckUtils]: 73: Hoare triple {37739#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37739#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:16,460 INFO L273 TraceCheckUtils]: 74: Hoare triple {37739#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {37740#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:16,460 INFO L273 TraceCheckUtils]: 75: Hoare triple {37740#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37740#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:16,461 INFO L273 TraceCheckUtils]: 76: Hoare triple {37740#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37740#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:16,462 INFO L273 TraceCheckUtils]: 77: Hoare triple {37740#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {37741#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:16,462 INFO L273 TraceCheckUtils]: 78: Hoare triple {37741#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37741#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:16,463 INFO L273 TraceCheckUtils]: 79: Hoare triple {37741#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37741#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:16,463 INFO L273 TraceCheckUtils]: 80: Hoare triple {37741#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {37742#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:16,464 INFO L273 TraceCheckUtils]: 81: Hoare triple {37742#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37742#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:16,464 INFO L273 TraceCheckUtils]: 82: Hoare triple {37742#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37742#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:16,465 INFO L273 TraceCheckUtils]: 83: Hoare triple {37742#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {37743#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:16,466 INFO L273 TraceCheckUtils]: 84: Hoare triple {37743#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37743#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:16,466 INFO L273 TraceCheckUtils]: 85: Hoare triple {37743#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37743#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:16,467 INFO L273 TraceCheckUtils]: 86: Hoare triple {37743#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {37744#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:16,467 INFO L273 TraceCheckUtils]: 87: Hoare triple {37744#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37744#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:16,468 INFO L273 TraceCheckUtils]: 88: Hoare triple {37744#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37744#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:16,468 INFO L273 TraceCheckUtils]: 89: Hoare triple {37744#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {37745#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:16,469 INFO L273 TraceCheckUtils]: 90: Hoare triple {37745#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37745#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:16,469 INFO L273 TraceCheckUtils]: 91: Hoare triple {37745#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37745#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:16,470 INFO L273 TraceCheckUtils]: 92: Hoare triple {37745#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {37746#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:16,471 INFO L273 TraceCheckUtils]: 93: Hoare triple {37746#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37746#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:16,471 INFO L273 TraceCheckUtils]: 94: Hoare triple {37746#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37746#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:16,472 INFO L273 TraceCheckUtils]: 95: Hoare triple {37746#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {37747#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:16,472 INFO L273 TraceCheckUtils]: 96: Hoare triple {37747#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37747#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:16,473 INFO L273 TraceCheckUtils]: 97: Hoare triple {37747#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37747#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:16,473 INFO L273 TraceCheckUtils]: 98: Hoare triple {37747#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {37748#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:16,474 INFO L273 TraceCheckUtils]: 99: Hoare triple {37748#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37748#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:16,475 INFO L273 TraceCheckUtils]: 100: Hoare triple {37748#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37748#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:16,475 INFO L273 TraceCheckUtils]: 101: Hoare triple {37748#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {37749#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:16,476 INFO L273 TraceCheckUtils]: 102: Hoare triple {37749#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37749#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:16,476 INFO L273 TraceCheckUtils]: 103: Hoare triple {37749#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37749#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:16,477 INFO L273 TraceCheckUtils]: 104: Hoare triple {37749#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {37750#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:16,477 INFO L273 TraceCheckUtils]: 105: Hoare triple {37750#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37750#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:16,478 INFO L273 TraceCheckUtils]: 106: Hoare triple {37750#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37750#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:16,479 INFO L273 TraceCheckUtils]: 107: Hoare triple {37750#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {37751#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:16,479 INFO L273 TraceCheckUtils]: 108: Hoare triple {37751#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37751#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:16,480 INFO L273 TraceCheckUtils]: 109: Hoare triple {37751#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37751#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:16,480 INFO L273 TraceCheckUtils]: 110: Hoare triple {37751#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {37752#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:16,481 INFO L273 TraceCheckUtils]: 111: Hoare triple {37752#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37752#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:16,481 INFO L273 TraceCheckUtils]: 112: Hoare triple {37752#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37752#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:16,482 INFO L273 TraceCheckUtils]: 113: Hoare triple {37752#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {37753#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:16,482 INFO L273 TraceCheckUtils]: 114: Hoare triple {37753#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37753#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:16,483 INFO L273 TraceCheckUtils]: 115: Hoare triple {37753#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37753#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:16,484 INFO L273 TraceCheckUtils]: 116: Hoare triple {37753#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {37754#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:16,484 INFO L273 TraceCheckUtils]: 117: Hoare triple {37754#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37754#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:16,485 INFO L273 TraceCheckUtils]: 118: Hoare triple {37754#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37754#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:16,485 INFO L273 TraceCheckUtils]: 119: Hoare triple {37754#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {37755#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:16,486 INFO L273 TraceCheckUtils]: 120: Hoare triple {37755#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37755#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:16,486 INFO L273 TraceCheckUtils]: 121: Hoare triple {37755#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37755#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:16,487 INFO L273 TraceCheckUtils]: 122: Hoare triple {37755#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {37756#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:16,488 INFO L273 TraceCheckUtils]: 123: Hoare triple {37756#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37756#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:16,488 INFO L273 TraceCheckUtils]: 124: Hoare triple {37756#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37756#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:16,489 INFO L273 TraceCheckUtils]: 125: Hoare triple {37756#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {37757#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:16,489 INFO L273 TraceCheckUtils]: 126: Hoare triple {37757#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37757#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:16,490 INFO L273 TraceCheckUtils]: 127: Hoare triple {37757#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37757#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:16,491 INFO L273 TraceCheckUtils]: 128: Hoare triple {37757#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {37758#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:16,491 INFO L273 TraceCheckUtils]: 129: Hoare triple {37758#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37758#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:16,491 INFO L273 TraceCheckUtils]: 130: Hoare triple {37758#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37758#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:16,492 INFO L273 TraceCheckUtils]: 131: Hoare triple {37758#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {37759#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:16,493 INFO L273 TraceCheckUtils]: 132: Hoare triple {37759#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37759#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:16,493 INFO L273 TraceCheckUtils]: 133: Hoare triple {37759#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37759#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:16,494 INFO L273 TraceCheckUtils]: 134: Hoare triple {37759#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {37760#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:16,494 INFO L273 TraceCheckUtils]: 135: Hoare triple {37760#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37760#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:16,495 INFO L273 TraceCheckUtils]: 136: Hoare triple {37760#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37760#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:16,496 INFO L273 TraceCheckUtils]: 137: Hoare triple {37760#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {37761#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:16,496 INFO L273 TraceCheckUtils]: 138: Hoare triple {37761#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37761#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:16,497 INFO L273 TraceCheckUtils]: 139: Hoare triple {37761#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37761#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:16,497 INFO L273 TraceCheckUtils]: 140: Hoare triple {37761#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {37762#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:16,498 INFO L273 TraceCheckUtils]: 141: Hoare triple {37762#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37762#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:16,498 INFO L273 TraceCheckUtils]: 142: Hoare triple {37762#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37762#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:16,499 INFO L273 TraceCheckUtils]: 143: Hoare triple {37762#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {37763#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:16,500 INFO L273 TraceCheckUtils]: 144: Hoare triple {37763#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37763#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:16,500 INFO L273 TraceCheckUtils]: 145: Hoare triple {37763#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37763#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:16,501 INFO L273 TraceCheckUtils]: 146: Hoare triple {37763#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {37764#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:16,501 INFO L273 TraceCheckUtils]: 147: Hoare triple {37764#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37764#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:16,502 INFO L273 TraceCheckUtils]: 148: Hoare triple {37764#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37764#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:16,502 INFO L273 TraceCheckUtils]: 149: Hoare triple {37764#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {37765#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:16,503 INFO L273 TraceCheckUtils]: 150: Hoare triple {37765#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37765#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:16,503 INFO L273 TraceCheckUtils]: 151: Hoare triple {37765#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37765#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:16,504 INFO L273 TraceCheckUtils]: 152: Hoare triple {37765#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {37766#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:16,505 INFO L273 TraceCheckUtils]: 153: Hoare triple {37766#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37766#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:16,505 INFO L273 TraceCheckUtils]: 154: Hoare triple {37766#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37766#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:16,506 INFO L273 TraceCheckUtils]: 155: Hoare triple {37766#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {37767#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:16,506 INFO L273 TraceCheckUtils]: 156: Hoare triple {37767#(<= main_~i~0 50)} assume !(~i~0 < 100000); {37716#false} is VALID [2018-11-23 11:57:16,507 INFO L273 TraceCheckUtils]: 157: Hoare triple {37716#false} havoc ~x~0;~x~0 := 0; {37716#false} is VALID [2018-11-23 11:57:16,507 INFO L273 TraceCheckUtils]: 158: Hoare triple {37716#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {37716#false} is VALID [2018-11-23 11:57:16,507 INFO L256 TraceCheckUtils]: 159: Hoare triple {37716#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {37716#false} is VALID [2018-11-23 11:57:16,507 INFO L273 TraceCheckUtils]: 160: Hoare triple {37716#false} ~cond := #in~cond; {37716#false} is VALID [2018-11-23 11:57:16,507 INFO L273 TraceCheckUtils]: 161: Hoare triple {37716#false} assume 0 == ~cond; {37716#false} is VALID [2018-11-23 11:57:16,508 INFO L273 TraceCheckUtils]: 162: Hoare triple {37716#false} assume !false; {37716#false} is VALID [2018-11-23 11:57:16,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 0 proven. 3725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:16,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:16,525 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:16,534 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:57:16,603 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:57:16,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:57:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:16,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:17,105 INFO L256 TraceCheckUtils]: 0: Hoare triple {37715#true} call ULTIMATE.init(); {37715#true} is VALID [2018-11-23 11:57:17,105 INFO L273 TraceCheckUtils]: 1: Hoare triple {37715#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37715#true} is VALID [2018-11-23 11:57:17,106 INFO L273 TraceCheckUtils]: 2: Hoare triple {37715#true} assume true; {37715#true} is VALID [2018-11-23 11:57:17,106 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37715#true} {37715#true} #55#return; {37715#true} is VALID [2018-11-23 11:57:17,106 INFO L256 TraceCheckUtils]: 4: Hoare triple {37715#true} call #t~ret4 := main(); {37715#true} is VALID [2018-11-23 11:57:17,107 INFO L273 TraceCheckUtils]: 5: Hoare triple {37715#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {37786#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:17,107 INFO L273 TraceCheckUtils]: 6: Hoare triple {37786#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37786#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:17,107 INFO L273 TraceCheckUtils]: 7: Hoare triple {37786#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37786#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:17,108 INFO L273 TraceCheckUtils]: 8: Hoare triple {37786#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {37718#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:17,108 INFO L273 TraceCheckUtils]: 9: Hoare triple {37718#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37718#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:17,108 INFO L273 TraceCheckUtils]: 10: Hoare triple {37718#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37718#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:17,109 INFO L273 TraceCheckUtils]: 11: Hoare triple {37718#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {37719#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:17,109 INFO L273 TraceCheckUtils]: 12: Hoare triple {37719#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37719#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:17,109 INFO L273 TraceCheckUtils]: 13: Hoare triple {37719#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37719#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:17,110 INFO L273 TraceCheckUtils]: 14: Hoare triple {37719#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {37720#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:17,110 INFO L273 TraceCheckUtils]: 15: Hoare triple {37720#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37720#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:17,111 INFO L273 TraceCheckUtils]: 16: Hoare triple {37720#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37720#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:17,112 INFO L273 TraceCheckUtils]: 17: Hoare triple {37720#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {37721#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:17,112 INFO L273 TraceCheckUtils]: 18: Hoare triple {37721#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37721#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:17,113 INFO L273 TraceCheckUtils]: 19: Hoare triple {37721#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37721#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:17,113 INFO L273 TraceCheckUtils]: 20: Hoare triple {37721#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {37722#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:17,114 INFO L273 TraceCheckUtils]: 21: Hoare triple {37722#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37722#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:17,114 INFO L273 TraceCheckUtils]: 22: Hoare triple {37722#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37722#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:17,115 INFO L273 TraceCheckUtils]: 23: Hoare triple {37722#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {37723#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:17,116 INFO L273 TraceCheckUtils]: 24: Hoare triple {37723#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37723#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:17,116 INFO L273 TraceCheckUtils]: 25: Hoare triple {37723#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37723#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:17,117 INFO L273 TraceCheckUtils]: 26: Hoare triple {37723#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {37724#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:17,117 INFO L273 TraceCheckUtils]: 27: Hoare triple {37724#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37724#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:17,118 INFO L273 TraceCheckUtils]: 28: Hoare triple {37724#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37724#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:17,118 INFO L273 TraceCheckUtils]: 29: Hoare triple {37724#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {37725#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:17,119 INFO L273 TraceCheckUtils]: 30: Hoare triple {37725#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37725#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:17,119 INFO L273 TraceCheckUtils]: 31: Hoare triple {37725#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37725#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:17,120 INFO L273 TraceCheckUtils]: 32: Hoare triple {37725#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {37726#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:17,121 INFO L273 TraceCheckUtils]: 33: Hoare triple {37726#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37726#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:17,121 INFO L273 TraceCheckUtils]: 34: Hoare triple {37726#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37726#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:17,122 INFO L273 TraceCheckUtils]: 35: Hoare triple {37726#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {37727#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:17,122 INFO L273 TraceCheckUtils]: 36: Hoare triple {37727#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37727#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:17,123 INFO L273 TraceCheckUtils]: 37: Hoare triple {37727#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37727#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:17,124 INFO L273 TraceCheckUtils]: 38: Hoare triple {37727#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {37728#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:17,124 INFO L273 TraceCheckUtils]: 39: Hoare triple {37728#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37728#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:17,125 INFO L273 TraceCheckUtils]: 40: Hoare triple {37728#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37728#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:17,125 INFO L273 TraceCheckUtils]: 41: Hoare triple {37728#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {37729#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:17,126 INFO L273 TraceCheckUtils]: 42: Hoare triple {37729#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37729#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:17,126 INFO L273 TraceCheckUtils]: 43: Hoare triple {37729#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37729#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:17,127 INFO L273 TraceCheckUtils]: 44: Hoare triple {37729#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {37730#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:17,127 INFO L273 TraceCheckUtils]: 45: Hoare triple {37730#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37730#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:17,128 INFO L273 TraceCheckUtils]: 46: Hoare triple {37730#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37730#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:17,129 INFO L273 TraceCheckUtils]: 47: Hoare triple {37730#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {37731#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:17,129 INFO L273 TraceCheckUtils]: 48: Hoare triple {37731#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37731#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:17,130 INFO L273 TraceCheckUtils]: 49: Hoare triple {37731#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37731#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:17,130 INFO L273 TraceCheckUtils]: 50: Hoare triple {37731#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {37732#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:17,131 INFO L273 TraceCheckUtils]: 51: Hoare triple {37732#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37732#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:17,131 INFO L273 TraceCheckUtils]: 52: Hoare triple {37732#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37732#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:17,132 INFO L273 TraceCheckUtils]: 53: Hoare triple {37732#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {37733#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:17,133 INFO L273 TraceCheckUtils]: 54: Hoare triple {37733#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37733#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:17,133 INFO L273 TraceCheckUtils]: 55: Hoare triple {37733#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37733#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:17,134 INFO L273 TraceCheckUtils]: 56: Hoare triple {37733#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {37734#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:17,134 INFO L273 TraceCheckUtils]: 57: Hoare triple {37734#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37734#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:17,135 INFO L273 TraceCheckUtils]: 58: Hoare triple {37734#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37734#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:17,135 INFO L273 TraceCheckUtils]: 59: Hoare triple {37734#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {37735#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:17,136 INFO L273 TraceCheckUtils]: 60: Hoare triple {37735#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37735#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:17,136 INFO L273 TraceCheckUtils]: 61: Hoare triple {37735#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37735#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:17,137 INFO L273 TraceCheckUtils]: 62: Hoare triple {37735#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {37736#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:17,138 INFO L273 TraceCheckUtils]: 63: Hoare triple {37736#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37736#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:17,138 INFO L273 TraceCheckUtils]: 64: Hoare triple {37736#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37736#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:17,139 INFO L273 TraceCheckUtils]: 65: Hoare triple {37736#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {37737#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:17,139 INFO L273 TraceCheckUtils]: 66: Hoare triple {37737#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37737#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:17,140 INFO L273 TraceCheckUtils]: 67: Hoare triple {37737#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37737#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:17,141 INFO L273 TraceCheckUtils]: 68: Hoare triple {37737#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {37738#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:17,141 INFO L273 TraceCheckUtils]: 69: Hoare triple {37738#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37738#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:17,141 INFO L273 TraceCheckUtils]: 70: Hoare triple {37738#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37738#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:17,142 INFO L273 TraceCheckUtils]: 71: Hoare triple {37738#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {37739#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:17,143 INFO L273 TraceCheckUtils]: 72: Hoare triple {37739#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37739#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:17,143 INFO L273 TraceCheckUtils]: 73: Hoare triple {37739#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37739#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:17,144 INFO L273 TraceCheckUtils]: 74: Hoare triple {37739#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {37740#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:17,144 INFO L273 TraceCheckUtils]: 75: Hoare triple {37740#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37740#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:17,145 INFO L273 TraceCheckUtils]: 76: Hoare triple {37740#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37740#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:17,146 INFO L273 TraceCheckUtils]: 77: Hoare triple {37740#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {37741#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:17,146 INFO L273 TraceCheckUtils]: 78: Hoare triple {37741#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37741#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:17,147 INFO L273 TraceCheckUtils]: 79: Hoare triple {37741#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37741#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:17,147 INFO L273 TraceCheckUtils]: 80: Hoare triple {37741#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {37742#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:17,148 INFO L273 TraceCheckUtils]: 81: Hoare triple {37742#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37742#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:17,148 INFO L273 TraceCheckUtils]: 82: Hoare triple {37742#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37742#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:17,149 INFO L273 TraceCheckUtils]: 83: Hoare triple {37742#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {37743#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:17,150 INFO L273 TraceCheckUtils]: 84: Hoare triple {37743#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37743#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:17,150 INFO L273 TraceCheckUtils]: 85: Hoare triple {37743#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37743#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:17,151 INFO L273 TraceCheckUtils]: 86: Hoare triple {37743#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {37744#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:17,151 INFO L273 TraceCheckUtils]: 87: Hoare triple {37744#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37744#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:17,152 INFO L273 TraceCheckUtils]: 88: Hoare triple {37744#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37744#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:17,152 INFO L273 TraceCheckUtils]: 89: Hoare triple {37744#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {37745#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:17,153 INFO L273 TraceCheckUtils]: 90: Hoare triple {37745#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37745#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:17,153 INFO L273 TraceCheckUtils]: 91: Hoare triple {37745#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37745#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:17,154 INFO L273 TraceCheckUtils]: 92: Hoare triple {37745#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {37746#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:17,155 INFO L273 TraceCheckUtils]: 93: Hoare triple {37746#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37746#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:17,155 INFO L273 TraceCheckUtils]: 94: Hoare triple {37746#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37746#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:17,156 INFO L273 TraceCheckUtils]: 95: Hoare triple {37746#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {37747#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:17,156 INFO L273 TraceCheckUtils]: 96: Hoare triple {37747#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37747#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:17,157 INFO L273 TraceCheckUtils]: 97: Hoare triple {37747#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37747#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:17,157 INFO L273 TraceCheckUtils]: 98: Hoare triple {37747#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {37748#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:17,158 INFO L273 TraceCheckUtils]: 99: Hoare triple {37748#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37748#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:17,158 INFO L273 TraceCheckUtils]: 100: Hoare triple {37748#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37748#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:17,159 INFO L273 TraceCheckUtils]: 101: Hoare triple {37748#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {37749#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:17,160 INFO L273 TraceCheckUtils]: 102: Hoare triple {37749#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37749#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:17,160 INFO L273 TraceCheckUtils]: 103: Hoare triple {37749#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37749#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:17,161 INFO L273 TraceCheckUtils]: 104: Hoare triple {37749#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {37750#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:17,161 INFO L273 TraceCheckUtils]: 105: Hoare triple {37750#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37750#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:17,162 INFO L273 TraceCheckUtils]: 106: Hoare triple {37750#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37750#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:17,163 INFO L273 TraceCheckUtils]: 107: Hoare triple {37750#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {37751#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:17,163 INFO L273 TraceCheckUtils]: 108: Hoare triple {37751#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37751#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:17,164 INFO L273 TraceCheckUtils]: 109: Hoare triple {37751#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37751#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:17,164 INFO L273 TraceCheckUtils]: 110: Hoare triple {37751#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {37752#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:17,165 INFO L273 TraceCheckUtils]: 111: Hoare triple {37752#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37752#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:17,165 INFO L273 TraceCheckUtils]: 112: Hoare triple {37752#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37752#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:17,166 INFO L273 TraceCheckUtils]: 113: Hoare triple {37752#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {37753#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:17,166 INFO L273 TraceCheckUtils]: 114: Hoare triple {37753#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37753#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:17,167 INFO L273 TraceCheckUtils]: 115: Hoare triple {37753#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37753#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:17,168 INFO L273 TraceCheckUtils]: 116: Hoare triple {37753#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {37754#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:17,168 INFO L273 TraceCheckUtils]: 117: Hoare triple {37754#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37754#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:17,169 INFO L273 TraceCheckUtils]: 118: Hoare triple {37754#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37754#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:17,169 INFO L273 TraceCheckUtils]: 119: Hoare triple {37754#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {37755#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:17,170 INFO L273 TraceCheckUtils]: 120: Hoare triple {37755#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37755#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:17,170 INFO L273 TraceCheckUtils]: 121: Hoare triple {37755#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37755#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:17,171 INFO L273 TraceCheckUtils]: 122: Hoare triple {37755#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {37756#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:17,172 INFO L273 TraceCheckUtils]: 123: Hoare triple {37756#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37756#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:17,172 INFO L273 TraceCheckUtils]: 124: Hoare triple {37756#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37756#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:17,173 INFO L273 TraceCheckUtils]: 125: Hoare triple {37756#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {37757#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:17,173 INFO L273 TraceCheckUtils]: 126: Hoare triple {37757#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37757#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:17,174 INFO L273 TraceCheckUtils]: 127: Hoare triple {37757#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37757#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:17,175 INFO L273 TraceCheckUtils]: 128: Hoare triple {37757#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {37758#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:17,175 INFO L273 TraceCheckUtils]: 129: Hoare triple {37758#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37758#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:17,176 INFO L273 TraceCheckUtils]: 130: Hoare triple {37758#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37758#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:17,176 INFO L273 TraceCheckUtils]: 131: Hoare triple {37758#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {37759#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:17,177 INFO L273 TraceCheckUtils]: 132: Hoare triple {37759#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37759#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:17,177 INFO L273 TraceCheckUtils]: 133: Hoare triple {37759#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37759#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:17,178 INFO L273 TraceCheckUtils]: 134: Hoare triple {37759#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {37760#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:17,178 INFO L273 TraceCheckUtils]: 135: Hoare triple {37760#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37760#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:17,179 INFO L273 TraceCheckUtils]: 136: Hoare triple {37760#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37760#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:17,180 INFO L273 TraceCheckUtils]: 137: Hoare triple {37760#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {37761#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:17,180 INFO L273 TraceCheckUtils]: 138: Hoare triple {37761#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37761#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:17,181 INFO L273 TraceCheckUtils]: 139: Hoare triple {37761#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37761#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:17,181 INFO L273 TraceCheckUtils]: 140: Hoare triple {37761#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {37762#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:17,182 INFO L273 TraceCheckUtils]: 141: Hoare triple {37762#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37762#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:17,182 INFO L273 TraceCheckUtils]: 142: Hoare triple {37762#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37762#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:17,183 INFO L273 TraceCheckUtils]: 143: Hoare triple {37762#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {37763#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:17,184 INFO L273 TraceCheckUtils]: 144: Hoare triple {37763#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37763#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:17,184 INFO L273 TraceCheckUtils]: 145: Hoare triple {37763#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37763#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:17,185 INFO L273 TraceCheckUtils]: 146: Hoare triple {37763#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {37764#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:17,185 INFO L273 TraceCheckUtils]: 147: Hoare triple {37764#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37764#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:17,186 INFO L273 TraceCheckUtils]: 148: Hoare triple {37764#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37764#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:17,186 INFO L273 TraceCheckUtils]: 149: Hoare triple {37764#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {37765#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:17,187 INFO L273 TraceCheckUtils]: 150: Hoare triple {37765#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37765#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:17,187 INFO L273 TraceCheckUtils]: 151: Hoare triple {37765#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37765#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:17,188 INFO L273 TraceCheckUtils]: 152: Hoare triple {37765#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {37766#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:17,189 INFO L273 TraceCheckUtils]: 153: Hoare triple {37766#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37766#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:17,189 INFO L273 TraceCheckUtils]: 154: Hoare triple {37766#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {37766#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:17,190 INFO L273 TraceCheckUtils]: 155: Hoare triple {37766#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {37767#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:17,190 INFO L273 TraceCheckUtils]: 156: Hoare triple {37767#(<= main_~i~0 50)} assume !(~i~0 < 100000); {37716#false} is VALID [2018-11-23 11:57:17,191 INFO L273 TraceCheckUtils]: 157: Hoare triple {37716#false} havoc ~x~0;~x~0 := 0; {37716#false} is VALID [2018-11-23 11:57:17,191 INFO L273 TraceCheckUtils]: 158: Hoare triple {37716#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {37716#false} is VALID [2018-11-23 11:57:17,191 INFO L256 TraceCheckUtils]: 159: Hoare triple {37716#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {37716#false} is VALID [2018-11-23 11:57:17,191 INFO L273 TraceCheckUtils]: 160: Hoare triple {37716#false} ~cond := #in~cond; {37716#false} is VALID [2018-11-23 11:57:17,191 INFO L273 TraceCheckUtils]: 161: Hoare triple {37716#false} assume 0 == ~cond; {37716#false} is VALID [2018-11-23 11:57:17,192 INFO L273 TraceCheckUtils]: 162: Hoare triple {37716#false} assume !false; {37716#false} is VALID [2018-11-23 11:57:17,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 0 proven. 3725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:17,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:17,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2018-11-23 11:57:17,229 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 163 [2018-11-23 11:57:17,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:17,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states. [2018-11-23 11:57:17,391 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:17,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-23 11:57:17,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-23 11:57:17,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 11:57:17,393 INFO L87 Difference]: Start difference. First operand 168 states and 219 transitions. Second operand 54 states. [2018-11-23 11:57:18,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:18,072 INFO L93 Difference]: Finished difference Result 184 states and 238 transitions. [2018-11-23 11:57:18,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-23 11:57:18,072 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 163 [2018-11-23 11:57:18,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:18,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 11:57:18,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 238 transitions. [2018-11-23 11:57:18,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 11:57:18,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 238 transitions. [2018-11-23 11:57:18,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states and 238 transitions. [2018-11-23 11:57:18,299 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 11:57:18,303 INFO L225 Difference]: With dead ends: 184 [2018-11-23 11:57:18,304 INFO L226 Difference]: Without dead ends: 173 [2018-11-23 11:57:18,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 11:57:18,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-23 11:57:18,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2018-11-23 11:57:18,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:18,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand 171 states. [2018-11-23 11:57:18,355 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand 171 states. [2018-11-23 11:57:18,355 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 171 states. [2018-11-23 11:57:18,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:18,357 INFO L93 Difference]: Finished difference Result 173 states and 226 transitions. [2018-11-23 11:57:18,357 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 226 transitions. [2018-11-23 11:57:18,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:18,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:18,358 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand 173 states. [2018-11-23 11:57:18,358 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 173 states. [2018-11-23 11:57:18,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:18,361 INFO L93 Difference]: Finished difference Result 173 states and 226 transitions. [2018-11-23 11:57:18,361 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 226 transitions. [2018-11-23 11:57:18,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:18,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:18,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:18,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:18,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-23 11:57:18,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 223 transitions. [2018-11-23 11:57:18,363 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 223 transitions. Word has length 163 [2018-11-23 11:57:18,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:18,364 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 223 transitions. [2018-11-23 11:57:18,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-23 11:57:18,364 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 223 transitions. [2018-11-23 11:57:18,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-23 11:57:18,364 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:18,364 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:18,365 INFO L423 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:18,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:18,365 INFO L82 PathProgramCache]: Analyzing trace with hash 270324515, now seen corresponding path program 51 times [2018-11-23 11:57:18,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:18,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:18,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:18,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:18,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:19,589 INFO L256 TraceCheckUtils]: 0: Hoare triple {39079#true} call ULTIMATE.init(); {39079#true} is VALID [2018-11-23 11:57:19,589 INFO L273 TraceCheckUtils]: 1: Hoare triple {39079#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39079#true} is VALID [2018-11-23 11:57:19,589 INFO L273 TraceCheckUtils]: 2: Hoare triple {39079#true} assume true; {39079#true} is VALID [2018-11-23 11:57:19,590 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39079#true} {39079#true} #55#return; {39079#true} is VALID [2018-11-23 11:57:19,590 INFO L256 TraceCheckUtils]: 4: Hoare triple {39079#true} call #t~ret4 := main(); {39079#true} is VALID [2018-11-23 11:57:19,590 INFO L273 TraceCheckUtils]: 5: Hoare triple {39079#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {39081#(= main_~i~0 0)} is VALID [2018-11-23 11:57:19,591 INFO L273 TraceCheckUtils]: 6: Hoare triple {39081#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39081#(= main_~i~0 0)} is VALID [2018-11-23 11:57:19,591 INFO L273 TraceCheckUtils]: 7: Hoare triple {39081#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39081#(= main_~i~0 0)} is VALID [2018-11-23 11:57:19,592 INFO L273 TraceCheckUtils]: 8: Hoare triple {39081#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {39082#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:19,593 INFO L273 TraceCheckUtils]: 9: Hoare triple {39082#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39082#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:19,593 INFO L273 TraceCheckUtils]: 10: Hoare triple {39082#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39082#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:19,594 INFO L273 TraceCheckUtils]: 11: Hoare triple {39082#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {39083#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:19,594 INFO L273 TraceCheckUtils]: 12: Hoare triple {39083#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39083#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:19,595 INFO L273 TraceCheckUtils]: 13: Hoare triple {39083#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39083#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:19,595 INFO L273 TraceCheckUtils]: 14: Hoare triple {39083#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {39084#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:19,596 INFO L273 TraceCheckUtils]: 15: Hoare triple {39084#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39084#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:19,596 INFO L273 TraceCheckUtils]: 16: Hoare triple {39084#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39084#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:19,597 INFO L273 TraceCheckUtils]: 17: Hoare triple {39084#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {39085#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:19,598 INFO L273 TraceCheckUtils]: 18: Hoare triple {39085#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39085#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:19,598 INFO L273 TraceCheckUtils]: 19: Hoare triple {39085#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39085#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:19,599 INFO L273 TraceCheckUtils]: 20: Hoare triple {39085#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {39086#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:19,599 INFO L273 TraceCheckUtils]: 21: Hoare triple {39086#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39086#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:19,600 INFO L273 TraceCheckUtils]: 22: Hoare triple {39086#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39086#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:19,601 INFO L273 TraceCheckUtils]: 23: Hoare triple {39086#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {39087#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:19,601 INFO L273 TraceCheckUtils]: 24: Hoare triple {39087#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39087#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:19,602 INFO L273 TraceCheckUtils]: 25: Hoare triple {39087#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39087#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:19,602 INFO L273 TraceCheckUtils]: 26: Hoare triple {39087#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {39088#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:19,603 INFO L273 TraceCheckUtils]: 27: Hoare triple {39088#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39088#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:19,603 INFO L273 TraceCheckUtils]: 28: Hoare triple {39088#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39088#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:19,604 INFO L273 TraceCheckUtils]: 29: Hoare triple {39088#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {39089#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:19,604 INFO L273 TraceCheckUtils]: 30: Hoare triple {39089#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39089#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:19,605 INFO L273 TraceCheckUtils]: 31: Hoare triple {39089#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39089#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:19,606 INFO L273 TraceCheckUtils]: 32: Hoare triple {39089#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {39090#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:19,606 INFO L273 TraceCheckUtils]: 33: Hoare triple {39090#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39090#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:19,607 INFO L273 TraceCheckUtils]: 34: Hoare triple {39090#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39090#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:19,607 INFO L273 TraceCheckUtils]: 35: Hoare triple {39090#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {39091#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:19,608 INFO L273 TraceCheckUtils]: 36: Hoare triple {39091#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39091#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:19,608 INFO L273 TraceCheckUtils]: 37: Hoare triple {39091#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39091#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:19,609 INFO L273 TraceCheckUtils]: 38: Hoare triple {39091#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {39092#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:19,610 INFO L273 TraceCheckUtils]: 39: Hoare triple {39092#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39092#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:19,610 INFO L273 TraceCheckUtils]: 40: Hoare triple {39092#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39092#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:19,611 INFO L273 TraceCheckUtils]: 41: Hoare triple {39092#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {39093#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:19,611 INFO L273 TraceCheckUtils]: 42: Hoare triple {39093#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39093#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:19,612 INFO L273 TraceCheckUtils]: 43: Hoare triple {39093#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39093#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:19,612 INFO L273 TraceCheckUtils]: 44: Hoare triple {39093#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {39094#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:19,613 INFO L273 TraceCheckUtils]: 45: Hoare triple {39094#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39094#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:19,613 INFO L273 TraceCheckUtils]: 46: Hoare triple {39094#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39094#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:19,614 INFO L273 TraceCheckUtils]: 47: Hoare triple {39094#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {39095#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:19,615 INFO L273 TraceCheckUtils]: 48: Hoare triple {39095#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39095#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:19,615 INFO L273 TraceCheckUtils]: 49: Hoare triple {39095#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39095#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:19,616 INFO L273 TraceCheckUtils]: 50: Hoare triple {39095#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {39096#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:19,616 INFO L273 TraceCheckUtils]: 51: Hoare triple {39096#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39096#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:19,617 INFO L273 TraceCheckUtils]: 52: Hoare triple {39096#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39096#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:19,618 INFO L273 TraceCheckUtils]: 53: Hoare triple {39096#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {39097#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:19,618 INFO L273 TraceCheckUtils]: 54: Hoare triple {39097#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39097#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:19,619 INFO L273 TraceCheckUtils]: 55: Hoare triple {39097#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39097#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:19,619 INFO L273 TraceCheckUtils]: 56: Hoare triple {39097#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {39098#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:19,620 INFO L273 TraceCheckUtils]: 57: Hoare triple {39098#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39098#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:19,620 INFO L273 TraceCheckUtils]: 58: Hoare triple {39098#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39098#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:19,621 INFO L273 TraceCheckUtils]: 59: Hoare triple {39098#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {39099#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:19,621 INFO L273 TraceCheckUtils]: 60: Hoare triple {39099#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39099#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:19,622 INFO L273 TraceCheckUtils]: 61: Hoare triple {39099#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39099#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:19,623 INFO L273 TraceCheckUtils]: 62: Hoare triple {39099#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {39100#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:19,623 INFO L273 TraceCheckUtils]: 63: Hoare triple {39100#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39100#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:19,624 INFO L273 TraceCheckUtils]: 64: Hoare triple {39100#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39100#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:19,624 INFO L273 TraceCheckUtils]: 65: Hoare triple {39100#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {39101#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:19,625 INFO L273 TraceCheckUtils]: 66: Hoare triple {39101#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39101#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:19,625 INFO L273 TraceCheckUtils]: 67: Hoare triple {39101#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39101#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:19,626 INFO L273 TraceCheckUtils]: 68: Hoare triple {39101#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {39102#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:19,627 INFO L273 TraceCheckUtils]: 69: Hoare triple {39102#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39102#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:19,627 INFO L273 TraceCheckUtils]: 70: Hoare triple {39102#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39102#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:19,628 INFO L273 TraceCheckUtils]: 71: Hoare triple {39102#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {39103#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:19,628 INFO L273 TraceCheckUtils]: 72: Hoare triple {39103#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39103#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:19,629 INFO L273 TraceCheckUtils]: 73: Hoare triple {39103#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39103#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:19,629 INFO L273 TraceCheckUtils]: 74: Hoare triple {39103#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {39104#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:19,630 INFO L273 TraceCheckUtils]: 75: Hoare triple {39104#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39104#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:19,630 INFO L273 TraceCheckUtils]: 76: Hoare triple {39104#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39104#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:19,631 INFO L273 TraceCheckUtils]: 77: Hoare triple {39104#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {39105#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:19,632 INFO L273 TraceCheckUtils]: 78: Hoare triple {39105#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39105#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:19,632 INFO L273 TraceCheckUtils]: 79: Hoare triple {39105#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39105#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:19,633 INFO L273 TraceCheckUtils]: 80: Hoare triple {39105#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {39106#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:19,633 INFO L273 TraceCheckUtils]: 81: Hoare triple {39106#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39106#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:19,634 INFO L273 TraceCheckUtils]: 82: Hoare triple {39106#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39106#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:19,634 INFO L273 TraceCheckUtils]: 83: Hoare triple {39106#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {39107#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:19,635 INFO L273 TraceCheckUtils]: 84: Hoare triple {39107#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39107#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:19,635 INFO L273 TraceCheckUtils]: 85: Hoare triple {39107#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39107#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:19,636 INFO L273 TraceCheckUtils]: 86: Hoare triple {39107#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {39108#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:19,637 INFO L273 TraceCheckUtils]: 87: Hoare triple {39108#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39108#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:19,637 INFO L273 TraceCheckUtils]: 88: Hoare triple {39108#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39108#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:19,638 INFO L273 TraceCheckUtils]: 89: Hoare triple {39108#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {39109#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:19,638 INFO L273 TraceCheckUtils]: 90: Hoare triple {39109#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39109#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:19,639 INFO L273 TraceCheckUtils]: 91: Hoare triple {39109#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39109#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:19,640 INFO L273 TraceCheckUtils]: 92: Hoare triple {39109#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {39110#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:19,640 INFO L273 TraceCheckUtils]: 93: Hoare triple {39110#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39110#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:19,641 INFO L273 TraceCheckUtils]: 94: Hoare triple {39110#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39110#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:19,641 INFO L273 TraceCheckUtils]: 95: Hoare triple {39110#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {39111#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:19,642 INFO L273 TraceCheckUtils]: 96: Hoare triple {39111#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39111#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:19,642 INFO L273 TraceCheckUtils]: 97: Hoare triple {39111#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39111#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:19,643 INFO L273 TraceCheckUtils]: 98: Hoare triple {39111#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {39112#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:19,643 INFO L273 TraceCheckUtils]: 99: Hoare triple {39112#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39112#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:19,644 INFO L273 TraceCheckUtils]: 100: Hoare triple {39112#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39112#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:19,645 INFO L273 TraceCheckUtils]: 101: Hoare triple {39112#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {39113#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:19,645 INFO L273 TraceCheckUtils]: 102: Hoare triple {39113#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39113#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:19,646 INFO L273 TraceCheckUtils]: 103: Hoare triple {39113#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39113#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:19,646 INFO L273 TraceCheckUtils]: 104: Hoare triple {39113#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {39114#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:19,647 INFO L273 TraceCheckUtils]: 105: Hoare triple {39114#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39114#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:19,647 INFO L273 TraceCheckUtils]: 106: Hoare triple {39114#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39114#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:19,648 INFO L273 TraceCheckUtils]: 107: Hoare triple {39114#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {39115#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:19,649 INFO L273 TraceCheckUtils]: 108: Hoare triple {39115#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39115#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:19,649 INFO L273 TraceCheckUtils]: 109: Hoare triple {39115#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39115#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:19,650 INFO L273 TraceCheckUtils]: 110: Hoare triple {39115#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {39116#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:19,650 INFO L273 TraceCheckUtils]: 111: Hoare triple {39116#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39116#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:19,651 INFO L273 TraceCheckUtils]: 112: Hoare triple {39116#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39116#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:19,651 INFO L273 TraceCheckUtils]: 113: Hoare triple {39116#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {39117#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:19,652 INFO L273 TraceCheckUtils]: 114: Hoare triple {39117#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39117#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:19,652 INFO L273 TraceCheckUtils]: 115: Hoare triple {39117#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39117#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:19,653 INFO L273 TraceCheckUtils]: 116: Hoare triple {39117#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {39118#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:19,654 INFO L273 TraceCheckUtils]: 117: Hoare triple {39118#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39118#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:19,654 INFO L273 TraceCheckUtils]: 118: Hoare triple {39118#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39118#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:19,655 INFO L273 TraceCheckUtils]: 119: Hoare triple {39118#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {39119#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:19,655 INFO L273 TraceCheckUtils]: 120: Hoare triple {39119#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39119#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:19,656 INFO L273 TraceCheckUtils]: 121: Hoare triple {39119#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39119#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:19,657 INFO L273 TraceCheckUtils]: 122: Hoare triple {39119#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {39120#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:19,657 INFO L273 TraceCheckUtils]: 123: Hoare triple {39120#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39120#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:19,658 INFO L273 TraceCheckUtils]: 124: Hoare triple {39120#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39120#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:19,658 INFO L273 TraceCheckUtils]: 125: Hoare triple {39120#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {39121#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:19,659 INFO L273 TraceCheckUtils]: 126: Hoare triple {39121#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39121#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:19,659 INFO L273 TraceCheckUtils]: 127: Hoare triple {39121#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39121#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:19,660 INFO L273 TraceCheckUtils]: 128: Hoare triple {39121#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {39122#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:19,660 INFO L273 TraceCheckUtils]: 129: Hoare triple {39122#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39122#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:19,661 INFO L273 TraceCheckUtils]: 130: Hoare triple {39122#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39122#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:19,662 INFO L273 TraceCheckUtils]: 131: Hoare triple {39122#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {39123#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:19,662 INFO L273 TraceCheckUtils]: 132: Hoare triple {39123#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39123#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:19,663 INFO L273 TraceCheckUtils]: 133: Hoare triple {39123#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39123#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:19,663 INFO L273 TraceCheckUtils]: 134: Hoare triple {39123#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {39124#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:19,664 INFO L273 TraceCheckUtils]: 135: Hoare triple {39124#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39124#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:19,664 INFO L273 TraceCheckUtils]: 136: Hoare triple {39124#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39124#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:19,665 INFO L273 TraceCheckUtils]: 137: Hoare triple {39124#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {39125#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:19,665 INFO L273 TraceCheckUtils]: 138: Hoare triple {39125#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39125#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:19,666 INFO L273 TraceCheckUtils]: 139: Hoare triple {39125#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39125#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:19,667 INFO L273 TraceCheckUtils]: 140: Hoare triple {39125#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {39126#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:19,667 INFO L273 TraceCheckUtils]: 141: Hoare triple {39126#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39126#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:19,668 INFO L273 TraceCheckUtils]: 142: Hoare triple {39126#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39126#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:19,668 INFO L273 TraceCheckUtils]: 143: Hoare triple {39126#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {39127#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:19,669 INFO L273 TraceCheckUtils]: 144: Hoare triple {39127#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39127#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:19,669 INFO L273 TraceCheckUtils]: 145: Hoare triple {39127#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39127#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:19,670 INFO L273 TraceCheckUtils]: 146: Hoare triple {39127#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {39128#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:19,671 INFO L273 TraceCheckUtils]: 147: Hoare triple {39128#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39128#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:19,671 INFO L273 TraceCheckUtils]: 148: Hoare triple {39128#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39128#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:19,672 INFO L273 TraceCheckUtils]: 149: Hoare triple {39128#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {39129#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:19,672 INFO L273 TraceCheckUtils]: 150: Hoare triple {39129#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39129#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:19,673 INFO L273 TraceCheckUtils]: 151: Hoare triple {39129#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39129#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:19,673 INFO L273 TraceCheckUtils]: 152: Hoare triple {39129#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {39130#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:19,674 INFO L273 TraceCheckUtils]: 153: Hoare triple {39130#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39130#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:19,674 INFO L273 TraceCheckUtils]: 154: Hoare triple {39130#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39130#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:19,675 INFO L273 TraceCheckUtils]: 155: Hoare triple {39130#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {39131#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:19,676 INFO L273 TraceCheckUtils]: 156: Hoare triple {39131#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39131#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:19,676 INFO L273 TraceCheckUtils]: 157: Hoare triple {39131#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39131#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:19,677 INFO L273 TraceCheckUtils]: 158: Hoare triple {39131#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {39132#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:19,678 INFO L273 TraceCheckUtils]: 159: Hoare triple {39132#(<= main_~i~0 51)} assume !(~i~0 < 100000); {39080#false} is VALID [2018-11-23 11:57:19,678 INFO L273 TraceCheckUtils]: 160: Hoare triple {39080#false} havoc ~x~0;~x~0 := 0; {39080#false} is VALID [2018-11-23 11:57:19,678 INFO L273 TraceCheckUtils]: 161: Hoare triple {39080#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {39080#false} is VALID [2018-11-23 11:57:19,678 INFO L256 TraceCheckUtils]: 162: Hoare triple {39080#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {39080#false} is VALID [2018-11-23 11:57:19,678 INFO L273 TraceCheckUtils]: 163: Hoare triple {39080#false} ~cond := #in~cond; {39080#false} is VALID [2018-11-23 11:57:19,678 INFO L273 TraceCheckUtils]: 164: Hoare triple {39080#false} assume 0 == ~cond; {39080#false} is VALID [2018-11-23 11:57:19,679 INFO L273 TraceCheckUtils]: 165: Hoare triple {39080#false} assume !false; {39080#false} is VALID [2018-11-23 11:57:19,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 0 proven. 3876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:19,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:19,695 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:19,706 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:57:19,851 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-11-23 11:57:19,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:57:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:19,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:21,468 INFO L256 TraceCheckUtils]: 0: Hoare triple {39079#true} call ULTIMATE.init(); {39079#true} is VALID [2018-11-23 11:57:21,468 INFO L273 TraceCheckUtils]: 1: Hoare triple {39079#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39079#true} is VALID [2018-11-23 11:57:21,468 INFO L273 TraceCheckUtils]: 2: Hoare triple {39079#true} assume true; {39079#true} is VALID [2018-11-23 11:57:21,468 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39079#true} {39079#true} #55#return; {39079#true} is VALID [2018-11-23 11:57:21,469 INFO L256 TraceCheckUtils]: 4: Hoare triple {39079#true} call #t~ret4 := main(); {39079#true} is VALID [2018-11-23 11:57:21,469 INFO L273 TraceCheckUtils]: 5: Hoare triple {39079#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {39151#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:21,470 INFO L273 TraceCheckUtils]: 6: Hoare triple {39151#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39151#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:21,470 INFO L273 TraceCheckUtils]: 7: Hoare triple {39151#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39151#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:21,471 INFO L273 TraceCheckUtils]: 8: Hoare triple {39151#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {39082#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:21,471 INFO L273 TraceCheckUtils]: 9: Hoare triple {39082#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39082#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:21,471 INFO L273 TraceCheckUtils]: 10: Hoare triple {39082#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39082#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:21,472 INFO L273 TraceCheckUtils]: 11: Hoare triple {39082#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {39083#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:21,472 INFO L273 TraceCheckUtils]: 12: Hoare triple {39083#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39083#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:21,473 INFO L273 TraceCheckUtils]: 13: Hoare triple {39083#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39083#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:21,473 INFO L273 TraceCheckUtils]: 14: Hoare triple {39083#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {39084#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:21,474 INFO L273 TraceCheckUtils]: 15: Hoare triple {39084#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39084#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:21,474 INFO L273 TraceCheckUtils]: 16: Hoare triple {39084#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39084#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:21,475 INFO L273 TraceCheckUtils]: 17: Hoare triple {39084#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {39085#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:21,475 INFO L273 TraceCheckUtils]: 18: Hoare triple {39085#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39085#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:21,476 INFO L273 TraceCheckUtils]: 19: Hoare triple {39085#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39085#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:21,477 INFO L273 TraceCheckUtils]: 20: Hoare triple {39085#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {39086#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:21,477 INFO L273 TraceCheckUtils]: 21: Hoare triple {39086#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39086#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:21,478 INFO L273 TraceCheckUtils]: 22: Hoare triple {39086#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39086#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:21,478 INFO L273 TraceCheckUtils]: 23: Hoare triple {39086#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {39087#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:21,479 INFO L273 TraceCheckUtils]: 24: Hoare triple {39087#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39087#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:21,479 INFO L273 TraceCheckUtils]: 25: Hoare triple {39087#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39087#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:21,480 INFO L273 TraceCheckUtils]: 26: Hoare triple {39087#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {39088#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:21,481 INFO L273 TraceCheckUtils]: 27: Hoare triple {39088#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39088#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:21,481 INFO L273 TraceCheckUtils]: 28: Hoare triple {39088#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39088#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:21,482 INFO L273 TraceCheckUtils]: 29: Hoare triple {39088#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {39089#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:21,482 INFO L273 TraceCheckUtils]: 30: Hoare triple {39089#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39089#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:21,483 INFO L273 TraceCheckUtils]: 31: Hoare triple {39089#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39089#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:21,483 INFO L273 TraceCheckUtils]: 32: Hoare triple {39089#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {39090#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:21,484 INFO L273 TraceCheckUtils]: 33: Hoare triple {39090#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39090#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:21,484 INFO L273 TraceCheckUtils]: 34: Hoare triple {39090#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39090#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:21,485 INFO L273 TraceCheckUtils]: 35: Hoare triple {39090#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {39091#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:21,486 INFO L273 TraceCheckUtils]: 36: Hoare triple {39091#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39091#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:21,486 INFO L273 TraceCheckUtils]: 37: Hoare triple {39091#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39091#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:21,487 INFO L273 TraceCheckUtils]: 38: Hoare triple {39091#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {39092#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:21,487 INFO L273 TraceCheckUtils]: 39: Hoare triple {39092#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39092#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:21,488 INFO L273 TraceCheckUtils]: 40: Hoare triple {39092#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39092#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:21,489 INFO L273 TraceCheckUtils]: 41: Hoare triple {39092#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {39093#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:21,489 INFO L273 TraceCheckUtils]: 42: Hoare triple {39093#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39093#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:21,490 INFO L273 TraceCheckUtils]: 43: Hoare triple {39093#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39093#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:21,490 INFO L273 TraceCheckUtils]: 44: Hoare triple {39093#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {39094#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:21,491 INFO L273 TraceCheckUtils]: 45: Hoare triple {39094#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39094#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:21,491 INFO L273 TraceCheckUtils]: 46: Hoare triple {39094#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39094#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:21,492 INFO L273 TraceCheckUtils]: 47: Hoare triple {39094#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {39095#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:21,492 INFO L273 TraceCheckUtils]: 48: Hoare triple {39095#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39095#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:21,493 INFO L273 TraceCheckUtils]: 49: Hoare triple {39095#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39095#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:21,494 INFO L273 TraceCheckUtils]: 50: Hoare triple {39095#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {39096#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:21,494 INFO L273 TraceCheckUtils]: 51: Hoare triple {39096#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39096#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:21,495 INFO L273 TraceCheckUtils]: 52: Hoare triple {39096#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39096#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:21,495 INFO L273 TraceCheckUtils]: 53: Hoare triple {39096#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {39097#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:21,496 INFO L273 TraceCheckUtils]: 54: Hoare triple {39097#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39097#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:21,496 INFO L273 TraceCheckUtils]: 55: Hoare triple {39097#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39097#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:21,497 INFO L273 TraceCheckUtils]: 56: Hoare triple {39097#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {39098#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:21,498 INFO L273 TraceCheckUtils]: 57: Hoare triple {39098#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39098#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:21,498 INFO L273 TraceCheckUtils]: 58: Hoare triple {39098#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39098#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:21,499 INFO L273 TraceCheckUtils]: 59: Hoare triple {39098#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {39099#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:21,499 INFO L273 TraceCheckUtils]: 60: Hoare triple {39099#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39099#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:21,500 INFO L273 TraceCheckUtils]: 61: Hoare triple {39099#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39099#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:21,500 INFO L273 TraceCheckUtils]: 62: Hoare triple {39099#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {39100#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:21,501 INFO L273 TraceCheckUtils]: 63: Hoare triple {39100#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39100#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:21,501 INFO L273 TraceCheckUtils]: 64: Hoare triple {39100#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39100#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:21,502 INFO L273 TraceCheckUtils]: 65: Hoare triple {39100#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {39101#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:21,503 INFO L273 TraceCheckUtils]: 66: Hoare triple {39101#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39101#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:21,503 INFO L273 TraceCheckUtils]: 67: Hoare triple {39101#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39101#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:21,504 INFO L273 TraceCheckUtils]: 68: Hoare triple {39101#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {39102#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:21,504 INFO L273 TraceCheckUtils]: 69: Hoare triple {39102#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39102#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:21,505 INFO L273 TraceCheckUtils]: 70: Hoare triple {39102#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39102#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:21,506 INFO L273 TraceCheckUtils]: 71: Hoare triple {39102#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {39103#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:21,506 INFO L273 TraceCheckUtils]: 72: Hoare triple {39103#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39103#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:21,509 INFO L273 TraceCheckUtils]: 73: Hoare triple {39103#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39103#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:21,509 INFO L273 TraceCheckUtils]: 74: Hoare triple {39103#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {39104#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:21,510 INFO L273 TraceCheckUtils]: 75: Hoare triple {39104#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39104#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:21,510 INFO L273 TraceCheckUtils]: 76: Hoare triple {39104#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39104#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:21,510 INFO L273 TraceCheckUtils]: 77: Hoare triple {39104#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {39105#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:21,511 INFO L273 TraceCheckUtils]: 78: Hoare triple {39105#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39105#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:21,511 INFO L273 TraceCheckUtils]: 79: Hoare triple {39105#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39105#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:21,511 INFO L273 TraceCheckUtils]: 80: Hoare triple {39105#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {39106#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:21,512 INFO L273 TraceCheckUtils]: 81: Hoare triple {39106#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39106#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:21,512 INFO L273 TraceCheckUtils]: 82: Hoare triple {39106#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39106#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:21,512 INFO L273 TraceCheckUtils]: 83: Hoare triple {39106#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {39107#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:21,513 INFO L273 TraceCheckUtils]: 84: Hoare triple {39107#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39107#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:21,513 INFO L273 TraceCheckUtils]: 85: Hoare triple {39107#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39107#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:21,514 INFO L273 TraceCheckUtils]: 86: Hoare triple {39107#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {39108#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:21,515 INFO L273 TraceCheckUtils]: 87: Hoare triple {39108#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39108#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:21,515 INFO L273 TraceCheckUtils]: 88: Hoare triple {39108#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39108#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:21,516 INFO L273 TraceCheckUtils]: 89: Hoare triple {39108#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {39109#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:21,516 INFO L273 TraceCheckUtils]: 90: Hoare triple {39109#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39109#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:21,517 INFO L273 TraceCheckUtils]: 91: Hoare triple {39109#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39109#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:21,518 INFO L273 TraceCheckUtils]: 92: Hoare triple {39109#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {39110#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:21,518 INFO L273 TraceCheckUtils]: 93: Hoare triple {39110#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39110#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:21,519 INFO L273 TraceCheckUtils]: 94: Hoare triple {39110#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39110#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:21,519 INFO L273 TraceCheckUtils]: 95: Hoare triple {39110#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {39111#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:21,520 INFO L273 TraceCheckUtils]: 96: Hoare triple {39111#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39111#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:21,520 INFO L273 TraceCheckUtils]: 97: Hoare triple {39111#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39111#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:21,521 INFO L273 TraceCheckUtils]: 98: Hoare triple {39111#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {39112#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:21,521 INFO L273 TraceCheckUtils]: 99: Hoare triple {39112#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39112#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:21,522 INFO L273 TraceCheckUtils]: 100: Hoare triple {39112#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39112#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:21,523 INFO L273 TraceCheckUtils]: 101: Hoare triple {39112#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {39113#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:21,523 INFO L273 TraceCheckUtils]: 102: Hoare triple {39113#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39113#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:21,524 INFO L273 TraceCheckUtils]: 103: Hoare triple {39113#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39113#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:21,524 INFO L273 TraceCheckUtils]: 104: Hoare triple {39113#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {39114#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:21,525 INFO L273 TraceCheckUtils]: 105: Hoare triple {39114#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39114#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:21,525 INFO L273 TraceCheckUtils]: 106: Hoare triple {39114#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39114#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:21,526 INFO L273 TraceCheckUtils]: 107: Hoare triple {39114#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {39115#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:21,527 INFO L273 TraceCheckUtils]: 108: Hoare triple {39115#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39115#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:21,527 INFO L273 TraceCheckUtils]: 109: Hoare triple {39115#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39115#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:21,528 INFO L273 TraceCheckUtils]: 110: Hoare triple {39115#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {39116#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:21,528 INFO L273 TraceCheckUtils]: 111: Hoare triple {39116#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39116#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:21,529 INFO L273 TraceCheckUtils]: 112: Hoare triple {39116#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39116#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:21,529 INFO L273 TraceCheckUtils]: 113: Hoare triple {39116#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {39117#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:21,530 INFO L273 TraceCheckUtils]: 114: Hoare triple {39117#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39117#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:21,530 INFO L273 TraceCheckUtils]: 115: Hoare triple {39117#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39117#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:21,531 INFO L273 TraceCheckUtils]: 116: Hoare triple {39117#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {39118#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:21,532 INFO L273 TraceCheckUtils]: 117: Hoare triple {39118#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39118#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:21,532 INFO L273 TraceCheckUtils]: 118: Hoare triple {39118#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39118#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:21,533 INFO L273 TraceCheckUtils]: 119: Hoare triple {39118#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {39119#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:21,533 INFO L273 TraceCheckUtils]: 120: Hoare triple {39119#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39119#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:21,534 INFO L273 TraceCheckUtils]: 121: Hoare triple {39119#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39119#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:21,535 INFO L273 TraceCheckUtils]: 122: Hoare triple {39119#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {39120#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:21,535 INFO L273 TraceCheckUtils]: 123: Hoare triple {39120#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39120#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:21,536 INFO L273 TraceCheckUtils]: 124: Hoare triple {39120#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39120#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:21,536 INFO L273 TraceCheckUtils]: 125: Hoare triple {39120#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {39121#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:21,537 INFO L273 TraceCheckUtils]: 126: Hoare triple {39121#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39121#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:21,537 INFO L273 TraceCheckUtils]: 127: Hoare triple {39121#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39121#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:21,538 INFO L273 TraceCheckUtils]: 128: Hoare triple {39121#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {39122#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:21,538 INFO L273 TraceCheckUtils]: 129: Hoare triple {39122#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39122#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:21,539 INFO L273 TraceCheckUtils]: 130: Hoare triple {39122#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39122#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:21,540 INFO L273 TraceCheckUtils]: 131: Hoare triple {39122#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {39123#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:21,540 INFO L273 TraceCheckUtils]: 132: Hoare triple {39123#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39123#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:21,541 INFO L273 TraceCheckUtils]: 133: Hoare triple {39123#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39123#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:21,541 INFO L273 TraceCheckUtils]: 134: Hoare triple {39123#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {39124#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:21,542 INFO L273 TraceCheckUtils]: 135: Hoare triple {39124#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39124#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:21,542 INFO L273 TraceCheckUtils]: 136: Hoare triple {39124#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39124#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:21,543 INFO L273 TraceCheckUtils]: 137: Hoare triple {39124#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {39125#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:21,544 INFO L273 TraceCheckUtils]: 138: Hoare triple {39125#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39125#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:21,544 INFO L273 TraceCheckUtils]: 139: Hoare triple {39125#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39125#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:21,545 INFO L273 TraceCheckUtils]: 140: Hoare triple {39125#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {39126#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:21,545 INFO L273 TraceCheckUtils]: 141: Hoare triple {39126#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39126#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:21,546 INFO L273 TraceCheckUtils]: 142: Hoare triple {39126#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39126#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:21,546 INFO L273 TraceCheckUtils]: 143: Hoare triple {39126#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {39127#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:21,547 INFO L273 TraceCheckUtils]: 144: Hoare triple {39127#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39127#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:21,547 INFO L273 TraceCheckUtils]: 145: Hoare triple {39127#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39127#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:21,548 INFO L273 TraceCheckUtils]: 146: Hoare triple {39127#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {39128#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:21,549 INFO L273 TraceCheckUtils]: 147: Hoare triple {39128#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39128#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:21,549 INFO L273 TraceCheckUtils]: 148: Hoare triple {39128#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39128#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:21,550 INFO L273 TraceCheckUtils]: 149: Hoare triple {39128#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {39129#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:21,550 INFO L273 TraceCheckUtils]: 150: Hoare triple {39129#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39129#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:21,551 INFO L273 TraceCheckUtils]: 151: Hoare triple {39129#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39129#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:21,552 INFO L273 TraceCheckUtils]: 152: Hoare triple {39129#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {39130#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:21,552 INFO L273 TraceCheckUtils]: 153: Hoare triple {39130#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39130#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:21,553 INFO L273 TraceCheckUtils]: 154: Hoare triple {39130#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39130#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:21,553 INFO L273 TraceCheckUtils]: 155: Hoare triple {39130#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {39131#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:21,554 INFO L273 TraceCheckUtils]: 156: Hoare triple {39131#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39131#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:21,554 INFO L273 TraceCheckUtils]: 157: Hoare triple {39131#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {39131#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:21,555 INFO L273 TraceCheckUtils]: 158: Hoare triple {39131#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {39132#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:21,556 INFO L273 TraceCheckUtils]: 159: Hoare triple {39132#(<= main_~i~0 51)} assume !(~i~0 < 100000); {39080#false} is VALID [2018-11-23 11:57:21,556 INFO L273 TraceCheckUtils]: 160: Hoare triple {39080#false} havoc ~x~0;~x~0 := 0; {39080#false} is VALID [2018-11-23 11:57:21,556 INFO L273 TraceCheckUtils]: 161: Hoare triple {39080#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {39080#false} is VALID [2018-11-23 11:57:21,556 INFO L256 TraceCheckUtils]: 162: Hoare triple {39080#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {39080#false} is VALID [2018-11-23 11:57:21,556 INFO L273 TraceCheckUtils]: 163: Hoare triple {39080#false} ~cond := #in~cond; {39080#false} is VALID [2018-11-23 11:57:21,557 INFO L273 TraceCheckUtils]: 164: Hoare triple {39080#false} assume 0 == ~cond; {39080#false} is VALID [2018-11-23 11:57:21,557 INFO L273 TraceCheckUtils]: 165: Hoare triple {39080#false} assume !false; {39080#false} is VALID [2018-11-23 11:57:21,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 0 proven. 3876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:21,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:21,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2018-11-23 11:57:21,594 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 166 [2018-11-23 11:57:21,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:21,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states. [2018-11-23 11:57:21,759 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:21,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-23 11:57:21,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-23 11:57:21,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 11:57:21,760 INFO L87 Difference]: Start difference. First operand 171 states and 223 transitions. Second operand 55 states. [2018-11-23 11:57:22,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:22,855 INFO L93 Difference]: Finished difference Result 187 states and 242 transitions. [2018-11-23 11:57:22,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-23 11:57:22,855 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 166 [2018-11-23 11:57:22,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:22,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 11:57:22,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 242 transitions. [2018-11-23 11:57:22,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 11:57:22,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 242 transitions. [2018-11-23 11:57:22,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 242 transitions. [2018-11-23 11:57:23,085 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 242 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:23,088 INFO L225 Difference]: With dead ends: 187 [2018-11-23 11:57:23,089 INFO L226 Difference]: Without dead ends: 176 [2018-11-23 11:57:23,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 11:57:23,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-11-23 11:57:23,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2018-11-23 11:57:23,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:23,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 176 states. Second operand 174 states. [2018-11-23 11:57:23,152 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand 174 states. [2018-11-23 11:57:23,153 INFO L87 Difference]: Start difference. First operand 176 states. Second operand 174 states. [2018-11-23 11:57:23,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:23,155 INFO L93 Difference]: Finished difference Result 176 states and 230 transitions. [2018-11-23 11:57:23,156 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 230 transitions. [2018-11-23 11:57:23,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:23,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:23,156 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand 176 states. [2018-11-23 11:57:23,156 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 176 states. [2018-11-23 11:57:23,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:23,158 INFO L93 Difference]: Finished difference Result 176 states and 230 transitions. [2018-11-23 11:57:23,158 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 230 transitions. [2018-11-23 11:57:23,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:23,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:23,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:23,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:23,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-23 11:57:23,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 227 transitions. [2018-11-23 11:57:23,161 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 227 transitions. Word has length 166 [2018-11-23 11:57:23,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:23,161 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 227 transitions. [2018-11-23 11:57:23,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-23 11:57:23,161 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 227 transitions. [2018-11-23 11:57:23,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-23 11:57:23,162 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:23,162 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:23,163 INFO L423 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:23,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:23,163 INFO L82 PathProgramCache]: Analyzing trace with hash -780687815, now seen corresponding path program 52 times [2018-11-23 11:57:23,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:23,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:23,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:23,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:23,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:24,554 INFO L256 TraceCheckUtils]: 0: Hoare triple {40467#true} call ULTIMATE.init(); {40467#true} is VALID [2018-11-23 11:57:24,554 INFO L273 TraceCheckUtils]: 1: Hoare triple {40467#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {40467#true} is VALID [2018-11-23 11:57:24,554 INFO L273 TraceCheckUtils]: 2: Hoare triple {40467#true} assume true; {40467#true} is VALID [2018-11-23 11:57:24,554 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40467#true} {40467#true} #55#return; {40467#true} is VALID [2018-11-23 11:57:24,555 INFO L256 TraceCheckUtils]: 4: Hoare triple {40467#true} call #t~ret4 := main(); {40467#true} is VALID [2018-11-23 11:57:24,555 INFO L273 TraceCheckUtils]: 5: Hoare triple {40467#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {40469#(= main_~i~0 0)} is VALID [2018-11-23 11:57:24,556 INFO L273 TraceCheckUtils]: 6: Hoare triple {40469#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40469#(= main_~i~0 0)} is VALID [2018-11-23 11:57:24,556 INFO L273 TraceCheckUtils]: 7: Hoare triple {40469#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40469#(= main_~i~0 0)} is VALID [2018-11-23 11:57:24,557 INFO L273 TraceCheckUtils]: 8: Hoare triple {40469#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {40470#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:24,557 INFO L273 TraceCheckUtils]: 9: Hoare triple {40470#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40470#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:24,558 INFO L273 TraceCheckUtils]: 10: Hoare triple {40470#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40470#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:24,558 INFO L273 TraceCheckUtils]: 11: Hoare triple {40470#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {40471#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:24,559 INFO L273 TraceCheckUtils]: 12: Hoare triple {40471#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40471#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:24,559 INFO L273 TraceCheckUtils]: 13: Hoare triple {40471#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40471#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:24,560 INFO L273 TraceCheckUtils]: 14: Hoare triple {40471#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {40472#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:24,561 INFO L273 TraceCheckUtils]: 15: Hoare triple {40472#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40472#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:24,561 INFO L273 TraceCheckUtils]: 16: Hoare triple {40472#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40472#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:24,562 INFO L273 TraceCheckUtils]: 17: Hoare triple {40472#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {40473#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:24,562 INFO L273 TraceCheckUtils]: 18: Hoare triple {40473#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40473#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:24,563 INFO L273 TraceCheckUtils]: 19: Hoare triple {40473#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40473#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:24,564 INFO L273 TraceCheckUtils]: 20: Hoare triple {40473#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {40474#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:24,564 INFO L273 TraceCheckUtils]: 21: Hoare triple {40474#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40474#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:24,565 INFO L273 TraceCheckUtils]: 22: Hoare triple {40474#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40474#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:24,565 INFO L273 TraceCheckUtils]: 23: Hoare triple {40474#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {40475#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:24,566 INFO L273 TraceCheckUtils]: 24: Hoare triple {40475#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40475#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:24,566 INFO L273 TraceCheckUtils]: 25: Hoare triple {40475#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40475#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:24,567 INFO L273 TraceCheckUtils]: 26: Hoare triple {40475#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {40476#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:24,567 INFO L273 TraceCheckUtils]: 27: Hoare triple {40476#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40476#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:24,568 INFO L273 TraceCheckUtils]: 28: Hoare triple {40476#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40476#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:24,569 INFO L273 TraceCheckUtils]: 29: Hoare triple {40476#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {40477#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:24,569 INFO L273 TraceCheckUtils]: 30: Hoare triple {40477#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40477#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:24,570 INFO L273 TraceCheckUtils]: 31: Hoare triple {40477#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40477#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:24,570 INFO L273 TraceCheckUtils]: 32: Hoare triple {40477#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {40478#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:24,571 INFO L273 TraceCheckUtils]: 33: Hoare triple {40478#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40478#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:24,571 INFO L273 TraceCheckUtils]: 34: Hoare triple {40478#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40478#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:24,572 INFO L273 TraceCheckUtils]: 35: Hoare triple {40478#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {40479#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:24,573 INFO L273 TraceCheckUtils]: 36: Hoare triple {40479#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40479#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:24,573 INFO L273 TraceCheckUtils]: 37: Hoare triple {40479#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40479#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:24,574 INFO L273 TraceCheckUtils]: 38: Hoare triple {40479#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {40480#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:24,574 INFO L273 TraceCheckUtils]: 39: Hoare triple {40480#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40480#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:24,575 INFO L273 TraceCheckUtils]: 40: Hoare triple {40480#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40480#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:24,575 INFO L273 TraceCheckUtils]: 41: Hoare triple {40480#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {40481#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:24,576 INFO L273 TraceCheckUtils]: 42: Hoare triple {40481#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40481#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:24,576 INFO L273 TraceCheckUtils]: 43: Hoare triple {40481#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40481#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:24,577 INFO L273 TraceCheckUtils]: 44: Hoare triple {40481#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {40482#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:24,578 INFO L273 TraceCheckUtils]: 45: Hoare triple {40482#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40482#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:24,578 INFO L273 TraceCheckUtils]: 46: Hoare triple {40482#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40482#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:24,579 INFO L273 TraceCheckUtils]: 47: Hoare triple {40482#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {40483#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:24,579 INFO L273 TraceCheckUtils]: 48: Hoare triple {40483#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40483#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:24,580 INFO L273 TraceCheckUtils]: 49: Hoare triple {40483#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40483#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:24,580 INFO L273 TraceCheckUtils]: 50: Hoare triple {40483#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {40484#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:24,581 INFO L273 TraceCheckUtils]: 51: Hoare triple {40484#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40484#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:24,581 INFO L273 TraceCheckUtils]: 52: Hoare triple {40484#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40484#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:24,582 INFO L273 TraceCheckUtils]: 53: Hoare triple {40484#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {40485#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:24,583 INFO L273 TraceCheckUtils]: 54: Hoare triple {40485#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40485#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:24,583 INFO L273 TraceCheckUtils]: 55: Hoare triple {40485#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40485#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:24,584 INFO L273 TraceCheckUtils]: 56: Hoare triple {40485#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {40486#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:24,584 INFO L273 TraceCheckUtils]: 57: Hoare triple {40486#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40486#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:24,585 INFO L273 TraceCheckUtils]: 58: Hoare triple {40486#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40486#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:24,586 INFO L273 TraceCheckUtils]: 59: Hoare triple {40486#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {40487#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:24,586 INFO L273 TraceCheckUtils]: 60: Hoare triple {40487#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40487#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:24,587 INFO L273 TraceCheckUtils]: 61: Hoare triple {40487#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40487#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:24,587 INFO L273 TraceCheckUtils]: 62: Hoare triple {40487#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {40488#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:24,588 INFO L273 TraceCheckUtils]: 63: Hoare triple {40488#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40488#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:24,588 INFO L273 TraceCheckUtils]: 64: Hoare triple {40488#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40488#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:24,589 INFO L273 TraceCheckUtils]: 65: Hoare triple {40488#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {40489#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:24,589 INFO L273 TraceCheckUtils]: 66: Hoare triple {40489#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40489#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:24,590 INFO L273 TraceCheckUtils]: 67: Hoare triple {40489#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40489#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:24,591 INFO L273 TraceCheckUtils]: 68: Hoare triple {40489#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {40490#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:24,591 INFO L273 TraceCheckUtils]: 69: Hoare triple {40490#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40490#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:24,592 INFO L273 TraceCheckUtils]: 70: Hoare triple {40490#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40490#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:24,592 INFO L273 TraceCheckUtils]: 71: Hoare triple {40490#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {40491#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:24,593 INFO L273 TraceCheckUtils]: 72: Hoare triple {40491#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40491#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:24,593 INFO L273 TraceCheckUtils]: 73: Hoare triple {40491#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40491#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:24,594 INFO L273 TraceCheckUtils]: 74: Hoare triple {40491#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {40492#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:24,594 INFO L273 TraceCheckUtils]: 75: Hoare triple {40492#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40492#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:24,595 INFO L273 TraceCheckUtils]: 76: Hoare triple {40492#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40492#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:24,596 INFO L273 TraceCheckUtils]: 77: Hoare triple {40492#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {40493#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:24,596 INFO L273 TraceCheckUtils]: 78: Hoare triple {40493#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40493#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:24,597 INFO L273 TraceCheckUtils]: 79: Hoare triple {40493#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40493#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:24,597 INFO L273 TraceCheckUtils]: 80: Hoare triple {40493#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {40494#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:24,598 INFO L273 TraceCheckUtils]: 81: Hoare triple {40494#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40494#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:24,598 INFO L273 TraceCheckUtils]: 82: Hoare triple {40494#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40494#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:24,599 INFO L273 TraceCheckUtils]: 83: Hoare triple {40494#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {40495#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:24,600 INFO L273 TraceCheckUtils]: 84: Hoare triple {40495#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40495#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:24,600 INFO L273 TraceCheckUtils]: 85: Hoare triple {40495#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40495#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:24,601 INFO L273 TraceCheckUtils]: 86: Hoare triple {40495#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {40496#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:24,601 INFO L273 TraceCheckUtils]: 87: Hoare triple {40496#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40496#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:24,602 INFO L273 TraceCheckUtils]: 88: Hoare triple {40496#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40496#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:24,602 INFO L273 TraceCheckUtils]: 89: Hoare triple {40496#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {40497#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:24,603 INFO L273 TraceCheckUtils]: 90: Hoare triple {40497#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40497#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:24,603 INFO L273 TraceCheckUtils]: 91: Hoare triple {40497#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40497#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:24,604 INFO L273 TraceCheckUtils]: 92: Hoare triple {40497#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {40498#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:24,605 INFO L273 TraceCheckUtils]: 93: Hoare triple {40498#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40498#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:24,605 INFO L273 TraceCheckUtils]: 94: Hoare triple {40498#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40498#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:24,606 INFO L273 TraceCheckUtils]: 95: Hoare triple {40498#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {40499#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:24,606 INFO L273 TraceCheckUtils]: 96: Hoare triple {40499#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40499#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:24,607 INFO L273 TraceCheckUtils]: 97: Hoare triple {40499#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40499#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:24,608 INFO L273 TraceCheckUtils]: 98: Hoare triple {40499#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {40500#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:24,608 INFO L273 TraceCheckUtils]: 99: Hoare triple {40500#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40500#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:24,609 INFO L273 TraceCheckUtils]: 100: Hoare triple {40500#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40500#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:24,609 INFO L273 TraceCheckUtils]: 101: Hoare triple {40500#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {40501#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:24,610 INFO L273 TraceCheckUtils]: 102: Hoare triple {40501#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40501#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:24,610 INFO L273 TraceCheckUtils]: 103: Hoare triple {40501#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40501#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:24,611 INFO L273 TraceCheckUtils]: 104: Hoare triple {40501#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {40502#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:24,611 INFO L273 TraceCheckUtils]: 105: Hoare triple {40502#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40502#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:24,612 INFO L273 TraceCheckUtils]: 106: Hoare triple {40502#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40502#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:24,613 INFO L273 TraceCheckUtils]: 107: Hoare triple {40502#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {40503#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:24,613 INFO L273 TraceCheckUtils]: 108: Hoare triple {40503#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40503#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:24,614 INFO L273 TraceCheckUtils]: 109: Hoare triple {40503#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40503#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:24,614 INFO L273 TraceCheckUtils]: 110: Hoare triple {40503#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {40504#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:24,615 INFO L273 TraceCheckUtils]: 111: Hoare triple {40504#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40504#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:24,615 INFO L273 TraceCheckUtils]: 112: Hoare triple {40504#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40504#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:24,616 INFO L273 TraceCheckUtils]: 113: Hoare triple {40504#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {40505#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:24,617 INFO L273 TraceCheckUtils]: 114: Hoare triple {40505#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40505#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:24,617 INFO L273 TraceCheckUtils]: 115: Hoare triple {40505#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40505#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:24,618 INFO L273 TraceCheckUtils]: 116: Hoare triple {40505#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {40506#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:24,618 INFO L273 TraceCheckUtils]: 117: Hoare triple {40506#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40506#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:24,619 INFO L273 TraceCheckUtils]: 118: Hoare triple {40506#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40506#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:24,619 INFO L273 TraceCheckUtils]: 119: Hoare triple {40506#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {40507#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:24,620 INFO L273 TraceCheckUtils]: 120: Hoare triple {40507#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40507#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:24,620 INFO L273 TraceCheckUtils]: 121: Hoare triple {40507#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40507#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:24,621 INFO L273 TraceCheckUtils]: 122: Hoare triple {40507#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {40508#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:24,622 INFO L273 TraceCheckUtils]: 123: Hoare triple {40508#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40508#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:24,622 INFO L273 TraceCheckUtils]: 124: Hoare triple {40508#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40508#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:24,623 INFO L273 TraceCheckUtils]: 125: Hoare triple {40508#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {40509#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:24,623 INFO L273 TraceCheckUtils]: 126: Hoare triple {40509#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40509#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:24,624 INFO L273 TraceCheckUtils]: 127: Hoare triple {40509#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40509#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:24,625 INFO L273 TraceCheckUtils]: 128: Hoare triple {40509#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {40510#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:24,625 INFO L273 TraceCheckUtils]: 129: Hoare triple {40510#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40510#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:24,626 INFO L273 TraceCheckUtils]: 130: Hoare triple {40510#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40510#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:24,626 INFO L273 TraceCheckUtils]: 131: Hoare triple {40510#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {40511#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:24,627 INFO L273 TraceCheckUtils]: 132: Hoare triple {40511#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40511#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:24,627 INFO L273 TraceCheckUtils]: 133: Hoare triple {40511#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40511#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:24,628 INFO L273 TraceCheckUtils]: 134: Hoare triple {40511#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {40512#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:24,628 INFO L273 TraceCheckUtils]: 135: Hoare triple {40512#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40512#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:24,629 INFO L273 TraceCheckUtils]: 136: Hoare triple {40512#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40512#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:24,630 INFO L273 TraceCheckUtils]: 137: Hoare triple {40512#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {40513#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:24,630 INFO L273 TraceCheckUtils]: 138: Hoare triple {40513#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40513#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:24,631 INFO L273 TraceCheckUtils]: 139: Hoare triple {40513#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40513#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:24,631 INFO L273 TraceCheckUtils]: 140: Hoare triple {40513#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {40514#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:24,632 INFO L273 TraceCheckUtils]: 141: Hoare triple {40514#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40514#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:24,632 INFO L273 TraceCheckUtils]: 142: Hoare triple {40514#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40514#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:24,633 INFO L273 TraceCheckUtils]: 143: Hoare triple {40514#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {40515#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:24,634 INFO L273 TraceCheckUtils]: 144: Hoare triple {40515#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40515#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:24,634 INFO L273 TraceCheckUtils]: 145: Hoare triple {40515#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40515#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:24,635 INFO L273 TraceCheckUtils]: 146: Hoare triple {40515#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {40516#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:24,635 INFO L273 TraceCheckUtils]: 147: Hoare triple {40516#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40516#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:24,636 INFO L273 TraceCheckUtils]: 148: Hoare triple {40516#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40516#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:24,636 INFO L273 TraceCheckUtils]: 149: Hoare triple {40516#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {40517#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:24,637 INFO L273 TraceCheckUtils]: 150: Hoare triple {40517#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40517#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:24,637 INFO L273 TraceCheckUtils]: 151: Hoare triple {40517#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40517#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:24,638 INFO L273 TraceCheckUtils]: 152: Hoare triple {40517#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {40518#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:24,639 INFO L273 TraceCheckUtils]: 153: Hoare triple {40518#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40518#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:24,639 INFO L273 TraceCheckUtils]: 154: Hoare triple {40518#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40518#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:24,640 INFO L273 TraceCheckUtils]: 155: Hoare triple {40518#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {40519#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:24,640 INFO L273 TraceCheckUtils]: 156: Hoare triple {40519#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40519#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:24,641 INFO L273 TraceCheckUtils]: 157: Hoare triple {40519#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40519#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:24,642 INFO L273 TraceCheckUtils]: 158: Hoare triple {40519#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {40520#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:24,642 INFO L273 TraceCheckUtils]: 159: Hoare triple {40520#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40520#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:24,643 INFO L273 TraceCheckUtils]: 160: Hoare triple {40520#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40520#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:24,643 INFO L273 TraceCheckUtils]: 161: Hoare triple {40520#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {40521#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:24,644 INFO L273 TraceCheckUtils]: 162: Hoare triple {40521#(<= main_~i~0 52)} assume !(~i~0 < 100000); {40468#false} is VALID [2018-11-23 11:57:24,644 INFO L273 TraceCheckUtils]: 163: Hoare triple {40468#false} havoc ~x~0;~x~0 := 0; {40468#false} is VALID [2018-11-23 11:57:24,644 INFO L273 TraceCheckUtils]: 164: Hoare triple {40468#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {40468#false} is VALID [2018-11-23 11:57:24,645 INFO L256 TraceCheckUtils]: 165: Hoare triple {40468#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {40468#false} is VALID [2018-11-23 11:57:24,645 INFO L273 TraceCheckUtils]: 166: Hoare triple {40468#false} ~cond := #in~cond; {40468#false} is VALID [2018-11-23 11:57:24,645 INFO L273 TraceCheckUtils]: 167: Hoare triple {40468#false} assume 0 == ~cond; {40468#false} is VALID [2018-11-23 11:57:24,645 INFO L273 TraceCheckUtils]: 168: Hoare triple {40468#false} assume !false; {40468#false} is VALID [2018-11-23 11:57:24,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 0 proven. 4030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:24,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:24,665 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:24,675 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:57:24,752 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:57:24,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:57:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:24,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:25,175 INFO L256 TraceCheckUtils]: 0: Hoare triple {40467#true} call ULTIMATE.init(); {40467#true} is VALID [2018-11-23 11:57:25,175 INFO L273 TraceCheckUtils]: 1: Hoare triple {40467#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {40467#true} is VALID [2018-11-23 11:57:25,175 INFO L273 TraceCheckUtils]: 2: Hoare triple {40467#true} assume true; {40467#true} is VALID [2018-11-23 11:57:25,175 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40467#true} {40467#true} #55#return; {40467#true} is VALID [2018-11-23 11:57:25,176 INFO L256 TraceCheckUtils]: 4: Hoare triple {40467#true} call #t~ret4 := main(); {40467#true} is VALID [2018-11-23 11:57:25,176 INFO L273 TraceCheckUtils]: 5: Hoare triple {40467#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {40540#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:25,177 INFO L273 TraceCheckUtils]: 6: Hoare triple {40540#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40540#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:25,177 INFO L273 TraceCheckUtils]: 7: Hoare triple {40540#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40540#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:25,178 INFO L273 TraceCheckUtils]: 8: Hoare triple {40540#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {40470#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:25,179 INFO L273 TraceCheckUtils]: 9: Hoare triple {40470#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40470#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:25,179 INFO L273 TraceCheckUtils]: 10: Hoare triple {40470#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40470#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:25,180 INFO L273 TraceCheckUtils]: 11: Hoare triple {40470#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {40471#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:25,180 INFO L273 TraceCheckUtils]: 12: Hoare triple {40471#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40471#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:25,181 INFO L273 TraceCheckUtils]: 13: Hoare triple {40471#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40471#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:25,181 INFO L273 TraceCheckUtils]: 14: Hoare triple {40471#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {40472#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:25,182 INFO L273 TraceCheckUtils]: 15: Hoare triple {40472#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40472#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:25,182 INFO L273 TraceCheckUtils]: 16: Hoare triple {40472#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40472#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:25,183 INFO L273 TraceCheckUtils]: 17: Hoare triple {40472#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {40473#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:25,184 INFO L273 TraceCheckUtils]: 18: Hoare triple {40473#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40473#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:25,184 INFO L273 TraceCheckUtils]: 19: Hoare triple {40473#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40473#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:25,185 INFO L273 TraceCheckUtils]: 20: Hoare triple {40473#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {40474#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:25,185 INFO L273 TraceCheckUtils]: 21: Hoare triple {40474#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40474#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:25,186 INFO L273 TraceCheckUtils]: 22: Hoare triple {40474#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40474#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:25,186 INFO L273 TraceCheckUtils]: 23: Hoare triple {40474#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {40475#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:25,187 INFO L273 TraceCheckUtils]: 24: Hoare triple {40475#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40475#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:25,187 INFO L273 TraceCheckUtils]: 25: Hoare triple {40475#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40475#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:25,188 INFO L273 TraceCheckUtils]: 26: Hoare triple {40475#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {40476#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:25,189 INFO L273 TraceCheckUtils]: 27: Hoare triple {40476#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40476#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:25,189 INFO L273 TraceCheckUtils]: 28: Hoare triple {40476#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40476#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:25,190 INFO L273 TraceCheckUtils]: 29: Hoare triple {40476#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {40477#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:25,190 INFO L273 TraceCheckUtils]: 30: Hoare triple {40477#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40477#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:25,191 INFO L273 TraceCheckUtils]: 31: Hoare triple {40477#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40477#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:25,192 INFO L273 TraceCheckUtils]: 32: Hoare triple {40477#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {40478#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:25,192 INFO L273 TraceCheckUtils]: 33: Hoare triple {40478#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40478#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:25,193 INFO L273 TraceCheckUtils]: 34: Hoare triple {40478#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40478#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:25,193 INFO L273 TraceCheckUtils]: 35: Hoare triple {40478#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {40479#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:25,194 INFO L273 TraceCheckUtils]: 36: Hoare triple {40479#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40479#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:25,194 INFO L273 TraceCheckUtils]: 37: Hoare triple {40479#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40479#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:25,195 INFO L273 TraceCheckUtils]: 38: Hoare triple {40479#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {40480#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:25,195 INFO L273 TraceCheckUtils]: 39: Hoare triple {40480#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40480#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:25,196 INFO L273 TraceCheckUtils]: 40: Hoare triple {40480#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40480#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:25,197 INFO L273 TraceCheckUtils]: 41: Hoare triple {40480#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {40481#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:25,197 INFO L273 TraceCheckUtils]: 42: Hoare triple {40481#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40481#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:25,198 INFO L273 TraceCheckUtils]: 43: Hoare triple {40481#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40481#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:25,198 INFO L273 TraceCheckUtils]: 44: Hoare triple {40481#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {40482#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:25,199 INFO L273 TraceCheckUtils]: 45: Hoare triple {40482#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40482#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:25,199 INFO L273 TraceCheckUtils]: 46: Hoare triple {40482#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40482#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:25,200 INFO L273 TraceCheckUtils]: 47: Hoare triple {40482#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {40483#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:25,200 INFO L273 TraceCheckUtils]: 48: Hoare triple {40483#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40483#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:25,201 INFO L273 TraceCheckUtils]: 49: Hoare triple {40483#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40483#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:25,202 INFO L273 TraceCheckUtils]: 50: Hoare triple {40483#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {40484#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:25,202 INFO L273 TraceCheckUtils]: 51: Hoare triple {40484#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40484#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:25,203 INFO L273 TraceCheckUtils]: 52: Hoare triple {40484#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40484#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:25,203 INFO L273 TraceCheckUtils]: 53: Hoare triple {40484#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {40485#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:25,204 INFO L273 TraceCheckUtils]: 54: Hoare triple {40485#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40485#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:25,204 INFO L273 TraceCheckUtils]: 55: Hoare triple {40485#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40485#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:25,205 INFO L273 TraceCheckUtils]: 56: Hoare triple {40485#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {40486#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:25,206 INFO L273 TraceCheckUtils]: 57: Hoare triple {40486#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40486#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:25,206 INFO L273 TraceCheckUtils]: 58: Hoare triple {40486#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40486#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:25,207 INFO L273 TraceCheckUtils]: 59: Hoare triple {40486#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {40487#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:25,207 INFO L273 TraceCheckUtils]: 60: Hoare triple {40487#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40487#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:25,208 INFO L273 TraceCheckUtils]: 61: Hoare triple {40487#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40487#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:25,208 INFO L273 TraceCheckUtils]: 62: Hoare triple {40487#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {40488#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:25,209 INFO L273 TraceCheckUtils]: 63: Hoare triple {40488#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40488#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:25,209 INFO L273 TraceCheckUtils]: 64: Hoare triple {40488#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40488#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:25,210 INFO L273 TraceCheckUtils]: 65: Hoare triple {40488#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {40489#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:25,211 INFO L273 TraceCheckUtils]: 66: Hoare triple {40489#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40489#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:25,211 INFO L273 TraceCheckUtils]: 67: Hoare triple {40489#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40489#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:25,212 INFO L273 TraceCheckUtils]: 68: Hoare triple {40489#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {40490#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:25,212 INFO L273 TraceCheckUtils]: 69: Hoare triple {40490#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40490#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:25,213 INFO L273 TraceCheckUtils]: 70: Hoare triple {40490#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40490#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:25,213 INFO L273 TraceCheckUtils]: 71: Hoare triple {40490#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {40491#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:25,214 INFO L273 TraceCheckUtils]: 72: Hoare triple {40491#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40491#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:25,214 INFO L273 TraceCheckUtils]: 73: Hoare triple {40491#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40491#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:25,215 INFO L273 TraceCheckUtils]: 74: Hoare triple {40491#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {40492#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:25,216 INFO L273 TraceCheckUtils]: 75: Hoare triple {40492#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40492#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:25,216 INFO L273 TraceCheckUtils]: 76: Hoare triple {40492#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40492#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:25,217 INFO L273 TraceCheckUtils]: 77: Hoare triple {40492#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {40493#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:25,217 INFO L273 TraceCheckUtils]: 78: Hoare triple {40493#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40493#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:25,218 INFO L273 TraceCheckUtils]: 79: Hoare triple {40493#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40493#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:25,218 INFO L273 TraceCheckUtils]: 80: Hoare triple {40493#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {40494#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:25,219 INFO L273 TraceCheckUtils]: 81: Hoare triple {40494#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40494#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:25,219 INFO L273 TraceCheckUtils]: 82: Hoare triple {40494#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40494#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:25,220 INFO L273 TraceCheckUtils]: 83: Hoare triple {40494#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {40495#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:25,221 INFO L273 TraceCheckUtils]: 84: Hoare triple {40495#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40495#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:25,221 INFO L273 TraceCheckUtils]: 85: Hoare triple {40495#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40495#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:25,222 INFO L273 TraceCheckUtils]: 86: Hoare triple {40495#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {40496#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:25,222 INFO L273 TraceCheckUtils]: 87: Hoare triple {40496#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40496#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:25,223 INFO L273 TraceCheckUtils]: 88: Hoare triple {40496#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40496#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:25,224 INFO L273 TraceCheckUtils]: 89: Hoare triple {40496#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {40497#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:25,224 INFO L273 TraceCheckUtils]: 90: Hoare triple {40497#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40497#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:25,225 INFO L273 TraceCheckUtils]: 91: Hoare triple {40497#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40497#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:25,225 INFO L273 TraceCheckUtils]: 92: Hoare triple {40497#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {40498#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:25,226 INFO L273 TraceCheckUtils]: 93: Hoare triple {40498#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40498#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:25,226 INFO L273 TraceCheckUtils]: 94: Hoare triple {40498#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40498#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:25,227 INFO L273 TraceCheckUtils]: 95: Hoare triple {40498#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {40499#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:25,227 INFO L273 TraceCheckUtils]: 96: Hoare triple {40499#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40499#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:25,228 INFO L273 TraceCheckUtils]: 97: Hoare triple {40499#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40499#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:25,229 INFO L273 TraceCheckUtils]: 98: Hoare triple {40499#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {40500#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:25,229 INFO L273 TraceCheckUtils]: 99: Hoare triple {40500#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40500#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:25,230 INFO L273 TraceCheckUtils]: 100: Hoare triple {40500#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40500#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:25,230 INFO L273 TraceCheckUtils]: 101: Hoare triple {40500#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {40501#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:25,231 INFO L273 TraceCheckUtils]: 102: Hoare triple {40501#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40501#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:25,231 INFO L273 TraceCheckUtils]: 103: Hoare triple {40501#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40501#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:25,232 INFO L273 TraceCheckUtils]: 104: Hoare triple {40501#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {40502#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:25,232 INFO L273 TraceCheckUtils]: 105: Hoare triple {40502#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40502#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:25,233 INFO L273 TraceCheckUtils]: 106: Hoare triple {40502#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40502#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:25,234 INFO L273 TraceCheckUtils]: 107: Hoare triple {40502#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {40503#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:25,234 INFO L273 TraceCheckUtils]: 108: Hoare triple {40503#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40503#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:25,235 INFO L273 TraceCheckUtils]: 109: Hoare triple {40503#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40503#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:25,235 INFO L273 TraceCheckUtils]: 110: Hoare triple {40503#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {40504#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:25,236 INFO L273 TraceCheckUtils]: 111: Hoare triple {40504#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40504#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:25,236 INFO L273 TraceCheckUtils]: 112: Hoare triple {40504#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40504#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:25,237 INFO L273 TraceCheckUtils]: 113: Hoare triple {40504#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {40505#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:25,238 INFO L273 TraceCheckUtils]: 114: Hoare triple {40505#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40505#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:25,238 INFO L273 TraceCheckUtils]: 115: Hoare triple {40505#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40505#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:25,239 INFO L273 TraceCheckUtils]: 116: Hoare triple {40505#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {40506#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:25,239 INFO L273 TraceCheckUtils]: 117: Hoare triple {40506#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40506#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:25,240 INFO L273 TraceCheckUtils]: 118: Hoare triple {40506#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40506#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:25,240 INFO L273 TraceCheckUtils]: 119: Hoare triple {40506#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {40507#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:25,241 INFO L273 TraceCheckUtils]: 120: Hoare triple {40507#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40507#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:25,241 INFO L273 TraceCheckUtils]: 121: Hoare triple {40507#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40507#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:25,242 INFO L273 TraceCheckUtils]: 122: Hoare triple {40507#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {40508#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:25,243 INFO L273 TraceCheckUtils]: 123: Hoare triple {40508#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40508#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:25,243 INFO L273 TraceCheckUtils]: 124: Hoare triple {40508#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40508#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:25,244 INFO L273 TraceCheckUtils]: 125: Hoare triple {40508#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {40509#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:25,244 INFO L273 TraceCheckUtils]: 126: Hoare triple {40509#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40509#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:25,245 INFO L273 TraceCheckUtils]: 127: Hoare triple {40509#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40509#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:25,245 INFO L273 TraceCheckUtils]: 128: Hoare triple {40509#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {40510#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:25,246 INFO L273 TraceCheckUtils]: 129: Hoare triple {40510#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40510#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:25,246 INFO L273 TraceCheckUtils]: 130: Hoare triple {40510#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40510#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:25,247 INFO L273 TraceCheckUtils]: 131: Hoare triple {40510#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {40511#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:25,248 INFO L273 TraceCheckUtils]: 132: Hoare triple {40511#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40511#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:25,248 INFO L273 TraceCheckUtils]: 133: Hoare triple {40511#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40511#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:25,249 INFO L273 TraceCheckUtils]: 134: Hoare triple {40511#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {40512#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:25,249 INFO L273 TraceCheckUtils]: 135: Hoare triple {40512#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40512#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:25,250 INFO L273 TraceCheckUtils]: 136: Hoare triple {40512#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40512#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:25,251 INFO L273 TraceCheckUtils]: 137: Hoare triple {40512#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {40513#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:25,251 INFO L273 TraceCheckUtils]: 138: Hoare triple {40513#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40513#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:25,251 INFO L273 TraceCheckUtils]: 139: Hoare triple {40513#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40513#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:25,252 INFO L273 TraceCheckUtils]: 140: Hoare triple {40513#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {40514#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:25,253 INFO L273 TraceCheckUtils]: 141: Hoare triple {40514#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40514#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:25,253 INFO L273 TraceCheckUtils]: 142: Hoare triple {40514#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40514#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:25,254 INFO L273 TraceCheckUtils]: 143: Hoare triple {40514#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {40515#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:25,254 INFO L273 TraceCheckUtils]: 144: Hoare triple {40515#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40515#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:25,255 INFO L273 TraceCheckUtils]: 145: Hoare triple {40515#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40515#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:25,256 INFO L273 TraceCheckUtils]: 146: Hoare triple {40515#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {40516#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:25,256 INFO L273 TraceCheckUtils]: 147: Hoare triple {40516#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40516#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:25,257 INFO L273 TraceCheckUtils]: 148: Hoare triple {40516#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40516#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:25,257 INFO L273 TraceCheckUtils]: 149: Hoare triple {40516#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {40517#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:25,258 INFO L273 TraceCheckUtils]: 150: Hoare triple {40517#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40517#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:25,258 INFO L273 TraceCheckUtils]: 151: Hoare triple {40517#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40517#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:25,259 INFO L273 TraceCheckUtils]: 152: Hoare triple {40517#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {40518#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:25,259 INFO L273 TraceCheckUtils]: 153: Hoare triple {40518#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40518#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:25,260 INFO L273 TraceCheckUtils]: 154: Hoare triple {40518#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40518#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:25,261 INFO L273 TraceCheckUtils]: 155: Hoare triple {40518#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {40519#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:25,261 INFO L273 TraceCheckUtils]: 156: Hoare triple {40519#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40519#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:25,262 INFO L273 TraceCheckUtils]: 157: Hoare triple {40519#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40519#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:25,262 INFO L273 TraceCheckUtils]: 158: Hoare triple {40519#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {40520#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:25,263 INFO L273 TraceCheckUtils]: 159: Hoare triple {40520#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40520#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:25,263 INFO L273 TraceCheckUtils]: 160: Hoare triple {40520#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {40520#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:25,264 INFO L273 TraceCheckUtils]: 161: Hoare triple {40520#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {40521#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:25,265 INFO L273 TraceCheckUtils]: 162: Hoare triple {40521#(<= main_~i~0 52)} assume !(~i~0 < 100000); {40468#false} is VALID [2018-11-23 11:57:25,265 INFO L273 TraceCheckUtils]: 163: Hoare triple {40468#false} havoc ~x~0;~x~0 := 0; {40468#false} is VALID [2018-11-23 11:57:25,265 INFO L273 TraceCheckUtils]: 164: Hoare triple {40468#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {40468#false} is VALID [2018-11-23 11:57:25,265 INFO L256 TraceCheckUtils]: 165: Hoare triple {40468#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {40468#false} is VALID [2018-11-23 11:57:25,265 INFO L273 TraceCheckUtils]: 166: Hoare triple {40468#false} ~cond := #in~cond; {40468#false} is VALID [2018-11-23 11:57:25,266 INFO L273 TraceCheckUtils]: 167: Hoare triple {40468#false} assume 0 == ~cond; {40468#false} is VALID [2018-11-23 11:57:25,266 INFO L273 TraceCheckUtils]: 168: Hoare triple {40468#false} assume !false; {40468#false} is VALID [2018-11-23 11:57:25,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 0 proven. 4030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:25,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:25,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2018-11-23 11:57:25,306 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 169 [2018-11-23 11:57:25,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:25,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states. [2018-11-23 11:57:25,492 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:25,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-11-23 11:57:25,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-23 11:57:25,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-11-23 11:57:25,493 INFO L87 Difference]: Start difference. First operand 174 states and 227 transitions. Second operand 56 states. [2018-11-23 11:57:27,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:27,048 INFO L93 Difference]: Finished difference Result 190 states and 246 transitions. [2018-11-23 11:57:27,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-23 11:57:27,048 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 169 [2018-11-23 11:57:27,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:27,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 11:57:27,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 246 transitions. [2018-11-23 11:57:27,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 11:57:27,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 246 transitions. [2018-11-23 11:57:27,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 246 transitions. [2018-11-23 11:57:27,287 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:27,291 INFO L225 Difference]: With dead ends: 190 [2018-11-23 11:57:27,291 INFO L226 Difference]: Without dead ends: 179 [2018-11-23 11:57:27,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-11-23 11:57:27,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-23 11:57:27,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2018-11-23 11:57:27,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:27,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand 177 states. [2018-11-23 11:57:27,334 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand 177 states. [2018-11-23 11:57:27,334 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 177 states. [2018-11-23 11:57:27,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:27,337 INFO L93 Difference]: Finished difference Result 179 states and 234 transitions. [2018-11-23 11:57:27,337 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 234 transitions. [2018-11-23 11:57:27,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:27,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:27,337 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 179 states. [2018-11-23 11:57:27,337 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 179 states. [2018-11-23 11:57:27,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:27,339 INFO L93 Difference]: Finished difference Result 179 states and 234 transitions. [2018-11-23 11:57:27,340 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 234 transitions. [2018-11-23 11:57:27,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:27,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:27,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:27,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:27,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-23 11:57:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 231 transitions. [2018-11-23 11:57:27,342 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 231 transitions. Word has length 169 [2018-11-23 11:57:27,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:27,342 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 231 transitions. [2018-11-23 11:57:27,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-11-23 11:57:27,343 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 231 transitions. [2018-11-23 11:57:27,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-23 11:57:27,343 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:27,343 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:27,343 INFO L423 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:27,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:27,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1177423005, now seen corresponding path program 53 times [2018-11-23 11:57:27,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:27,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:27,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:27,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:27,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:28,670 INFO L256 TraceCheckUtils]: 0: Hoare triple {41879#true} call ULTIMATE.init(); {41879#true} is VALID [2018-11-23 11:57:28,670 INFO L273 TraceCheckUtils]: 1: Hoare triple {41879#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {41879#true} is VALID [2018-11-23 11:57:28,670 INFO L273 TraceCheckUtils]: 2: Hoare triple {41879#true} assume true; {41879#true} is VALID [2018-11-23 11:57:28,671 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {41879#true} {41879#true} #55#return; {41879#true} is VALID [2018-11-23 11:57:28,671 INFO L256 TraceCheckUtils]: 4: Hoare triple {41879#true} call #t~ret4 := main(); {41879#true} is VALID [2018-11-23 11:57:28,671 INFO L273 TraceCheckUtils]: 5: Hoare triple {41879#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {41881#(= main_~i~0 0)} is VALID [2018-11-23 11:57:28,672 INFO L273 TraceCheckUtils]: 6: Hoare triple {41881#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41881#(= main_~i~0 0)} is VALID [2018-11-23 11:57:28,672 INFO L273 TraceCheckUtils]: 7: Hoare triple {41881#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41881#(= main_~i~0 0)} is VALID [2018-11-23 11:57:28,673 INFO L273 TraceCheckUtils]: 8: Hoare triple {41881#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {41882#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:28,674 INFO L273 TraceCheckUtils]: 9: Hoare triple {41882#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41882#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:28,674 INFO L273 TraceCheckUtils]: 10: Hoare triple {41882#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41882#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:28,675 INFO L273 TraceCheckUtils]: 11: Hoare triple {41882#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {41883#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:28,675 INFO L273 TraceCheckUtils]: 12: Hoare triple {41883#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41883#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:28,676 INFO L273 TraceCheckUtils]: 13: Hoare triple {41883#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41883#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:28,676 INFO L273 TraceCheckUtils]: 14: Hoare triple {41883#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {41884#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:28,677 INFO L273 TraceCheckUtils]: 15: Hoare triple {41884#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41884#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:28,677 INFO L273 TraceCheckUtils]: 16: Hoare triple {41884#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41884#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:28,678 INFO L273 TraceCheckUtils]: 17: Hoare triple {41884#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {41885#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:28,679 INFO L273 TraceCheckUtils]: 18: Hoare triple {41885#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41885#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:28,679 INFO L273 TraceCheckUtils]: 19: Hoare triple {41885#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41885#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:28,680 INFO L273 TraceCheckUtils]: 20: Hoare triple {41885#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {41886#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:28,680 INFO L273 TraceCheckUtils]: 21: Hoare triple {41886#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41886#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:28,681 INFO L273 TraceCheckUtils]: 22: Hoare triple {41886#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41886#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:28,682 INFO L273 TraceCheckUtils]: 23: Hoare triple {41886#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {41887#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:28,682 INFO L273 TraceCheckUtils]: 24: Hoare triple {41887#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41887#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:28,683 INFO L273 TraceCheckUtils]: 25: Hoare triple {41887#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41887#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:28,683 INFO L273 TraceCheckUtils]: 26: Hoare triple {41887#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {41888#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:28,684 INFO L273 TraceCheckUtils]: 27: Hoare triple {41888#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41888#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:28,684 INFO L273 TraceCheckUtils]: 28: Hoare triple {41888#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41888#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:28,685 INFO L273 TraceCheckUtils]: 29: Hoare triple {41888#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {41889#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:28,686 INFO L273 TraceCheckUtils]: 30: Hoare triple {41889#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41889#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:28,686 INFO L273 TraceCheckUtils]: 31: Hoare triple {41889#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41889#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:28,687 INFO L273 TraceCheckUtils]: 32: Hoare triple {41889#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {41890#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:28,687 INFO L273 TraceCheckUtils]: 33: Hoare triple {41890#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41890#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:28,688 INFO L273 TraceCheckUtils]: 34: Hoare triple {41890#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41890#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:28,688 INFO L273 TraceCheckUtils]: 35: Hoare triple {41890#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {41891#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:28,689 INFO L273 TraceCheckUtils]: 36: Hoare triple {41891#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41891#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:28,689 INFO L273 TraceCheckUtils]: 37: Hoare triple {41891#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41891#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:28,690 INFO L273 TraceCheckUtils]: 38: Hoare triple {41891#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {41892#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:28,691 INFO L273 TraceCheckUtils]: 39: Hoare triple {41892#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41892#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:28,691 INFO L273 TraceCheckUtils]: 40: Hoare triple {41892#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41892#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:28,692 INFO L273 TraceCheckUtils]: 41: Hoare triple {41892#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {41893#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:28,692 INFO L273 TraceCheckUtils]: 42: Hoare triple {41893#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41893#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:28,693 INFO L273 TraceCheckUtils]: 43: Hoare triple {41893#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41893#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:28,694 INFO L273 TraceCheckUtils]: 44: Hoare triple {41893#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {41894#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:28,694 INFO L273 TraceCheckUtils]: 45: Hoare triple {41894#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41894#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:28,695 INFO L273 TraceCheckUtils]: 46: Hoare triple {41894#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41894#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:28,695 INFO L273 TraceCheckUtils]: 47: Hoare triple {41894#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {41895#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:28,696 INFO L273 TraceCheckUtils]: 48: Hoare triple {41895#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41895#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:28,696 INFO L273 TraceCheckUtils]: 49: Hoare triple {41895#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41895#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:28,697 INFO L273 TraceCheckUtils]: 50: Hoare triple {41895#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {41896#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:28,698 INFO L273 TraceCheckUtils]: 51: Hoare triple {41896#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41896#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:28,698 INFO L273 TraceCheckUtils]: 52: Hoare triple {41896#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41896#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:28,699 INFO L273 TraceCheckUtils]: 53: Hoare triple {41896#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {41897#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:28,699 INFO L273 TraceCheckUtils]: 54: Hoare triple {41897#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41897#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:28,700 INFO L273 TraceCheckUtils]: 55: Hoare triple {41897#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41897#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:28,700 INFO L273 TraceCheckUtils]: 56: Hoare triple {41897#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {41898#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:28,701 INFO L273 TraceCheckUtils]: 57: Hoare triple {41898#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41898#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:28,701 INFO L273 TraceCheckUtils]: 58: Hoare triple {41898#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41898#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:28,702 INFO L273 TraceCheckUtils]: 59: Hoare triple {41898#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {41899#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:28,703 INFO L273 TraceCheckUtils]: 60: Hoare triple {41899#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41899#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:28,703 INFO L273 TraceCheckUtils]: 61: Hoare triple {41899#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41899#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:28,704 INFO L273 TraceCheckUtils]: 62: Hoare triple {41899#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {41900#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:28,704 INFO L273 TraceCheckUtils]: 63: Hoare triple {41900#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41900#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:28,705 INFO L273 TraceCheckUtils]: 64: Hoare triple {41900#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41900#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:28,706 INFO L273 TraceCheckUtils]: 65: Hoare triple {41900#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {41901#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:28,706 INFO L273 TraceCheckUtils]: 66: Hoare triple {41901#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41901#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:28,707 INFO L273 TraceCheckUtils]: 67: Hoare triple {41901#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41901#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:28,707 INFO L273 TraceCheckUtils]: 68: Hoare triple {41901#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {41902#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:28,708 INFO L273 TraceCheckUtils]: 69: Hoare triple {41902#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41902#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:28,708 INFO L273 TraceCheckUtils]: 70: Hoare triple {41902#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41902#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:28,709 INFO L273 TraceCheckUtils]: 71: Hoare triple {41902#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {41903#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:28,710 INFO L273 TraceCheckUtils]: 72: Hoare triple {41903#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41903#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:28,710 INFO L273 TraceCheckUtils]: 73: Hoare triple {41903#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41903#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:28,711 INFO L273 TraceCheckUtils]: 74: Hoare triple {41903#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {41904#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:28,711 INFO L273 TraceCheckUtils]: 75: Hoare triple {41904#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41904#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:28,712 INFO L273 TraceCheckUtils]: 76: Hoare triple {41904#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41904#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:28,713 INFO L273 TraceCheckUtils]: 77: Hoare triple {41904#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {41905#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:28,713 INFO L273 TraceCheckUtils]: 78: Hoare triple {41905#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41905#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:28,714 INFO L273 TraceCheckUtils]: 79: Hoare triple {41905#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41905#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:28,714 INFO L273 TraceCheckUtils]: 80: Hoare triple {41905#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {41906#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:28,715 INFO L273 TraceCheckUtils]: 81: Hoare triple {41906#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41906#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:28,715 INFO L273 TraceCheckUtils]: 82: Hoare triple {41906#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41906#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:28,716 INFO L273 TraceCheckUtils]: 83: Hoare triple {41906#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {41907#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:28,717 INFO L273 TraceCheckUtils]: 84: Hoare triple {41907#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41907#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:28,717 INFO L273 TraceCheckUtils]: 85: Hoare triple {41907#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41907#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:28,718 INFO L273 TraceCheckUtils]: 86: Hoare triple {41907#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {41908#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:28,718 INFO L273 TraceCheckUtils]: 87: Hoare triple {41908#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41908#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:28,719 INFO L273 TraceCheckUtils]: 88: Hoare triple {41908#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41908#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:28,719 INFO L273 TraceCheckUtils]: 89: Hoare triple {41908#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {41909#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:28,720 INFO L273 TraceCheckUtils]: 90: Hoare triple {41909#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41909#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:28,720 INFO L273 TraceCheckUtils]: 91: Hoare triple {41909#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41909#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:28,721 INFO L273 TraceCheckUtils]: 92: Hoare triple {41909#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {41910#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:28,722 INFO L273 TraceCheckUtils]: 93: Hoare triple {41910#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41910#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:28,722 INFO L273 TraceCheckUtils]: 94: Hoare triple {41910#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41910#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:28,723 INFO L273 TraceCheckUtils]: 95: Hoare triple {41910#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {41911#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:28,723 INFO L273 TraceCheckUtils]: 96: Hoare triple {41911#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41911#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:28,724 INFO L273 TraceCheckUtils]: 97: Hoare triple {41911#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41911#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:28,725 INFO L273 TraceCheckUtils]: 98: Hoare triple {41911#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {41912#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:28,725 INFO L273 TraceCheckUtils]: 99: Hoare triple {41912#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41912#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:28,726 INFO L273 TraceCheckUtils]: 100: Hoare triple {41912#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41912#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:28,726 INFO L273 TraceCheckUtils]: 101: Hoare triple {41912#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {41913#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:28,727 INFO L273 TraceCheckUtils]: 102: Hoare triple {41913#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41913#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:28,727 INFO L273 TraceCheckUtils]: 103: Hoare triple {41913#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41913#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:28,728 INFO L273 TraceCheckUtils]: 104: Hoare triple {41913#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {41914#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:28,729 INFO L273 TraceCheckUtils]: 105: Hoare triple {41914#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41914#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:28,729 INFO L273 TraceCheckUtils]: 106: Hoare triple {41914#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41914#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:28,730 INFO L273 TraceCheckUtils]: 107: Hoare triple {41914#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {41915#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:28,730 INFO L273 TraceCheckUtils]: 108: Hoare triple {41915#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41915#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:28,731 INFO L273 TraceCheckUtils]: 109: Hoare triple {41915#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41915#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:28,731 INFO L273 TraceCheckUtils]: 110: Hoare triple {41915#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {41916#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:28,732 INFO L273 TraceCheckUtils]: 111: Hoare triple {41916#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41916#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:28,732 INFO L273 TraceCheckUtils]: 112: Hoare triple {41916#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41916#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:28,733 INFO L273 TraceCheckUtils]: 113: Hoare triple {41916#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {41917#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:28,734 INFO L273 TraceCheckUtils]: 114: Hoare triple {41917#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41917#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:28,734 INFO L273 TraceCheckUtils]: 115: Hoare triple {41917#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41917#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:28,735 INFO L273 TraceCheckUtils]: 116: Hoare triple {41917#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {41918#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:28,735 INFO L273 TraceCheckUtils]: 117: Hoare triple {41918#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41918#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:28,736 INFO L273 TraceCheckUtils]: 118: Hoare triple {41918#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41918#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:28,736 INFO L273 TraceCheckUtils]: 119: Hoare triple {41918#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {41919#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:28,737 INFO L273 TraceCheckUtils]: 120: Hoare triple {41919#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41919#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:28,737 INFO L273 TraceCheckUtils]: 121: Hoare triple {41919#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41919#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:28,738 INFO L273 TraceCheckUtils]: 122: Hoare triple {41919#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {41920#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:28,739 INFO L273 TraceCheckUtils]: 123: Hoare triple {41920#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41920#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:28,739 INFO L273 TraceCheckUtils]: 124: Hoare triple {41920#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41920#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:28,740 INFO L273 TraceCheckUtils]: 125: Hoare triple {41920#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {41921#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:28,740 INFO L273 TraceCheckUtils]: 126: Hoare triple {41921#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41921#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:28,741 INFO L273 TraceCheckUtils]: 127: Hoare triple {41921#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41921#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:28,742 INFO L273 TraceCheckUtils]: 128: Hoare triple {41921#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {41922#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:28,742 INFO L273 TraceCheckUtils]: 129: Hoare triple {41922#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41922#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:28,743 INFO L273 TraceCheckUtils]: 130: Hoare triple {41922#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41922#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:28,743 INFO L273 TraceCheckUtils]: 131: Hoare triple {41922#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {41923#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:28,744 INFO L273 TraceCheckUtils]: 132: Hoare triple {41923#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41923#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:28,744 INFO L273 TraceCheckUtils]: 133: Hoare triple {41923#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41923#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:28,745 INFO L273 TraceCheckUtils]: 134: Hoare triple {41923#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {41924#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:28,746 INFO L273 TraceCheckUtils]: 135: Hoare triple {41924#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41924#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:28,746 INFO L273 TraceCheckUtils]: 136: Hoare triple {41924#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41924#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:28,747 INFO L273 TraceCheckUtils]: 137: Hoare triple {41924#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {41925#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:28,747 INFO L273 TraceCheckUtils]: 138: Hoare triple {41925#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41925#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:28,748 INFO L273 TraceCheckUtils]: 139: Hoare triple {41925#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41925#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:28,748 INFO L273 TraceCheckUtils]: 140: Hoare triple {41925#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {41926#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:28,749 INFO L273 TraceCheckUtils]: 141: Hoare triple {41926#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41926#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:28,749 INFO L273 TraceCheckUtils]: 142: Hoare triple {41926#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41926#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:28,750 INFO L273 TraceCheckUtils]: 143: Hoare triple {41926#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {41927#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:28,751 INFO L273 TraceCheckUtils]: 144: Hoare triple {41927#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41927#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:28,751 INFO L273 TraceCheckUtils]: 145: Hoare triple {41927#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41927#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:28,752 INFO L273 TraceCheckUtils]: 146: Hoare triple {41927#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {41928#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:28,752 INFO L273 TraceCheckUtils]: 147: Hoare triple {41928#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41928#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:28,753 INFO L273 TraceCheckUtils]: 148: Hoare triple {41928#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41928#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:28,754 INFO L273 TraceCheckUtils]: 149: Hoare triple {41928#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {41929#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:28,754 INFO L273 TraceCheckUtils]: 150: Hoare triple {41929#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41929#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:28,755 INFO L273 TraceCheckUtils]: 151: Hoare triple {41929#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41929#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:28,755 INFO L273 TraceCheckUtils]: 152: Hoare triple {41929#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {41930#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:28,756 INFO L273 TraceCheckUtils]: 153: Hoare triple {41930#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41930#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:28,756 INFO L273 TraceCheckUtils]: 154: Hoare triple {41930#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41930#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:28,757 INFO L273 TraceCheckUtils]: 155: Hoare triple {41930#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {41931#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:28,758 INFO L273 TraceCheckUtils]: 156: Hoare triple {41931#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41931#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:28,758 INFO L273 TraceCheckUtils]: 157: Hoare triple {41931#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41931#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:28,759 INFO L273 TraceCheckUtils]: 158: Hoare triple {41931#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {41932#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:28,759 INFO L273 TraceCheckUtils]: 159: Hoare triple {41932#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41932#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:28,760 INFO L273 TraceCheckUtils]: 160: Hoare triple {41932#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41932#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:28,760 INFO L273 TraceCheckUtils]: 161: Hoare triple {41932#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {41933#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:28,761 INFO L273 TraceCheckUtils]: 162: Hoare triple {41933#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41933#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:28,762 INFO L273 TraceCheckUtils]: 163: Hoare triple {41933#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41933#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:28,762 INFO L273 TraceCheckUtils]: 164: Hoare triple {41933#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {41934#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:28,763 INFO L273 TraceCheckUtils]: 165: Hoare triple {41934#(<= main_~i~0 53)} assume !(~i~0 < 100000); {41880#false} is VALID [2018-11-23 11:57:28,763 INFO L273 TraceCheckUtils]: 166: Hoare triple {41880#false} havoc ~x~0;~x~0 := 0; {41880#false} is VALID [2018-11-23 11:57:28,763 INFO L273 TraceCheckUtils]: 167: Hoare triple {41880#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {41880#false} is VALID [2018-11-23 11:57:28,763 INFO L256 TraceCheckUtils]: 168: Hoare triple {41880#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {41880#false} is VALID [2018-11-23 11:57:28,764 INFO L273 TraceCheckUtils]: 169: Hoare triple {41880#false} ~cond := #in~cond; {41880#false} is VALID [2018-11-23 11:57:28,764 INFO L273 TraceCheckUtils]: 170: Hoare triple {41880#false} assume 0 == ~cond; {41880#false} is VALID [2018-11-23 11:57:28,764 INFO L273 TraceCheckUtils]: 171: Hoare triple {41880#false} assume !false; {41880#false} is VALID [2018-11-23 11:57:28,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 0 proven. 4187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:28,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:28,784 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:28,793 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:57:28,924 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-11-23 11:57:28,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:57:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:28,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:29,349 INFO L256 TraceCheckUtils]: 0: Hoare triple {41879#true} call ULTIMATE.init(); {41879#true} is VALID [2018-11-23 11:57:29,349 INFO L273 TraceCheckUtils]: 1: Hoare triple {41879#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {41879#true} is VALID [2018-11-23 11:57:29,349 INFO L273 TraceCheckUtils]: 2: Hoare triple {41879#true} assume true; {41879#true} is VALID [2018-11-23 11:57:29,349 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {41879#true} {41879#true} #55#return; {41879#true} is VALID [2018-11-23 11:57:29,350 INFO L256 TraceCheckUtils]: 4: Hoare triple {41879#true} call #t~ret4 := main(); {41879#true} is VALID [2018-11-23 11:57:29,350 INFO L273 TraceCheckUtils]: 5: Hoare triple {41879#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {41953#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:29,351 INFO L273 TraceCheckUtils]: 6: Hoare triple {41953#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41953#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:29,351 INFO L273 TraceCheckUtils]: 7: Hoare triple {41953#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41953#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:29,352 INFO L273 TraceCheckUtils]: 8: Hoare triple {41953#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {41882#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:29,352 INFO L273 TraceCheckUtils]: 9: Hoare triple {41882#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41882#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:29,352 INFO L273 TraceCheckUtils]: 10: Hoare triple {41882#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41882#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:29,353 INFO L273 TraceCheckUtils]: 11: Hoare triple {41882#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {41883#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:29,353 INFO L273 TraceCheckUtils]: 12: Hoare triple {41883#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41883#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:29,353 INFO L273 TraceCheckUtils]: 13: Hoare triple {41883#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41883#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:29,354 INFO L273 TraceCheckUtils]: 14: Hoare triple {41883#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {41884#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:29,354 INFO L273 TraceCheckUtils]: 15: Hoare triple {41884#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41884#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:29,354 INFO L273 TraceCheckUtils]: 16: Hoare triple {41884#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41884#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:29,355 INFO L273 TraceCheckUtils]: 17: Hoare triple {41884#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {41885#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:29,355 INFO L273 TraceCheckUtils]: 18: Hoare triple {41885#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41885#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:29,356 INFO L273 TraceCheckUtils]: 19: Hoare triple {41885#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41885#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:29,357 INFO L273 TraceCheckUtils]: 20: Hoare triple {41885#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {41886#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:29,357 INFO L273 TraceCheckUtils]: 21: Hoare triple {41886#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41886#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:29,358 INFO L273 TraceCheckUtils]: 22: Hoare triple {41886#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41886#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:29,358 INFO L273 TraceCheckUtils]: 23: Hoare triple {41886#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {41887#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:29,359 INFO L273 TraceCheckUtils]: 24: Hoare triple {41887#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41887#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:29,359 INFO L273 TraceCheckUtils]: 25: Hoare triple {41887#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41887#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:29,360 INFO L273 TraceCheckUtils]: 26: Hoare triple {41887#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {41888#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:29,360 INFO L273 TraceCheckUtils]: 27: Hoare triple {41888#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41888#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:29,361 INFO L273 TraceCheckUtils]: 28: Hoare triple {41888#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41888#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:29,361 INFO L273 TraceCheckUtils]: 29: Hoare triple {41888#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {41889#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:29,362 INFO L273 TraceCheckUtils]: 30: Hoare triple {41889#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41889#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:29,362 INFO L273 TraceCheckUtils]: 31: Hoare triple {41889#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41889#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:29,363 INFO L273 TraceCheckUtils]: 32: Hoare triple {41889#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {41890#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:29,363 INFO L273 TraceCheckUtils]: 33: Hoare triple {41890#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41890#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:29,364 INFO L273 TraceCheckUtils]: 34: Hoare triple {41890#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41890#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:29,365 INFO L273 TraceCheckUtils]: 35: Hoare triple {41890#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {41891#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:29,365 INFO L273 TraceCheckUtils]: 36: Hoare triple {41891#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41891#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:29,366 INFO L273 TraceCheckUtils]: 37: Hoare triple {41891#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41891#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:29,366 INFO L273 TraceCheckUtils]: 38: Hoare triple {41891#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {41892#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:29,367 INFO L273 TraceCheckUtils]: 39: Hoare triple {41892#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41892#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:29,367 INFO L273 TraceCheckUtils]: 40: Hoare triple {41892#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41892#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:29,368 INFO L273 TraceCheckUtils]: 41: Hoare triple {41892#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {41893#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:29,368 INFO L273 TraceCheckUtils]: 42: Hoare triple {41893#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41893#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:29,369 INFO L273 TraceCheckUtils]: 43: Hoare triple {41893#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41893#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:29,370 INFO L273 TraceCheckUtils]: 44: Hoare triple {41893#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {41894#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:29,370 INFO L273 TraceCheckUtils]: 45: Hoare triple {41894#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41894#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:29,371 INFO L273 TraceCheckUtils]: 46: Hoare triple {41894#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41894#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:29,371 INFO L273 TraceCheckUtils]: 47: Hoare triple {41894#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {41895#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:29,372 INFO L273 TraceCheckUtils]: 48: Hoare triple {41895#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41895#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:29,372 INFO L273 TraceCheckUtils]: 49: Hoare triple {41895#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41895#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:29,373 INFO L273 TraceCheckUtils]: 50: Hoare triple {41895#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {41896#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:29,373 INFO L273 TraceCheckUtils]: 51: Hoare triple {41896#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41896#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:29,374 INFO L273 TraceCheckUtils]: 52: Hoare triple {41896#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41896#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:29,374 INFO L273 TraceCheckUtils]: 53: Hoare triple {41896#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {41897#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:29,375 INFO L273 TraceCheckUtils]: 54: Hoare triple {41897#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41897#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:29,375 INFO L273 TraceCheckUtils]: 55: Hoare triple {41897#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41897#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:29,376 INFO L273 TraceCheckUtils]: 56: Hoare triple {41897#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {41898#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:29,376 INFO L273 TraceCheckUtils]: 57: Hoare triple {41898#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41898#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:29,377 INFO L273 TraceCheckUtils]: 58: Hoare triple {41898#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41898#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:29,378 INFO L273 TraceCheckUtils]: 59: Hoare triple {41898#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {41899#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:29,378 INFO L273 TraceCheckUtils]: 60: Hoare triple {41899#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41899#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:29,379 INFO L273 TraceCheckUtils]: 61: Hoare triple {41899#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41899#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:29,379 INFO L273 TraceCheckUtils]: 62: Hoare triple {41899#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {41900#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:29,380 INFO L273 TraceCheckUtils]: 63: Hoare triple {41900#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41900#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:29,380 INFO L273 TraceCheckUtils]: 64: Hoare triple {41900#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41900#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:29,381 INFO L273 TraceCheckUtils]: 65: Hoare triple {41900#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {41901#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:29,381 INFO L273 TraceCheckUtils]: 66: Hoare triple {41901#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41901#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:29,382 INFO L273 TraceCheckUtils]: 67: Hoare triple {41901#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41901#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:29,383 INFO L273 TraceCheckUtils]: 68: Hoare triple {41901#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {41902#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:29,383 INFO L273 TraceCheckUtils]: 69: Hoare triple {41902#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41902#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:29,384 INFO L273 TraceCheckUtils]: 70: Hoare triple {41902#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41902#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:29,384 INFO L273 TraceCheckUtils]: 71: Hoare triple {41902#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {41903#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:29,385 INFO L273 TraceCheckUtils]: 72: Hoare triple {41903#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41903#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:29,385 INFO L273 TraceCheckUtils]: 73: Hoare triple {41903#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41903#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:29,386 INFO L273 TraceCheckUtils]: 74: Hoare triple {41903#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {41904#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:29,386 INFO L273 TraceCheckUtils]: 75: Hoare triple {41904#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41904#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:29,387 INFO L273 TraceCheckUtils]: 76: Hoare triple {41904#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41904#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:29,388 INFO L273 TraceCheckUtils]: 77: Hoare triple {41904#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {41905#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:29,388 INFO L273 TraceCheckUtils]: 78: Hoare triple {41905#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41905#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:29,389 INFO L273 TraceCheckUtils]: 79: Hoare triple {41905#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41905#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:29,389 INFO L273 TraceCheckUtils]: 80: Hoare triple {41905#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {41906#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:29,390 INFO L273 TraceCheckUtils]: 81: Hoare triple {41906#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41906#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:29,390 INFO L273 TraceCheckUtils]: 82: Hoare triple {41906#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41906#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:29,391 INFO L273 TraceCheckUtils]: 83: Hoare triple {41906#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {41907#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:29,392 INFO L273 TraceCheckUtils]: 84: Hoare triple {41907#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41907#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:29,392 INFO L273 TraceCheckUtils]: 85: Hoare triple {41907#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41907#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:29,393 INFO L273 TraceCheckUtils]: 86: Hoare triple {41907#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {41908#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:29,393 INFO L273 TraceCheckUtils]: 87: Hoare triple {41908#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41908#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:29,394 INFO L273 TraceCheckUtils]: 88: Hoare triple {41908#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41908#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:29,394 INFO L273 TraceCheckUtils]: 89: Hoare triple {41908#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {41909#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:29,395 INFO L273 TraceCheckUtils]: 90: Hoare triple {41909#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41909#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:29,395 INFO L273 TraceCheckUtils]: 91: Hoare triple {41909#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41909#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:29,396 INFO L273 TraceCheckUtils]: 92: Hoare triple {41909#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {41910#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:29,397 INFO L273 TraceCheckUtils]: 93: Hoare triple {41910#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41910#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:29,397 INFO L273 TraceCheckUtils]: 94: Hoare triple {41910#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41910#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:29,398 INFO L273 TraceCheckUtils]: 95: Hoare triple {41910#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {41911#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:29,398 INFO L273 TraceCheckUtils]: 96: Hoare triple {41911#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41911#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:29,399 INFO L273 TraceCheckUtils]: 97: Hoare triple {41911#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41911#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:29,400 INFO L273 TraceCheckUtils]: 98: Hoare triple {41911#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {41912#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:29,400 INFO L273 TraceCheckUtils]: 99: Hoare triple {41912#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41912#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:29,401 INFO L273 TraceCheckUtils]: 100: Hoare triple {41912#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41912#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:29,401 INFO L273 TraceCheckUtils]: 101: Hoare triple {41912#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {41913#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:29,402 INFO L273 TraceCheckUtils]: 102: Hoare triple {41913#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41913#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:29,402 INFO L273 TraceCheckUtils]: 103: Hoare triple {41913#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41913#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:29,403 INFO L273 TraceCheckUtils]: 104: Hoare triple {41913#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {41914#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:29,403 INFO L273 TraceCheckUtils]: 105: Hoare triple {41914#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41914#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:29,404 INFO L273 TraceCheckUtils]: 106: Hoare triple {41914#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41914#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:29,405 INFO L273 TraceCheckUtils]: 107: Hoare triple {41914#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {41915#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:29,405 INFO L273 TraceCheckUtils]: 108: Hoare triple {41915#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41915#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:29,406 INFO L273 TraceCheckUtils]: 109: Hoare triple {41915#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41915#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:29,406 INFO L273 TraceCheckUtils]: 110: Hoare triple {41915#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {41916#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:29,407 INFO L273 TraceCheckUtils]: 111: Hoare triple {41916#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41916#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:29,407 INFO L273 TraceCheckUtils]: 112: Hoare triple {41916#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41916#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:29,408 INFO L273 TraceCheckUtils]: 113: Hoare triple {41916#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {41917#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:29,409 INFO L273 TraceCheckUtils]: 114: Hoare triple {41917#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41917#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:29,409 INFO L273 TraceCheckUtils]: 115: Hoare triple {41917#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41917#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:29,410 INFO L273 TraceCheckUtils]: 116: Hoare triple {41917#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {41918#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:29,410 INFO L273 TraceCheckUtils]: 117: Hoare triple {41918#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41918#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:29,411 INFO L273 TraceCheckUtils]: 118: Hoare triple {41918#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41918#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:29,411 INFO L273 TraceCheckUtils]: 119: Hoare triple {41918#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {41919#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:29,412 INFO L273 TraceCheckUtils]: 120: Hoare triple {41919#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41919#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:29,412 INFO L273 TraceCheckUtils]: 121: Hoare triple {41919#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41919#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:29,413 INFO L273 TraceCheckUtils]: 122: Hoare triple {41919#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {41920#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:29,414 INFO L273 TraceCheckUtils]: 123: Hoare triple {41920#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41920#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:29,414 INFO L273 TraceCheckUtils]: 124: Hoare triple {41920#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41920#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:29,415 INFO L273 TraceCheckUtils]: 125: Hoare triple {41920#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {41921#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:29,415 INFO L273 TraceCheckUtils]: 126: Hoare triple {41921#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41921#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:29,416 INFO L273 TraceCheckUtils]: 127: Hoare triple {41921#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41921#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:29,417 INFO L273 TraceCheckUtils]: 128: Hoare triple {41921#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {41922#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:29,417 INFO L273 TraceCheckUtils]: 129: Hoare triple {41922#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41922#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:29,418 INFO L273 TraceCheckUtils]: 130: Hoare triple {41922#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41922#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:29,418 INFO L273 TraceCheckUtils]: 131: Hoare triple {41922#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {41923#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:29,419 INFO L273 TraceCheckUtils]: 132: Hoare triple {41923#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41923#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:29,419 INFO L273 TraceCheckUtils]: 133: Hoare triple {41923#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41923#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:29,420 INFO L273 TraceCheckUtils]: 134: Hoare triple {41923#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {41924#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:29,420 INFO L273 TraceCheckUtils]: 135: Hoare triple {41924#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41924#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:29,421 INFO L273 TraceCheckUtils]: 136: Hoare triple {41924#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41924#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:29,422 INFO L273 TraceCheckUtils]: 137: Hoare triple {41924#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {41925#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:29,422 INFO L273 TraceCheckUtils]: 138: Hoare triple {41925#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41925#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:29,423 INFO L273 TraceCheckUtils]: 139: Hoare triple {41925#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41925#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:29,423 INFO L273 TraceCheckUtils]: 140: Hoare triple {41925#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {41926#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:29,424 INFO L273 TraceCheckUtils]: 141: Hoare triple {41926#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41926#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:29,424 INFO L273 TraceCheckUtils]: 142: Hoare triple {41926#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41926#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:29,425 INFO L273 TraceCheckUtils]: 143: Hoare triple {41926#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {41927#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:29,426 INFO L273 TraceCheckUtils]: 144: Hoare triple {41927#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41927#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:29,426 INFO L273 TraceCheckUtils]: 145: Hoare triple {41927#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41927#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:29,427 INFO L273 TraceCheckUtils]: 146: Hoare triple {41927#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {41928#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:29,427 INFO L273 TraceCheckUtils]: 147: Hoare triple {41928#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41928#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:29,428 INFO L273 TraceCheckUtils]: 148: Hoare triple {41928#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41928#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:29,428 INFO L273 TraceCheckUtils]: 149: Hoare triple {41928#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {41929#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:29,429 INFO L273 TraceCheckUtils]: 150: Hoare triple {41929#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41929#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:29,429 INFO L273 TraceCheckUtils]: 151: Hoare triple {41929#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41929#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:29,430 INFO L273 TraceCheckUtils]: 152: Hoare triple {41929#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {41930#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:29,430 INFO L273 TraceCheckUtils]: 153: Hoare triple {41930#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41930#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:29,431 INFO L273 TraceCheckUtils]: 154: Hoare triple {41930#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41930#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:29,431 INFO L273 TraceCheckUtils]: 155: Hoare triple {41930#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {41931#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:29,432 INFO L273 TraceCheckUtils]: 156: Hoare triple {41931#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41931#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:29,432 INFO L273 TraceCheckUtils]: 157: Hoare triple {41931#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41931#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:29,433 INFO L273 TraceCheckUtils]: 158: Hoare triple {41931#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {41932#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:29,434 INFO L273 TraceCheckUtils]: 159: Hoare triple {41932#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41932#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:29,434 INFO L273 TraceCheckUtils]: 160: Hoare triple {41932#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41932#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:29,435 INFO L273 TraceCheckUtils]: 161: Hoare triple {41932#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {41933#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:29,435 INFO L273 TraceCheckUtils]: 162: Hoare triple {41933#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41933#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:29,436 INFO L273 TraceCheckUtils]: 163: Hoare triple {41933#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {41933#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:29,436 INFO L273 TraceCheckUtils]: 164: Hoare triple {41933#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {41934#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:29,437 INFO L273 TraceCheckUtils]: 165: Hoare triple {41934#(<= main_~i~0 53)} assume !(~i~0 < 100000); {41880#false} is VALID [2018-11-23 11:57:29,437 INFO L273 TraceCheckUtils]: 166: Hoare triple {41880#false} havoc ~x~0;~x~0 := 0; {41880#false} is VALID [2018-11-23 11:57:29,437 INFO L273 TraceCheckUtils]: 167: Hoare triple {41880#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {41880#false} is VALID [2018-11-23 11:57:29,437 INFO L256 TraceCheckUtils]: 168: Hoare triple {41880#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {41880#false} is VALID [2018-11-23 11:57:29,438 INFO L273 TraceCheckUtils]: 169: Hoare triple {41880#false} ~cond := #in~cond; {41880#false} is VALID [2018-11-23 11:57:29,438 INFO L273 TraceCheckUtils]: 170: Hoare triple {41880#false} assume 0 == ~cond; {41880#false} is VALID [2018-11-23 11:57:29,438 INFO L273 TraceCheckUtils]: 171: Hoare triple {41880#false} assume !false; {41880#false} is VALID [2018-11-23 11:57:29,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 0 proven. 4187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:29,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:29,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 57 [2018-11-23 11:57:29,478 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 172 [2018-11-23 11:57:29,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:29,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states. [2018-11-23 11:57:29,641 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:29,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-11-23 11:57:29,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-23 11:57:29,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-23 11:57:29,643 INFO L87 Difference]: Start difference. First operand 177 states and 231 transitions. Second operand 57 states. [2018-11-23 11:57:30,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:30,933 INFO L93 Difference]: Finished difference Result 193 states and 250 transitions. [2018-11-23 11:57:30,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-23 11:57:30,933 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 172 [2018-11-23 11:57:30,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:30,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 11:57:30,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 250 transitions. [2018-11-23 11:57:30,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 11:57:30,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 250 transitions. [2018-11-23 11:57:30,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states and 250 transitions. [2018-11-23 11:57:31,174 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:31,178 INFO L225 Difference]: With dead ends: 193 [2018-11-23 11:57:31,178 INFO L226 Difference]: Without dead ends: 182 [2018-11-23 11:57:31,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-23 11:57:31,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-23 11:57:31,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2018-11-23 11:57:31,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:31,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand 180 states. [2018-11-23 11:57:31,751 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand 180 states. [2018-11-23 11:57:31,751 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 180 states. [2018-11-23 11:57:31,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:31,754 INFO L93 Difference]: Finished difference Result 182 states and 238 transitions. [2018-11-23 11:57:31,754 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 238 transitions. [2018-11-23 11:57:31,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:31,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:31,754 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand 182 states. [2018-11-23 11:57:31,754 INFO L87 Difference]: Start difference. First operand 180 states. Second operand 182 states. [2018-11-23 11:57:31,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:31,756 INFO L93 Difference]: Finished difference Result 182 states and 238 transitions. [2018-11-23 11:57:31,756 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 238 transitions. [2018-11-23 11:57:31,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:31,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:31,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:31,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:31,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-11-23 11:57:31,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 235 transitions. [2018-11-23 11:57:31,759 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 235 transitions. Word has length 172 [2018-11-23 11:57:31,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:31,759 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 235 transitions. [2018-11-23 11:57:31,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-11-23 11:57:31,760 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 235 transitions. [2018-11-23 11:57:31,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-23 11:57:31,760 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:31,760 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:31,761 INFO L423 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:31,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:31,761 INFO L82 PathProgramCache]: Analyzing trace with hash -565469703, now seen corresponding path program 54 times [2018-11-23 11:57:31,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:31,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:31,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:31,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:31,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:33,153 INFO L256 TraceCheckUtils]: 0: Hoare triple {43315#true} call ULTIMATE.init(); {43315#true} is VALID [2018-11-23 11:57:33,153 INFO L273 TraceCheckUtils]: 1: Hoare triple {43315#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {43315#true} is VALID [2018-11-23 11:57:33,153 INFO L273 TraceCheckUtils]: 2: Hoare triple {43315#true} assume true; {43315#true} is VALID [2018-11-23 11:57:33,154 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {43315#true} {43315#true} #55#return; {43315#true} is VALID [2018-11-23 11:57:33,154 INFO L256 TraceCheckUtils]: 4: Hoare triple {43315#true} call #t~ret4 := main(); {43315#true} is VALID [2018-11-23 11:57:33,154 INFO L273 TraceCheckUtils]: 5: Hoare triple {43315#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {43317#(= main_~i~0 0)} is VALID [2018-11-23 11:57:33,155 INFO L273 TraceCheckUtils]: 6: Hoare triple {43317#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43317#(= main_~i~0 0)} is VALID [2018-11-23 11:57:33,155 INFO L273 TraceCheckUtils]: 7: Hoare triple {43317#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43317#(= main_~i~0 0)} is VALID [2018-11-23 11:57:33,156 INFO L273 TraceCheckUtils]: 8: Hoare triple {43317#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {43318#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:33,156 INFO L273 TraceCheckUtils]: 9: Hoare triple {43318#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43318#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:33,157 INFO L273 TraceCheckUtils]: 10: Hoare triple {43318#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43318#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:33,158 INFO L273 TraceCheckUtils]: 11: Hoare triple {43318#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {43319#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:33,158 INFO L273 TraceCheckUtils]: 12: Hoare triple {43319#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43319#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:33,159 INFO L273 TraceCheckUtils]: 13: Hoare triple {43319#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43319#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:33,159 INFO L273 TraceCheckUtils]: 14: Hoare triple {43319#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {43320#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:33,160 INFO L273 TraceCheckUtils]: 15: Hoare triple {43320#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43320#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:33,160 INFO L273 TraceCheckUtils]: 16: Hoare triple {43320#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43320#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:33,161 INFO L273 TraceCheckUtils]: 17: Hoare triple {43320#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {43321#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:33,161 INFO L273 TraceCheckUtils]: 18: Hoare triple {43321#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43321#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:33,162 INFO L273 TraceCheckUtils]: 19: Hoare triple {43321#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43321#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:33,163 INFO L273 TraceCheckUtils]: 20: Hoare triple {43321#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {43322#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:33,163 INFO L273 TraceCheckUtils]: 21: Hoare triple {43322#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43322#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:33,163 INFO L273 TraceCheckUtils]: 22: Hoare triple {43322#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43322#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:33,164 INFO L273 TraceCheckUtils]: 23: Hoare triple {43322#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {43323#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:33,165 INFO L273 TraceCheckUtils]: 24: Hoare triple {43323#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43323#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:33,165 INFO L273 TraceCheckUtils]: 25: Hoare triple {43323#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43323#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:33,166 INFO L273 TraceCheckUtils]: 26: Hoare triple {43323#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {43324#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:33,166 INFO L273 TraceCheckUtils]: 27: Hoare triple {43324#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43324#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:33,167 INFO L273 TraceCheckUtils]: 28: Hoare triple {43324#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43324#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:33,167 INFO L273 TraceCheckUtils]: 29: Hoare triple {43324#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {43325#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:33,168 INFO L273 TraceCheckUtils]: 30: Hoare triple {43325#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43325#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:33,168 INFO L273 TraceCheckUtils]: 31: Hoare triple {43325#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43325#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:33,169 INFO L273 TraceCheckUtils]: 32: Hoare triple {43325#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {43326#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:33,169 INFO L273 TraceCheckUtils]: 33: Hoare triple {43326#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43326#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:33,170 INFO L273 TraceCheckUtils]: 34: Hoare triple {43326#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43326#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:33,171 INFO L273 TraceCheckUtils]: 35: Hoare triple {43326#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {43327#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:33,171 INFO L273 TraceCheckUtils]: 36: Hoare triple {43327#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43327#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:33,172 INFO L273 TraceCheckUtils]: 37: Hoare triple {43327#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43327#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:33,172 INFO L273 TraceCheckUtils]: 38: Hoare triple {43327#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {43328#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:33,173 INFO L273 TraceCheckUtils]: 39: Hoare triple {43328#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43328#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:33,173 INFO L273 TraceCheckUtils]: 40: Hoare triple {43328#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43328#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:33,174 INFO L273 TraceCheckUtils]: 41: Hoare triple {43328#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {43329#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:33,174 INFO L273 TraceCheckUtils]: 42: Hoare triple {43329#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43329#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:33,175 INFO L273 TraceCheckUtils]: 43: Hoare triple {43329#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43329#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:33,175 INFO L273 TraceCheckUtils]: 44: Hoare triple {43329#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {43330#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:33,176 INFO L273 TraceCheckUtils]: 45: Hoare triple {43330#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43330#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:33,176 INFO L273 TraceCheckUtils]: 46: Hoare triple {43330#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43330#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:33,177 INFO L273 TraceCheckUtils]: 47: Hoare triple {43330#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {43331#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:33,177 INFO L273 TraceCheckUtils]: 48: Hoare triple {43331#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43331#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:33,178 INFO L273 TraceCheckUtils]: 49: Hoare triple {43331#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43331#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:33,179 INFO L273 TraceCheckUtils]: 50: Hoare triple {43331#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {43332#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:33,179 INFO L273 TraceCheckUtils]: 51: Hoare triple {43332#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43332#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:33,179 INFO L273 TraceCheckUtils]: 52: Hoare triple {43332#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43332#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:33,180 INFO L273 TraceCheckUtils]: 53: Hoare triple {43332#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {43333#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:33,181 INFO L273 TraceCheckUtils]: 54: Hoare triple {43333#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43333#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:33,181 INFO L273 TraceCheckUtils]: 55: Hoare triple {43333#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43333#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:33,182 INFO L273 TraceCheckUtils]: 56: Hoare triple {43333#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {43334#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:33,182 INFO L273 TraceCheckUtils]: 57: Hoare triple {43334#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43334#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:33,183 INFO L273 TraceCheckUtils]: 58: Hoare triple {43334#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43334#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:33,183 INFO L273 TraceCheckUtils]: 59: Hoare triple {43334#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {43335#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:33,184 INFO L273 TraceCheckUtils]: 60: Hoare triple {43335#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43335#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:33,184 INFO L273 TraceCheckUtils]: 61: Hoare triple {43335#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43335#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:33,185 INFO L273 TraceCheckUtils]: 62: Hoare triple {43335#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {43336#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:33,185 INFO L273 TraceCheckUtils]: 63: Hoare triple {43336#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43336#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:33,186 INFO L273 TraceCheckUtils]: 64: Hoare triple {43336#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43336#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:33,186 INFO L273 TraceCheckUtils]: 65: Hoare triple {43336#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {43337#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:33,187 INFO L273 TraceCheckUtils]: 66: Hoare triple {43337#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43337#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:33,187 INFO L273 TraceCheckUtils]: 67: Hoare triple {43337#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43337#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:33,188 INFO L273 TraceCheckUtils]: 68: Hoare triple {43337#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {43338#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:33,189 INFO L273 TraceCheckUtils]: 69: Hoare triple {43338#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43338#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:33,189 INFO L273 TraceCheckUtils]: 70: Hoare triple {43338#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43338#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:33,190 INFO L273 TraceCheckUtils]: 71: Hoare triple {43338#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {43339#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:33,190 INFO L273 TraceCheckUtils]: 72: Hoare triple {43339#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43339#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:33,191 INFO L273 TraceCheckUtils]: 73: Hoare triple {43339#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43339#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:33,191 INFO L273 TraceCheckUtils]: 74: Hoare triple {43339#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {43340#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:33,192 INFO L273 TraceCheckUtils]: 75: Hoare triple {43340#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43340#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:33,192 INFO L273 TraceCheckUtils]: 76: Hoare triple {43340#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43340#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:33,193 INFO L273 TraceCheckUtils]: 77: Hoare triple {43340#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {43341#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:33,193 INFO L273 TraceCheckUtils]: 78: Hoare triple {43341#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43341#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:33,194 INFO L273 TraceCheckUtils]: 79: Hoare triple {43341#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43341#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:33,195 INFO L273 TraceCheckUtils]: 80: Hoare triple {43341#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {43342#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:33,195 INFO L273 TraceCheckUtils]: 81: Hoare triple {43342#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43342#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:33,195 INFO L273 TraceCheckUtils]: 82: Hoare triple {43342#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43342#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:33,196 INFO L273 TraceCheckUtils]: 83: Hoare triple {43342#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {43343#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:33,197 INFO L273 TraceCheckUtils]: 84: Hoare triple {43343#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43343#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:33,197 INFO L273 TraceCheckUtils]: 85: Hoare triple {43343#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43343#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:33,198 INFO L273 TraceCheckUtils]: 86: Hoare triple {43343#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {43344#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:33,198 INFO L273 TraceCheckUtils]: 87: Hoare triple {43344#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43344#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:33,199 INFO L273 TraceCheckUtils]: 88: Hoare triple {43344#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43344#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:33,199 INFO L273 TraceCheckUtils]: 89: Hoare triple {43344#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {43345#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:33,200 INFO L273 TraceCheckUtils]: 90: Hoare triple {43345#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43345#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:33,200 INFO L273 TraceCheckUtils]: 91: Hoare triple {43345#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43345#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:33,201 INFO L273 TraceCheckUtils]: 92: Hoare triple {43345#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {43346#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:33,201 INFO L273 TraceCheckUtils]: 93: Hoare triple {43346#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43346#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:33,202 INFO L273 TraceCheckUtils]: 94: Hoare triple {43346#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43346#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:33,202 INFO L273 TraceCheckUtils]: 95: Hoare triple {43346#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {43347#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:33,203 INFO L273 TraceCheckUtils]: 96: Hoare triple {43347#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43347#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:33,203 INFO L273 TraceCheckUtils]: 97: Hoare triple {43347#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43347#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:33,204 INFO L273 TraceCheckUtils]: 98: Hoare triple {43347#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {43348#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:33,205 INFO L273 TraceCheckUtils]: 99: Hoare triple {43348#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43348#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:33,205 INFO L273 TraceCheckUtils]: 100: Hoare triple {43348#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43348#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:33,206 INFO L273 TraceCheckUtils]: 101: Hoare triple {43348#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {43349#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:33,206 INFO L273 TraceCheckUtils]: 102: Hoare triple {43349#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43349#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:33,207 INFO L273 TraceCheckUtils]: 103: Hoare triple {43349#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43349#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:33,207 INFO L273 TraceCheckUtils]: 104: Hoare triple {43349#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {43350#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:33,208 INFO L273 TraceCheckUtils]: 105: Hoare triple {43350#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43350#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:33,208 INFO L273 TraceCheckUtils]: 106: Hoare triple {43350#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43350#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:33,209 INFO L273 TraceCheckUtils]: 107: Hoare triple {43350#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {43351#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:33,209 INFO L273 TraceCheckUtils]: 108: Hoare triple {43351#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43351#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:33,210 INFO L273 TraceCheckUtils]: 109: Hoare triple {43351#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43351#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:33,210 INFO L273 TraceCheckUtils]: 110: Hoare triple {43351#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {43352#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:33,211 INFO L273 TraceCheckUtils]: 111: Hoare triple {43352#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43352#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:33,211 INFO L273 TraceCheckUtils]: 112: Hoare triple {43352#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43352#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:33,212 INFO L273 TraceCheckUtils]: 113: Hoare triple {43352#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {43353#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:33,212 INFO L273 TraceCheckUtils]: 114: Hoare triple {43353#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43353#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:33,213 INFO L273 TraceCheckUtils]: 115: Hoare triple {43353#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43353#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:33,214 INFO L273 TraceCheckUtils]: 116: Hoare triple {43353#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {43354#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:33,214 INFO L273 TraceCheckUtils]: 117: Hoare triple {43354#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43354#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:33,215 INFO L273 TraceCheckUtils]: 118: Hoare triple {43354#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43354#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:33,215 INFO L273 TraceCheckUtils]: 119: Hoare triple {43354#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {43355#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:33,216 INFO L273 TraceCheckUtils]: 120: Hoare triple {43355#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43355#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:33,216 INFO L273 TraceCheckUtils]: 121: Hoare triple {43355#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43355#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:33,217 INFO L273 TraceCheckUtils]: 122: Hoare triple {43355#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {43356#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:33,217 INFO L273 TraceCheckUtils]: 123: Hoare triple {43356#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43356#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:33,218 INFO L273 TraceCheckUtils]: 124: Hoare triple {43356#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43356#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:33,218 INFO L273 TraceCheckUtils]: 125: Hoare triple {43356#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {43357#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:33,219 INFO L273 TraceCheckUtils]: 126: Hoare triple {43357#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43357#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:33,219 INFO L273 TraceCheckUtils]: 127: Hoare triple {43357#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43357#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:33,220 INFO L273 TraceCheckUtils]: 128: Hoare triple {43357#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {43358#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:33,220 INFO L273 TraceCheckUtils]: 129: Hoare triple {43358#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43358#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:33,221 INFO L273 TraceCheckUtils]: 130: Hoare triple {43358#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43358#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:33,222 INFO L273 TraceCheckUtils]: 131: Hoare triple {43358#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {43359#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:33,222 INFO L273 TraceCheckUtils]: 132: Hoare triple {43359#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43359#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:33,222 INFO L273 TraceCheckUtils]: 133: Hoare triple {43359#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43359#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:33,223 INFO L273 TraceCheckUtils]: 134: Hoare triple {43359#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {43360#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:33,224 INFO L273 TraceCheckUtils]: 135: Hoare triple {43360#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43360#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:33,224 INFO L273 TraceCheckUtils]: 136: Hoare triple {43360#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43360#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:33,225 INFO L273 TraceCheckUtils]: 137: Hoare triple {43360#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {43361#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:33,225 INFO L273 TraceCheckUtils]: 138: Hoare triple {43361#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43361#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:33,226 INFO L273 TraceCheckUtils]: 139: Hoare triple {43361#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43361#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:33,226 INFO L273 TraceCheckUtils]: 140: Hoare triple {43361#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {43362#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:33,227 INFO L273 TraceCheckUtils]: 141: Hoare triple {43362#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43362#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:33,227 INFO L273 TraceCheckUtils]: 142: Hoare triple {43362#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43362#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:33,228 INFO L273 TraceCheckUtils]: 143: Hoare triple {43362#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {43363#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:33,228 INFO L273 TraceCheckUtils]: 144: Hoare triple {43363#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43363#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:33,229 INFO L273 TraceCheckUtils]: 145: Hoare triple {43363#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43363#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:33,230 INFO L273 TraceCheckUtils]: 146: Hoare triple {43363#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {43364#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:33,230 INFO L273 TraceCheckUtils]: 147: Hoare triple {43364#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43364#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:33,230 INFO L273 TraceCheckUtils]: 148: Hoare triple {43364#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43364#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:33,231 INFO L273 TraceCheckUtils]: 149: Hoare triple {43364#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {43365#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:33,232 INFO L273 TraceCheckUtils]: 150: Hoare triple {43365#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43365#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:33,232 INFO L273 TraceCheckUtils]: 151: Hoare triple {43365#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43365#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:33,233 INFO L273 TraceCheckUtils]: 152: Hoare triple {43365#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {43366#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:33,233 INFO L273 TraceCheckUtils]: 153: Hoare triple {43366#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43366#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:33,234 INFO L273 TraceCheckUtils]: 154: Hoare triple {43366#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43366#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:33,234 INFO L273 TraceCheckUtils]: 155: Hoare triple {43366#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {43367#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:33,235 INFO L273 TraceCheckUtils]: 156: Hoare triple {43367#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43367#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:33,235 INFO L273 TraceCheckUtils]: 157: Hoare triple {43367#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43367#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:33,236 INFO L273 TraceCheckUtils]: 158: Hoare triple {43367#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {43368#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:33,236 INFO L273 TraceCheckUtils]: 159: Hoare triple {43368#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43368#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:33,237 INFO L273 TraceCheckUtils]: 160: Hoare triple {43368#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43368#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:33,238 INFO L273 TraceCheckUtils]: 161: Hoare triple {43368#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {43369#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:33,238 INFO L273 TraceCheckUtils]: 162: Hoare triple {43369#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43369#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:33,238 INFO L273 TraceCheckUtils]: 163: Hoare triple {43369#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43369#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:33,239 INFO L273 TraceCheckUtils]: 164: Hoare triple {43369#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {43370#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:33,240 INFO L273 TraceCheckUtils]: 165: Hoare triple {43370#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43370#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:33,240 INFO L273 TraceCheckUtils]: 166: Hoare triple {43370#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43370#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:33,241 INFO L273 TraceCheckUtils]: 167: Hoare triple {43370#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {43371#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:33,241 INFO L273 TraceCheckUtils]: 168: Hoare triple {43371#(<= main_~i~0 54)} assume !(~i~0 < 100000); {43316#false} is VALID [2018-11-23 11:57:33,242 INFO L273 TraceCheckUtils]: 169: Hoare triple {43316#false} havoc ~x~0;~x~0 := 0; {43316#false} is VALID [2018-11-23 11:57:33,242 INFO L273 TraceCheckUtils]: 170: Hoare triple {43316#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {43316#false} is VALID [2018-11-23 11:57:33,242 INFO L256 TraceCheckUtils]: 171: Hoare triple {43316#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {43316#false} is VALID [2018-11-23 11:57:33,242 INFO L273 TraceCheckUtils]: 172: Hoare triple {43316#false} ~cond := #in~cond; {43316#false} is VALID [2018-11-23 11:57:33,242 INFO L273 TraceCheckUtils]: 173: Hoare triple {43316#false} assume 0 == ~cond; {43316#false} is VALID [2018-11-23 11:57:33,242 INFO L273 TraceCheckUtils]: 174: Hoare triple {43316#false} assume !false; {43316#false} is VALID [2018-11-23 11:57:33,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:33,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:33,263 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:33,273 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:57:33,411 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-11-23 11:57:33,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:57:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:33,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:33,878 INFO L256 TraceCheckUtils]: 0: Hoare triple {43315#true} call ULTIMATE.init(); {43315#true} is VALID [2018-11-23 11:57:33,878 INFO L273 TraceCheckUtils]: 1: Hoare triple {43315#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {43315#true} is VALID [2018-11-23 11:57:33,878 INFO L273 TraceCheckUtils]: 2: Hoare triple {43315#true} assume true; {43315#true} is VALID [2018-11-23 11:57:33,879 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {43315#true} {43315#true} #55#return; {43315#true} is VALID [2018-11-23 11:57:33,879 INFO L256 TraceCheckUtils]: 4: Hoare triple {43315#true} call #t~ret4 := main(); {43315#true} is VALID [2018-11-23 11:57:33,879 INFO L273 TraceCheckUtils]: 5: Hoare triple {43315#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {43390#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:33,880 INFO L273 TraceCheckUtils]: 6: Hoare triple {43390#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43390#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:33,880 INFO L273 TraceCheckUtils]: 7: Hoare triple {43390#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43390#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:33,881 INFO L273 TraceCheckUtils]: 8: Hoare triple {43390#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {43318#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:33,881 INFO L273 TraceCheckUtils]: 9: Hoare triple {43318#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43318#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:33,881 INFO L273 TraceCheckUtils]: 10: Hoare triple {43318#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43318#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:33,882 INFO L273 TraceCheckUtils]: 11: Hoare triple {43318#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {43319#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:33,882 INFO L273 TraceCheckUtils]: 12: Hoare triple {43319#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43319#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:33,883 INFO L273 TraceCheckUtils]: 13: Hoare triple {43319#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43319#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:33,883 INFO L273 TraceCheckUtils]: 14: Hoare triple {43319#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {43320#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:33,884 INFO L273 TraceCheckUtils]: 15: Hoare triple {43320#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43320#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:33,884 INFO L273 TraceCheckUtils]: 16: Hoare triple {43320#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43320#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:33,885 INFO L273 TraceCheckUtils]: 17: Hoare triple {43320#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {43321#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:33,885 INFO L273 TraceCheckUtils]: 18: Hoare triple {43321#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43321#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:33,886 INFO L273 TraceCheckUtils]: 19: Hoare triple {43321#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43321#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:33,886 INFO L273 TraceCheckUtils]: 20: Hoare triple {43321#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {43322#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:33,887 INFO L273 TraceCheckUtils]: 21: Hoare triple {43322#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43322#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:33,887 INFO L273 TraceCheckUtils]: 22: Hoare triple {43322#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43322#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:33,888 INFO L273 TraceCheckUtils]: 23: Hoare triple {43322#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {43323#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:33,888 INFO L273 TraceCheckUtils]: 24: Hoare triple {43323#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43323#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:33,889 INFO L273 TraceCheckUtils]: 25: Hoare triple {43323#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43323#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:33,890 INFO L273 TraceCheckUtils]: 26: Hoare triple {43323#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {43324#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:33,890 INFO L273 TraceCheckUtils]: 27: Hoare triple {43324#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43324#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:33,890 INFO L273 TraceCheckUtils]: 28: Hoare triple {43324#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43324#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:33,891 INFO L273 TraceCheckUtils]: 29: Hoare triple {43324#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {43325#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:33,892 INFO L273 TraceCheckUtils]: 30: Hoare triple {43325#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43325#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:33,892 INFO L273 TraceCheckUtils]: 31: Hoare triple {43325#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43325#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:33,893 INFO L273 TraceCheckUtils]: 32: Hoare triple {43325#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {43326#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:33,893 INFO L273 TraceCheckUtils]: 33: Hoare triple {43326#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43326#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:33,894 INFO L273 TraceCheckUtils]: 34: Hoare triple {43326#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43326#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:33,894 INFO L273 TraceCheckUtils]: 35: Hoare triple {43326#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {43327#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:33,895 INFO L273 TraceCheckUtils]: 36: Hoare triple {43327#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43327#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:33,895 INFO L273 TraceCheckUtils]: 37: Hoare triple {43327#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43327#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:33,896 INFO L273 TraceCheckUtils]: 38: Hoare triple {43327#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {43328#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:33,896 INFO L273 TraceCheckUtils]: 39: Hoare triple {43328#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43328#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:33,897 INFO L273 TraceCheckUtils]: 40: Hoare triple {43328#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43328#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:33,898 INFO L273 TraceCheckUtils]: 41: Hoare triple {43328#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {43329#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:33,898 INFO L273 TraceCheckUtils]: 42: Hoare triple {43329#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43329#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:33,898 INFO L273 TraceCheckUtils]: 43: Hoare triple {43329#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43329#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:33,899 INFO L273 TraceCheckUtils]: 44: Hoare triple {43329#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {43330#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:33,900 INFO L273 TraceCheckUtils]: 45: Hoare triple {43330#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43330#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:33,900 INFO L273 TraceCheckUtils]: 46: Hoare triple {43330#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43330#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:33,901 INFO L273 TraceCheckUtils]: 47: Hoare triple {43330#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {43331#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:33,901 INFO L273 TraceCheckUtils]: 48: Hoare triple {43331#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43331#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:33,902 INFO L273 TraceCheckUtils]: 49: Hoare triple {43331#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43331#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:33,902 INFO L273 TraceCheckUtils]: 50: Hoare triple {43331#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {43332#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:33,903 INFO L273 TraceCheckUtils]: 51: Hoare triple {43332#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43332#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:33,903 INFO L273 TraceCheckUtils]: 52: Hoare triple {43332#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43332#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:33,904 INFO L273 TraceCheckUtils]: 53: Hoare triple {43332#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {43333#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:33,904 INFO L273 TraceCheckUtils]: 54: Hoare triple {43333#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43333#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:33,905 INFO L273 TraceCheckUtils]: 55: Hoare triple {43333#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43333#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:33,906 INFO L273 TraceCheckUtils]: 56: Hoare triple {43333#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {43334#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:33,906 INFO L273 TraceCheckUtils]: 57: Hoare triple {43334#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43334#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:33,907 INFO L273 TraceCheckUtils]: 58: Hoare triple {43334#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43334#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:33,907 INFO L273 TraceCheckUtils]: 59: Hoare triple {43334#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {43335#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:33,908 INFO L273 TraceCheckUtils]: 60: Hoare triple {43335#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43335#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:33,908 INFO L273 TraceCheckUtils]: 61: Hoare triple {43335#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43335#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:33,909 INFO L273 TraceCheckUtils]: 62: Hoare triple {43335#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {43336#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:33,910 INFO L273 TraceCheckUtils]: 63: Hoare triple {43336#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43336#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:33,910 INFO L273 TraceCheckUtils]: 64: Hoare triple {43336#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43336#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:33,911 INFO L273 TraceCheckUtils]: 65: Hoare triple {43336#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {43337#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:33,911 INFO L273 TraceCheckUtils]: 66: Hoare triple {43337#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43337#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:33,912 INFO L273 TraceCheckUtils]: 67: Hoare triple {43337#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43337#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:33,912 INFO L273 TraceCheckUtils]: 68: Hoare triple {43337#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {43338#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:33,913 INFO L273 TraceCheckUtils]: 69: Hoare triple {43338#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43338#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:33,913 INFO L273 TraceCheckUtils]: 70: Hoare triple {43338#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43338#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:33,914 INFO L273 TraceCheckUtils]: 71: Hoare triple {43338#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {43339#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:33,915 INFO L273 TraceCheckUtils]: 72: Hoare triple {43339#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43339#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:33,915 INFO L273 TraceCheckUtils]: 73: Hoare triple {43339#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43339#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:33,916 INFO L273 TraceCheckUtils]: 74: Hoare triple {43339#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {43340#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:33,916 INFO L273 TraceCheckUtils]: 75: Hoare triple {43340#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43340#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:33,917 INFO L273 TraceCheckUtils]: 76: Hoare triple {43340#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43340#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:33,918 INFO L273 TraceCheckUtils]: 77: Hoare triple {43340#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {43341#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:33,918 INFO L273 TraceCheckUtils]: 78: Hoare triple {43341#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43341#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:33,919 INFO L273 TraceCheckUtils]: 79: Hoare triple {43341#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43341#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:33,919 INFO L273 TraceCheckUtils]: 80: Hoare triple {43341#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {43342#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:33,920 INFO L273 TraceCheckUtils]: 81: Hoare triple {43342#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43342#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:33,920 INFO L273 TraceCheckUtils]: 82: Hoare triple {43342#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43342#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:33,921 INFO L273 TraceCheckUtils]: 83: Hoare triple {43342#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {43343#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:33,921 INFO L273 TraceCheckUtils]: 84: Hoare triple {43343#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43343#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:33,922 INFO L273 TraceCheckUtils]: 85: Hoare triple {43343#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43343#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:33,923 INFO L273 TraceCheckUtils]: 86: Hoare triple {43343#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {43344#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:33,923 INFO L273 TraceCheckUtils]: 87: Hoare triple {43344#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43344#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:33,924 INFO L273 TraceCheckUtils]: 88: Hoare triple {43344#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43344#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:33,924 INFO L273 TraceCheckUtils]: 89: Hoare triple {43344#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {43345#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:33,925 INFO L273 TraceCheckUtils]: 90: Hoare triple {43345#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43345#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:33,925 INFO L273 TraceCheckUtils]: 91: Hoare triple {43345#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43345#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:33,926 INFO L273 TraceCheckUtils]: 92: Hoare triple {43345#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {43346#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:33,927 INFO L273 TraceCheckUtils]: 93: Hoare triple {43346#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43346#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:33,927 INFO L273 TraceCheckUtils]: 94: Hoare triple {43346#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43346#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:33,928 INFO L273 TraceCheckUtils]: 95: Hoare triple {43346#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {43347#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:33,928 INFO L273 TraceCheckUtils]: 96: Hoare triple {43347#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43347#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:33,929 INFO L273 TraceCheckUtils]: 97: Hoare triple {43347#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43347#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:33,929 INFO L273 TraceCheckUtils]: 98: Hoare triple {43347#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {43348#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:33,930 INFO L273 TraceCheckUtils]: 99: Hoare triple {43348#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43348#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:33,930 INFO L273 TraceCheckUtils]: 100: Hoare triple {43348#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43348#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:33,931 INFO L273 TraceCheckUtils]: 101: Hoare triple {43348#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {43349#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:33,932 INFO L273 TraceCheckUtils]: 102: Hoare triple {43349#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43349#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:33,932 INFO L273 TraceCheckUtils]: 103: Hoare triple {43349#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43349#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:33,933 INFO L273 TraceCheckUtils]: 104: Hoare triple {43349#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {43350#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:33,933 INFO L273 TraceCheckUtils]: 105: Hoare triple {43350#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43350#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:33,934 INFO L273 TraceCheckUtils]: 106: Hoare triple {43350#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43350#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:33,934 INFO L273 TraceCheckUtils]: 107: Hoare triple {43350#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {43351#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:33,935 INFO L273 TraceCheckUtils]: 108: Hoare triple {43351#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43351#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:33,935 INFO L273 TraceCheckUtils]: 109: Hoare triple {43351#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43351#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:33,936 INFO L273 TraceCheckUtils]: 110: Hoare triple {43351#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {43352#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:33,937 INFO L273 TraceCheckUtils]: 111: Hoare triple {43352#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43352#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:33,937 INFO L273 TraceCheckUtils]: 112: Hoare triple {43352#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43352#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:33,938 INFO L273 TraceCheckUtils]: 113: Hoare triple {43352#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {43353#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:33,938 INFO L273 TraceCheckUtils]: 114: Hoare triple {43353#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43353#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:33,939 INFO L273 TraceCheckUtils]: 115: Hoare triple {43353#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43353#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:33,940 INFO L273 TraceCheckUtils]: 116: Hoare triple {43353#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {43354#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:33,940 INFO L273 TraceCheckUtils]: 117: Hoare triple {43354#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43354#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:33,941 INFO L273 TraceCheckUtils]: 118: Hoare triple {43354#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43354#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:33,941 INFO L273 TraceCheckUtils]: 119: Hoare triple {43354#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {43355#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:33,942 INFO L273 TraceCheckUtils]: 120: Hoare triple {43355#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43355#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:33,942 INFO L273 TraceCheckUtils]: 121: Hoare triple {43355#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43355#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:33,943 INFO L273 TraceCheckUtils]: 122: Hoare triple {43355#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {43356#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:33,944 INFO L273 TraceCheckUtils]: 123: Hoare triple {43356#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43356#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:33,944 INFO L273 TraceCheckUtils]: 124: Hoare triple {43356#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43356#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:33,945 INFO L273 TraceCheckUtils]: 125: Hoare triple {43356#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {43357#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:33,945 INFO L273 TraceCheckUtils]: 126: Hoare triple {43357#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43357#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:33,946 INFO L273 TraceCheckUtils]: 127: Hoare triple {43357#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43357#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:33,946 INFO L273 TraceCheckUtils]: 128: Hoare triple {43357#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {43358#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:33,947 INFO L273 TraceCheckUtils]: 129: Hoare triple {43358#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43358#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:33,947 INFO L273 TraceCheckUtils]: 130: Hoare triple {43358#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43358#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:33,948 INFO L273 TraceCheckUtils]: 131: Hoare triple {43358#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {43359#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:33,949 INFO L273 TraceCheckUtils]: 132: Hoare triple {43359#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43359#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:33,949 INFO L273 TraceCheckUtils]: 133: Hoare triple {43359#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43359#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:33,950 INFO L273 TraceCheckUtils]: 134: Hoare triple {43359#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {43360#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:33,950 INFO L273 TraceCheckUtils]: 135: Hoare triple {43360#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43360#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:33,951 INFO L273 TraceCheckUtils]: 136: Hoare triple {43360#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43360#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:33,951 INFO L273 TraceCheckUtils]: 137: Hoare triple {43360#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {43361#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:33,952 INFO L273 TraceCheckUtils]: 138: Hoare triple {43361#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43361#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:33,952 INFO L273 TraceCheckUtils]: 139: Hoare triple {43361#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43361#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:33,953 INFO L273 TraceCheckUtils]: 140: Hoare triple {43361#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {43362#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:33,954 INFO L273 TraceCheckUtils]: 141: Hoare triple {43362#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43362#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:33,954 INFO L273 TraceCheckUtils]: 142: Hoare triple {43362#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43362#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:33,955 INFO L273 TraceCheckUtils]: 143: Hoare triple {43362#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {43363#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:33,955 INFO L273 TraceCheckUtils]: 144: Hoare triple {43363#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43363#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:33,956 INFO L273 TraceCheckUtils]: 145: Hoare triple {43363#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43363#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:33,957 INFO L273 TraceCheckUtils]: 146: Hoare triple {43363#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {43364#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:33,957 INFO L273 TraceCheckUtils]: 147: Hoare triple {43364#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43364#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:33,958 INFO L273 TraceCheckUtils]: 148: Hoare triple {43364#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43364#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:33,958 INFO L273 TraceCheckUtils]: 149: Hoare triple {43364#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {43365#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:33,959 INFO L273 TraceCheckUtils]: 150: Hoare triple {43365#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43365#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:33,959 INFO L273 TraceCheckUtils]: 151: Hoare triple {43365#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43365#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:33,960 INFO L273 TraceCheckUtils]: 152: Hoare triple {43365#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {43366#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:33,961 INFO L273 TraceCheckUtils]: 153: Hoare triple {43366#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43366#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:33,961 INFO L273 TraceCheckUtils]: 154: Hoare triple {43366#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43366#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:33,962 INFO L273 TraceCheckUtils]: 155: Hoare triple {43366#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {43367#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:33,962 INFO L273 TraceCheckUtils]: 156: Hoare triple {43367#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43367#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:33,963 INFO L273 TraceCheckUtils]: 157: Hoare triple {43367#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43367#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:33,963 INFO L273 TraceCheckUtils]: 158: Hoare triple {43367#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {43368#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:33,964 INFO L273 TraceCheckUtils]: 159: Hoare triple {43368#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43368#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:33,964 INFO L273 TraceCheckUtils]: 160: Hoare triple {43368#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43368#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:33,965 INFO L273 TraceCheckUtils]: 161: Hoare triple {43368#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {43369#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:33,966 INFO L273 TraceCheckUtils]: 162: Hoare triple {43369#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43369#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:33,966 INFO L273 TraceCheckUtils]: 163: Hoare triple {43369#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43369#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:33,967 INFO L273 TraceCheckUtils]: 164: Hoare triple {43369#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {43370#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:33,967 INFO L273 TraceCheckUtils]: 165: Hoare triple {43370#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43370#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:33,968 INFO L273 TraceCheckUtils]: 166: Hoare triple {43370#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {43370#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:33,968 INFO L273 TraceCheckUtils]: 167: Hoare triple {43370#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {43371#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:33,969 INFO L273 TraceCheckUtils]: 168: Hoare triple {43371#(<= main_~i~0 54)} assume !(~i~0 < 100000); {43316#false} is VALID [2018-11-23 11:57:33,969 INFO L273 TraceCheckUtils]: 169: Hoare triple {43316#false} havoc ~x~0;~x~0 := 0; {43316#false} is VALID [2018-11-23 11:57:33,970 INFO L273 TraceCheckUtils]: 170: Hoare triple {43316#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {43316#false} is VALID [2018-11-23 11:57:33,970 INFO L256 TraceCheckUtils]: 171: Hoare triple {43316#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {43316#false} is VALID [2018-11-23 11:57:33,970 INFO L273 TraceCheckUtils]: 172: Hoare triple {43316#false} ~cond := #in~cond; {43316#false} is VALID [2018-11-23 11:57:33,970 INFO L273 TraceCheckUtils]: 173: Hoare triple {43316#false} assume 0 == ~cond; {43316#false} is VALID [2018-11-23 11:57:33,970 INFO L273 TraceCheckUtils]: 174: Hoare triple {43316#false} assume !false; {43316#false} is VALID [2018-11-23 11:57:33,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:34,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:34,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 58 [2018-11-23 11:57:34,011 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 175 [2018-11-23 11:57:34,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:34,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states. [2018-11-23 11:57:34,179 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:34,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-23 11:57:34,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-23 11:57:34,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-11-23 11:57:34,180 INFO L87 Difference]: Start difference. First operand 180 states and 235 transitions. Second operand 58 states. [2018-11-23 11:57:35,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:35,382 INFO L93 Difference]: Finished difference Result 196 states and 254 transitions. [2018-11-23 11:57:35,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-11-23 11:57:35,383 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 175 [2018-11-23 11:57:35,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:35,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 11:57:35,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 254 transitions. [2018-11-23 11:57:35,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 11:57:35,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 254 transitions. [2018-11-23 11:57:35,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states and 254 transitions. [2018-11-23 11:57:35,610 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:35,614 INFO L225 Difference]: With dead ends: 196 [2018-11-23 11:57:35,614 INFO L226 Difference]: Without dead ends: 185 [2018-11-23 11:57:35,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-11-23 11:57:35,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-23 11:57:35,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2018-11-23 11:57:35,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:35,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand 183 states. [2018-11-23 11:57:35,690 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand 183 states. [2018-11-23 11:57:35,690 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 183 states. [2018-11-23 11:57:35,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:35,694 INFO L93 Difference]: Finished difference Result 185 states and 242 transitions. [2018-11-23 11:57:35,694 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 242 transitions. [2018-11-23 11:57:35,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:35,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:35,695 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand 185 states. [2018-11-23 11:57:35,695 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 185 states. [2018-11-23 11:57:35,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:35,698 INFO L93 Difference]: Finished difference Result 185 states and 242 transitions. [2018-11-23 11:57:35,698 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 242 transitions. [2018-11-23 11:57:35,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:35,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:35,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:35,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:35,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-11-23 11:57:35,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 239 transitions. [2018-11-23 11:57:35,702 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 239 transitions. Word has length 175 [2018-11-23 11:57:35,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:35,702 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 239 transitions. [2018-11-23 11:57:35,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-23 11:57:35,702 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 239 transitions. [2018-11-23 11:57:35,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-23 11:57:35,703 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:35,703 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:35,704 INFO L423 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:35,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:35,704 INFO L82 PathProgramCache]: Analyzing trace with hash -2000821341, now seen corresponding path program 55 times [2018-11-23 11:57:35,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:35,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:35,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:35,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:35,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:35,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:37,242 INFO L256 TraceCheckUtils]: 0: Hoare triple {44775#true} call ULTIMATE.init(); {44775#true} is VALID [2018-11-23 11:57:37,243 INFO L273 TraceCheckUtils]: 1: Hoare triple {44775#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {44775#true} is VALID [2018-11-23 11:57:37,243 INFO L273 TraceCheckUtils]: 2: Hoare triple {44775#true} assume true; {44775#true} is VALID [2018-11-23 11:57:37,243 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {44775#true} {44775#true} #55#return; {44775#true} is VALID [2018-11-23 11:57:37,243 INFO L256 TraceCheckUtils]: 4: Hoare triple {44775#true} call #t~ret4 := main(); {44775#true} is VALID [2018-11-23 11:57:37,243 INFO L273 TraceCheckUtils]: 5: Hoare triple {44775#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {44777#(= main_~i~0 0)} is VALID [2018-11-23 11:57:37,244 INFO L273 TraceCheckUtils]: 6: Hoare triple {44777#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44777#(= main_~i~0 0)} is VALID [2018-11-23 11:57:37,244 INFO L273 TraceCheckUtils]: 7: Hoare triple {44777#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44777#(= main_~i~0 0)} is VALID [2018-11-23 11:57:37,245 INFO L273 TraceCheckUtils]: 8: Hoare triple {44777#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {44778#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:37,245 INFO L273 TraceCheckUtils]: 9: Hoare triple {44778#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44778#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:37,246 INFO L273 TraceCheckUtils]: 10: Hoare triple {44778#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44778#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:37,246 INFO L273 TraceCheckUtils]: 11: Hoare triple {44778#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {44779#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:37,247 INFO L273 TraceCheckUtils]: 12: Hoare triple {44779#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44779#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:37,247 INFO L273 TraceCheckUtils]: 13: Hoare triple {44779#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44779#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:37,248 INFO L273 TraceCheckUtils]: 14: Hoare triple {44779#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {44780#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:37,248 INFO L273 TraceCheckUtils]: 15: Hoare triple {44780#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44780#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:37,249 INFO L273 TraceCheckUtils]: 16: Hoare triple {44780#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44780#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:37,249 INFO L273 TraceCheckUtils]: 17: Hoare triple {44780#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {44781#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:37,250 INFO L273 TraceCheckUtils]: 18: Hoare triple {44781#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44781#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:37,250 INFO L273 TraceCheckUtils]: 19: Hoare triple {44781#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44781#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:37,251 INFO L273 TraceCheckUtils]: 20: Hoare triple {44781#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {44782#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:37,252 INFO L273 TraceCheckUtils]: 21: Hoare triple {44782#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44782#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:37,252 INFO L273 TraceCheckUtils]: 22: Hoare triple {44782#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44782#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:37,253 INFO L273 TraceCheckUtils]: 23: Hoare triple {44782#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {44783#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:37,253 INFO L273 TraceCheckUtils]: 24: Hoare triple {44783#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44783#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:37,254 INFO L273 TraceCheckUtils]: 25: Hoare triple {44783#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44783#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:37,254 INFO L273 TraceCheckUtils]: 26: Hoare triple {44783#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {44784#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:37,255 INFO L273 TraceCheckUtils]: 27: Hoare triple {44784#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44784#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:37,255 INFO L273 TraceCheckUtils]: 28: Hoare triple {44784#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44784#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:37,256 INFO L273 TraceCheckUtils]: 29: Hoare triple {44784#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {44785#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:37,256 INFO L273 TraceCheckUtils]: 30: Hoare triple {44785#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44785#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:37,257 INFO L273 TraceCheckUtils]: 31: Hoare triple {44785#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44785#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:37,257 INFO L273 TraceCheckUtils]: 32: Hoare triple {44785#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {44786#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:37,258 INFO L273 TraceCheckUtils]: 33: Hoare triple {44786#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44786#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:37,258 INFO L273 TraceCheckUtils]: 34: Hoare triple {44786#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44786#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:37,259 INFO L273 TraceCheckUtils]: 35: Hoare triple {44786#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {44787#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:37,259 INFO L273 TraceCheckUtils]: 36: Hoare triple {44787#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44787#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:37,260 INFO L273 TraceCheckUtils]: 37: Hoare triple {44787#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44787#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:37,261 INFO L273 TraceCheckUtils]: 38: Hoare triple {44787#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {44788#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:37,261 INFO L273 TraceCheckUtils]: 39: Hoare triple {44788#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44788#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:37,262 INFO L273 TraceCheckUtils]: 40: Hoare triple {44788#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44788#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:37,262 INFO L273 TraceCheckUtils]: 41: Hoare triple {44788#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {44789#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:37,263 INFO L273 TraceCheckUtils]: 42: Hoare triple {44789#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44789#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:37,263 INFO L273 TraceCheckUtils]: 43: Hoare triple {44789#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44789#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:37,264 INFO L273 TraceCheckUtils]: 44: Hoare triple {44789#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {44790#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:37,264 INFO L273 TraceCheckUtils]: 45: Hoare triple {44790#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44790#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:37,265 INFO L273 TraceCheckUtils]: 46: Hoare triple {44790#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44790#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:37,265 INFO L273 TraceCheckUtils]: 47: Hoare triple {44790#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {44791#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:37,266 INFO L273 TraceCheckUtils]: 48: Hoare triple {44791#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44791#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:37,266 INFO L273 TraceCheckUtils]: 49: Hoare triple {44791#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44791#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:37,267 INFO L273 TraceCheckUtils]: 50: Hoare triple {44791#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {44792#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:37,267 INFO L273 TraceCheckUtils]: 51: Hoare triple {44792#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44792#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:37,268 INFO L273 TraceCheckUtils]: 52: Hoare triple {44792#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44792#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:37,269 INFO L273 TraceCheckUtils]: 53: Hoare triple {44792#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {44793#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:37,269 INFO L273 TraceCheckUtils]: 54: Hoare triple {44793#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44793#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:37,269 INFO L273 TraceCheckUtils]: 55: Hoare triple {44793#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44793#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:37,270 INFO L273 TraceCheckUtils]: 56: Hoare triple {44793#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {44794#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:37,271 INFO L273 TraceCheckUtils]: 57: Hoare triple {44794#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44794#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:37,271 INFO L273 TraceCheckUtils]: 58: Hoare triple {44794#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44794#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:37,272 INFO L273 TraceCheckUtils]: 59: Hoare triple {44794#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {44795#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:37,272 INFO L273 TraceCheckUtils]: 60: Hoare triple {44795#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44795#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:37,273 INFO L273 TraceCheckUtils]: 61: Hoare triple {44795#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44795#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:37,273 INFO L273 TraceCheckUtils]: 62: Hoare triple {44795#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {44796#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:37,274 INFO L273 TraceCheckUtils]: 63: Hoare triple {44796#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44796#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:37,274 INFO L273 TraceCheckUtils]: 64: Hoare triple {44796#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44796#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:37,275 INFO L273 TraceCheckUtils]: 65: Hoare triple {44796#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {44797#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:37,275 INFO L273 TraceCheckUtils]: 66: Hoare triple {44797#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44797#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:37,276 INFO L273 TraceCheckUtils]: 67: Hoare triple {44797#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44797#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:37,277 INFO L273 TraceCheckUtils]: 68: Hoare triple {44797#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {44798#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:37,277 INFO L273 TraceCheckUtils]: 69: Hoare triple {44798#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44798#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:37,278 INFO L273 TraceCheckUtils]: 70: Hoare triple {44798#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44798#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:37,278 INFO L273 TraceCheckUtils]: 71: Hoare triple {44798#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {44799#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:37,279 INFO L273 TraceCheckUtils]: 72: Hoare triple {44799#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44799#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:37,279 INFO L273 TraceCheckUtils]: 73: Hoare triple {44799#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44799#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:37,280 INFO L273 TraceCheckUtils]: 74: Hoare triple {44799#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {44800#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:37,280 INFO L273 TraceCheckUtils]: 75: Hoare triple {44800#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44800#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:37,281 INFO L273 TraceCheckUtils]: 76: Hoare triple {44800#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44800#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:37,281 INFO L273 TraceCheckUtils]: 77: Hoare triple {44800#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {44801#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:37,282 INFO L273 TraceCheckUtils]: 78: Hoare triple {44801#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44801#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:37,282 INFO L273 TraceCheckUtils]: 79: Hoare triple {44801#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44801#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:37,283 INFO L273 TraceCheckUtils]: 80: Hoare triple {44801#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {44802#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:37,283 INFO L273 TraceCheckUtils]: 81: Hoare triple {44802#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44802#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:37,284 INFO L273 TraceCheckUtils]: 82: Hoare triple {44802#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44802#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:37,285 INFO L273 TraceCheckUtils]: 83: Hoare triple {44802#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {44803#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:37,285 INFO L273 TraceCheckUtils]: 84: Hoare triple {44803#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44803#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:37,286 INFO L273 TraceCheckUtils]: 85: Hoare triple {44803#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44803#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:37,286 INFO L273 TraceCheckUtils]: 86: Hoare triple {44803#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {44804#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:37,287 INFO L273 TraceCheckUtils]: 87: Hoare triple {44804#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44804#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:37,287 INFO L273 TraceCheckUtils]: 88: Hoare triple {44804#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44804#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:37,288 INFO L273 TraceCheckUtils]: 89: Hoare triple {44804#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {44805#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:37,288 INFO L273 TraceCheckUtils]: 90: Hoare triple {44805#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44805#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:37,289 INFO L273 TraceCheckUtils]: 91: Hoare triple {44805#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44805#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:37,289 INFO L273 TraceCheckUtils]: 92: Hoare triple {44805#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {44806#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:37,290 INFO L273 TraceCheckUtils]: 93: Hoare triple {44806#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44806#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:37,290 INFO L273 TraceCheckUtils]: 94: Hoare triple {44806#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44806#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:37,291 INFO L273 TraceCheckUtils]: 95: Hoare triple {44806#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {44807#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:37,292 INFO L273 TraceCheckUtils]: 96: Hoare triple {44807#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44807#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:37,292 INFO L273 TraceCheckUtils]: 97: Hoare triple {44807#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44807#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:37,293 INFO L273 TraceCheckUtils]: 98: Hoare triple {44807#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {44808#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:37,293 INFO L273 TraceCheckUtils]: 99: Hoare triple {44808#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44808#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:37,294 INFO L273 TraceCheckUtils]: 100: Hoare triple {44808#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44808#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:37,294 INFO L273 TraceCheckUtils]: 101: Hoare triple {44808#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {44809#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:37,295 INFO L273 TraceCheckUtils]: 102: Hoare triple {44809#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44809#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:37,295 INFO L273 TraceCheckUtils]: 103: Hoare triple {44809#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44809#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:37,296 INFO L273 TraceCheckUtils]: 104: Hoare triple {44809#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {44810#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:37,296 INFO L273 TraceCheckUtils]: 105: Hoare triple {44810#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44810#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:37,297 INFO L273 TraceCheckUtils]: 106: Hoare triple {44810#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44810#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:37,298 INFO L273 TraceCheckUtils]: 107: Hoare triple {44810#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {44811#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:37,298 INFO L273 TraceCheckUtils]: 108: Hoare triple {44811#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44811#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:37,299 INFO L273 TraceCheckUtils]: 109: Hoare triple {44811#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44811#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:37,299 INFO L273 TraceCheckUtils]: 110: Hoare triple {44811#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {44812#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:37,300 INFO L273 TraceCheckUtils]: 111: Hoare triple {44812#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44812#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:37,300 INFO L273 TraceCheckUtils]: 112: Hoare triple {44812#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44812#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:37,301 INFO L273 TraceCheckUtils]: 113: Hoare triple {44812#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {44813#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:37,302 INFO L273 TraceCheckUtils]: 114: Hoare triple {44813#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44813#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:37,302 INFO L273 TraceCheckUtils]: 115: Hoare triple {44813#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44813#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:37,303 INFO L273 TraceCheckUtils]: 116: Hoare triple {44813#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {44814#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:37,303 INFO L273 TraceCheckUtils]: 117: Hoare triple {44814#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44814#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:37,304 INFO L273 TraceCheckUtils]: 118: Hoare triple {44814#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44814#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:37,304 INFO L273 TraceCheckUtils]: 119: Hoare triple {44814#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {44815#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:37,305 INFO L273 TraceCheckUtils]: 120: Hoare triple {44815#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44815#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:37,305 INFO L273 TraceCheckUtils]: 121: Hoare triple {44815#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44815#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:37,306 INFO L273 TraceCheckUtils]: 122: Hoare triple {44815#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {44816#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:37,307 INFO L273 TraceCheckUtils]: 123: Hoare triple {44816#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44816#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:37,307 INFO L273 TraceCheckUtils]: 124: Hoare triple {44816#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44816#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:37,308 INFO L273 TraceCheckUtils]: 125: Hoare triple {44816#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {44817#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:37,308 INFO L273 TraceCheckUtils]: 126: Hoare triple {44817#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44817#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:37,309 INFO L273 TraceCheckUtils]: 127: Hoare triple {44817#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44817#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:37,310 INFO L273 TraceCheckUtils]: 128: Hoare triple {44817#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {44818#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:37,310 INFO L273 TraceCheckUtils]: 129: Hoare triple {44818#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44818#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:37,311 INFO L273 TraceCheckUtils]: 130: Hoare triple {44818#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44818#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:37,311 INFO L273 TraceCheckUtils]: 131: Hoare triple {44818#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {44819#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:37,312 INFO L273 TraceCheckUtils]: 132: Hoare triple {44819#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44819#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:37,312 INFO L273 TraceCheckUtils]: 133: Hoare triple {44819#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44819#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:37,313 INFO L273 TraceCheckUtils]: 134: Hoare triple {44819#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {44820#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:37,313 INFO L273 TraceCheckUtils]: 135: Hoare triple {44820#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44820#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:37,314 INFO L273 TraceCheckUtils]: 136: Hoare triple {44820#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44820#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:37,315 INFO L273 TraceCheckUtils]: 137: Hoare triple {44820#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {44821#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:37,315 INFO L273 TraceCheckUtils]: 138: Hoare triple {44821#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44821#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:37,316 INFO L273 TraceCheckUtils]: 139: Hoare triple {44821#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44821#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:37,316 INFO L273 TraceCheckUtils]: 140: Hoare triple {44821#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {44822#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:37,317 INFO L273 TraceCheckUtils]: 141: Hoare triple {44822#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44822#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:37,317 INFO L273 TraceCheckUtils]: 142: Hoare triple {44822#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44822#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:37,318 INFO L273 TraceCheckUtils]: 143: Hoare triple {44822#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {44823#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:37,319 INFO L273 TraceCheckUtils]: 144: Hoare triple {44823#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44823#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:37,319 INFO L273 TraceCheckUtils]: 145: Hoare triple {44823#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44823#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:37,320 INFO L273 TraceCheckUtils]: 146: Hoare triple {44823#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {44824#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:37,320 INFO L273 TraceCheckUtils]: 147: Hoare triple {44824#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44824#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:37,321 INFO L273 TraceCheckUtils]: 148: Hoare triple {44824#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44824#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:37,321 INFO L273 TraceCheckUtils]: 149: Hoare triple {44824#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {44825#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:37,322 INFO L273 TraceCheckUtils]: 150: Hoare triple {44825#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44825#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:37,322 INFO L273 TraceCheckUtils]: 151: Hoare triple {44825#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44825#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:37,323 INFO L273 TraceCheckUtils]: 152: Hoare triple {44825#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {44826#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:37,324 INFO L273 TraceCheckUtils]: 153: Hoare triple {44826#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44826#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:37,324 INFO L273 TraceCheckUtils]: 154: Hoare triple {44826#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44826#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:37,325 INFO L273 TraceCheckUtils]: 155: Hoare triple {44826#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {44827#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:37,325 INFO L273 TraceCheckUtils]: 156: Hoare triple {44827#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44827#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:37,326 INFO L273 TraceCheckUtils]: 157: Hoare triple {44827#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44827#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:37,327 INFO L273 TraceCheckUtils]: 158: Hoare triple {44827#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {44828#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:37,327 INFO L273 TraceCheckUtils]: 159: Hoare triple {44828#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44828#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:37,328 INFO L273 TraceCheckUtils]: 160: Hoare triple {44828#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44828#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:37,328 INFO L273 TraceCheckUtils]: 161: Hoare triple {44828#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {44829#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:37,329 INFO L273 TraceCheckUtils]: 162: Hoare triple {44829#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44829#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:37,329 INFO L273 TraceCheckUtils]: 163: Hoare triple {44829#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44829#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:37,330 INFO L273 TraceCheckUtils]: 164: Hoare triple {44829#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {44830#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:37,330 INFO L273 TraceCheckUtils]: 165: Hoare triple {44830#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44830#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:37,331 INFO L273 TraceCheckUtils]: 166: Hoare triple {44830#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44830#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:37,332 INFO L273 TraceCheckUtils]: 167: Hoare triple {44830#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {44831#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:37,332 INFO L273 TraceCheckUtils]: 168: Hoare triple {44831#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44831#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:37,333 INFO L273 TraceCheckUtils]: 169: Hoare triple {44831#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44831#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:37,333 INFO L273 TraceCheckUtils]: 170: Hoare triple {44831#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {44832#(<= main_~i~0 55)} is VALID [2018-11-23 11:57:37,334 INFO L273 TraceCheckUtils]: 171: Hoare triple {44832#(<= main_~i~0 55)} assume !(~i~0 < 100000); {44776#false} is VALID [2018-11-23 11:57:37,334 INFO L273 TraceCheckUtils]: 172: Hoare triple {44776#false} havoc ~x~0;~x~0 := 0; {44776#false} is VALID [2018-11-23 11:57:37,334 INFO L273 TraceCheckUtils]: 173: Hoare triple {44776#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {44776#false} is VALID [2018-11-23 11:57:37,335 INFO L256 TraceCheckUtils]: 174: Hoare triple {44776#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {44776#false} is VALID [2018-11-23 11:57:37,335 INFO L273 TraceCheckUtils]: 175: Hoare triple {44776#false} ~cond := #in~cond; {44776#false} is VALID [2018-11-23 11:57:37,335 INFO L273 TraceCheckUtils]: 176: Hoare triple {44776#false} assume 0 == ~cond; {44776#false} is VALID [2018-11-23 11:57:37,335 INFO L273 TraceCheckUtils]: 177: Hoare triple {44776#false} assume !false; {44776#false} is VALID [2018-11-23 11:57:37,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 0 proven. 4510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:37,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:37,357 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:37,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:57:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:37,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:38,847 INFO L256 TraceCheckUtils]: 0: Hoare triple {44775#true} call ULTIMATE.init(); {44775#true} is VALID [2018-11-23 11:57:38,847 INFO L273 TraceCheckUtils]: 1: Hoare triple {44775#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {44775#true} is VALID [2018-11-23 11:57:38,848 INFO L273 TraceCheckUtils]: 2: Hoare triple {44775#true} assume true; {44775#true} is VALID [2018-11-23 11:57:38,848 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {44775#true} {44775#true} #55#return; {44775#true} is VALID [2018-11-23 11:57:38,848 INFO L256 TraceCheckUtils]: 4: Hoare triple {44775#true} call #t~ret4 := main(); {44775#true} is VALID [2018-11-23 11:57:38,849 INFO L273 TraceCheckUtils]: 5: Hoare triple {44775#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {44851#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:38,849 INFO L273 TraceCheckUtils]: 6: Hoare triple {44851#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44851#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:38,850 INFO L273 TraceCheckUtils]: 7: Hoare triple {44851#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44851#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:38,851 INFO L273 TraceCheckUtils]: 8: Hoare triple {44851#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {44778#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:38,851 INFO L273 TraceCheckUtils]: 9: Hoare triple {44778#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44778#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:38,852 INFO L273 TraceCheckUtils]: 10: Hoare triple {44778#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44778#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:38,852 INFO L273 TraceCheckUtils]: 11: Hoare triple {44778#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {44779#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:38,853 INFO L273 TraceCheckUtils]: 12: Hoare triple {44779#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44779#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:38,853 INFO L273 TraceCheckUtils]: 13: Hoare triple {44779#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44779#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:38,854 INFO L273 TraceCheckUtils]: 14: Hoare triple {44779#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {44780#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:38,855 INFO L273 TraceCheckUtils]: 15: Hoare triple {44780#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44780#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:38,855 INFO L273 TraceCheckUtils]: 16: Hoare triple {44780#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44780#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:38,856 INFO L273 TraceCheckUtils]: 17: Hoare triple {44780#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {44781#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:38,856 INFO L273 TraceCheckUtils]: 18: Hoare triple {44781#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44781#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:38,857 INFO L273 TraceCheckUtils]: 19: Hoare triple {44781#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44781#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:38,857 INFO L273 TraceCheckUtils]: 20: Hoare triple {44781#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {44782#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:38,858 INFO L273 TraceCheckUtils]: 21: Hoare triple {44782#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44782#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:38,858 INFO L273 TraceCheckUtils]: 22: Hoare triple {44782#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44782#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:38,859 INFO L273 TraceCheckUtils]: 23: Hoare triple {44782#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {44783#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:38,860 INFO L273 TraceCheckUtils]: 24: Hoare triple {44783#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44783#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:38,860 INFO L273 TraceCheckUtils]: 25: Hoare triple {44783#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44783#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:38,861 INFO L273 TraceCheckUtils]: 26: Hoare triple {44783#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {44784#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:38,861 INFO L273 TraceCheckUtils]: 27: Hoare triple {44784#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44784#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:38,862 INFO L273 TraceCheckUtils]: 28: Hoare triple {44784#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44784#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:38,863 INFO L273 TraceCheckUtils]: 29: Hoare triple {44784#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {44785#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:38,863 INFO L273 TraceCheckUtils]: 30: Hoare triple {44785#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44785#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:38,864 INFO L273 TraceCheckUtils]: 31: Hoare triple {44785#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44785#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:38,864 INFO L273 TraceCheckUtils]: 32: Hoare triple {44785#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {44786#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:38,865 INFO L273 TraceCheckUtils]: 33: Hoare triple {44786#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44786#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:38,865 INFO L273 TraceCheckUtils]: 34: Hoare triple {44786#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44786#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:38,866 INFO L273 TraceCheckUtils]: 35: Hoare triple {44786#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {44787#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:38,867 INFO L273 TraceCheckUtils]: 36: Hoare triple {44787#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44787#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:38,867 INFO L273 TraceCheckUtils]: 37: Hoare triple {44787#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44787#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:38,868 INFO L273 TraceCheckUtils]: 38: Hoare triple {44787#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {44788#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:38,868 INFO L273 TraceCheckUtils]: 39: Hoare triple {44788#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44788#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:38,869 INFO L273 TraceCheckUtils]: 40: Hoare triple {44788#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44788#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:38,869 INFO L273 TraceCheckUtils]: 41: Hoare triple {44788#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {44789#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:38,870 INFO L273 TraceCheckUtils]: 42: Hoare triple {44789#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44789#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:38,870 INFO L273 TraceCheckUtils]: 43: Hoare triple {44789#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44789#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:38,871 INFO L273 TraceCheckUtils]: 44: Hoare triple {44789#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {44790#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:38,872 INFO L273 TraceCheckUtils]: 45: Hoare triple {44790#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44790#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:38,872 INFO L273 TraceCheckUtils]: 46: Hoare triple {44790#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44790#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:38,873 INFO L273 TraceCheckUtils]: 47: Hoare triple {44790#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {44791#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:38,873 INFO L273 TraceCheckUtils]: 48: Hoare triple {44791#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44791#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:38,874 INFO L273 TraceCheckUtils]: 49: Hoare triple {44791#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44791#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:38,874 INFO L273 TraceCheckUtils]: 50: Hoare triple {44791#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {44792#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:38,875 INFO L273 TraceCheckUtils]: 51: Hoare triple {44792#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44792#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:38,875 INFO L273 TraceCheckUtils]: 52: Hoare triple {44792#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44792#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:38,876 INFO L273 TraceCheckUtils]: 53: Hoare triple {44792#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {44793#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:38,877 INFO L273 TraceCheckUtils]: 54: Hoare triple {44793#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44793#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:38,877 INFO L273 TraceCheckUtils]: 55: Hoare triple {44793#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44793#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:38,878 INFO L273 TraceCheckUtils]: 56: Hoare triple {44793#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {44794#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:38,878 INFO L273 TraceCheckUtils]: 57: Hoare triple {44794#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44794#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:38,879 INFO L273 TraceCheckUtils]: 58: Hoare triple {44794#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44794#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:38,880 INFO L273 TraceCheckUtils]: 59: Hoare triple {44794#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {44795#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:38,880 INFO L273 TraceCheckUtils]: 60: Hoare triple {44795#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44795#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:38,881 INFO L273 TraceCheckUtils]: 61: Hoare triple {44795#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44795#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:38,881 INFO L273 TraceCheckUtils]: 62: Hoare triple {44795#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {44796#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:38,882 INFO L273 TraceCheckUtils]: 63: Hoare triple {44796#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44796#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:38,882 INFO L273 TraceCheckUtils]: 64: Hoare triple {44796#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44796#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:38,883 INFO L273 TraceCheckUtils]: 65: Hoare triple {44796#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {44797#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:38,884 INFO L273 TraceCheckUtils]: 66: Hoare triple {44797#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44797#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:38,884 INFO L273 TraceCheckUtils]: 67: Hoare triple {44797#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44797#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:38,885 INFO L273 TraceCheckUtils]: 68: Hoare triple {44797#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {44798#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:38,885 INFO L273 TraceCheckUtils]: 69: Hoare triple {44798#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44798#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:38,886 INFO L273 TraceCheckUtils]: 70: Hoare triple {44798#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44798#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:38,887 INFO L273 TraceCheckUtils]: 71: Hoare triple {44798#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {44799#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:38,887 INFO L273 TraceCheckUtils]: 72: Hoare triple {44799#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44799#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:38,887 INFO L273 TraceCheckUtils]: 73: Hoare triple {44799#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44799#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:38,888 INFO L273 TraceCheckUtils]: 74: Hoare triple {44799#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {44800#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:38,889 INFO L273 TraceCheckUtils]: 75: Hoare triple {44800#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44800#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:38,889 INFO L273 TraceCheckUtils]: 76: Hoare triple {44800#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44800#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:38,890 INFO L273 TraceCheckUtils]: 77: Hoare triple {44800#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {44801#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:38,890 INFO L273 TraceCheckUtils]: 78: Hoare triple {44801#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44801#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:38,891 INFO L273 TraceCheckUtils]: 79: Hoare triple {44801#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44801#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:38,892 INFO L273 TraceCheckUtils]: 80: Hoare triple {44801#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {44802#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:38,892 INFO L273 TraceCheckUtils]: 81: Hoare triple {44802#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44802#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:38,893 INFO L273 TraceCheckUtils]: 82: Hoare triple {44802#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44802#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:38,893 INFO L273 TraceCheckUtils]: 83: Hoare triple {44802#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {44803#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:38,894 INFO L273 TraceCheckUtils]: 84: Hoare triple {44803#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44803#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:38,894 INFO L273 TraceCheckUtils]: 85: Hoare triple {44803#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44803#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:38,895 INFO L273 TraceCheckUtils]: 86: Hoare triple {44803#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {44804#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:38,895 INFO L273 TraceCheckUtils]: 87: Hoare triple {44804#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44804#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:38,896 INFO L273 TraceCheckUtils]: 88: Hoare triple {44804#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44804#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:38,897 INFO L273 TraceCheckUtils]: 89: Hoare triple {44804#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {44805#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:38,897 INFO L273 TraceCheckUtils]: 90: Hoare triple {44805#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44805#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:38,898 INFO L273 TraceCheckUtils]: 91: Hoare triple {44805#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44805#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:38,898 INFO L273 TraceCheckUtils]: 92: Hoare triple {44805#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {44806#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:38,899 INFO L273 TraceCheckUtils]: 93: Hoare triple {44806#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44806#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:38,899 INFO L273 TraceCheckUtils]: 94: Hoare triple {44806#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44806#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:38,900 INFO L273 TraceCheckUtils]: 95: Hoare triple {44806#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {44807#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:38,901 INFO L273 TraceCheckUtils]: 96: Hoare triple {44807#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44807#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:38,901 INFO L273 TraceCheckUtils]: 97: Hoare triple {44807#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44807#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:38,902 INFO L273 TraceCheckUtils]: 98: Hoare triple {44807#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {44808#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:38,902 INFO L273 TraceCheckUtils]: 99: Hoare triple {44808#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44808#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:38,903 INFO L273 TraceCheckUtils]: 100: Hoare triple {44808#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44808#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:38,903 INFO L273 TraceCheckUtils]: 101: Hoare triple {44808#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {44809#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:38,904 INFO L273 TraceCheckUtils]: 102: Hoare triple {44809#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44809#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:38,904 INFO L273 TraceCheckUtils]: 103: Hoare triple {44809#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44809#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:38,905 INFO L273 TraceCheckUtils]: 104: Hoare triple {44809#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {44810#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:38,906 INFO L273 TraceCheckUtils]: 105: Hoare triple {44810#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44810#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:38,906 INFO L273 TraceCheckUtils]: 106: Hoare triple {44810#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44810#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:38,907 INFO L273 TraceCheckUtils]: 107: Hoare triple {44810#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {44811#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:38,907 INFO L273 TraceCheckUtils]: 108: Hoare triple {44811#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44811#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:38,908 INFO L273 TraceCheckUtils]: 109: Hoare triple {44811#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44811#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:38,909 INFO L273 TraceCheckUtils]: 110: Hoare triple {44811#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {44812#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:38,909 INFO L273 TraceCheckUtils]: 111: Hoare triple {44812#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44812#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:38,910 INFO L273 TraceCheckUtils]: 112: Hoare triple {44812#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44812#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:38,910 INFO L273 TraceCheckUtils]: 113: Hoare triple {44812#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {44813#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:38,911 INFO L273 TraceCheckUtils]: 114: Hoare triple {44813#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44813#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:38,911 INFO L273 TraceCheckUtils]: 115: Hoare triple {44813#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44813#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:38,912 INFO L273 TraceCheckUtils]: 116: Hoare triple {44813#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {44814#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:38,913 INFO L273 TraceCheckUtils]: 117: Hoare triple {44814#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44814#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:38,913 INFO L273 TraceCheckUtils]: 118: Hoare triple {44814#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44814#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:38,914 INFO L273 TraceCheckUtils]: 119: Hoare triple {44814#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {44815#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:38,914 INFO L273 TraceCheckUtils]: 120: Hoare triple {44815#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44815#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:38,915 INFO L273 TraceCheckUtils]: 121: Hoare triple {44815#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44815#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:38,915 INFO L273 TraceCheckUtils]: 122: Hoare triple {44815#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {44816#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:38,916 INFO L273 TraceCheckUtils]: 123: Hoare triple {44816#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44816#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:38,916 INFO L273 TraceCheckUtils]: 124: Hoare triple {44816#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44816#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:38,917 INFO L273 TraceCheckUtils]: 125: Hoare triple {44816#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {44817#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:38,918 INFO L273 TraceCheckUtils]: 126: Hoare triple {44817#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44817#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:38,918 INFO L273 TraceCheckUtils]: 127: Hoare triple {44817#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44817#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:38,919 INFO L273 TraceCheckUtils]: 128: Hoare triple {44817#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {44818#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:38,919 INFO L273 TraceCheckUtils]: 129: Hoare triple {44818#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44818#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:38,920 INFO L273 TraceCheckUtils]: 130: Hoare triple {44818#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44818#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:38,921 INFO L273 TraceCheckUtils]: 131: Hoare triple {44818#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {44819#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:38,921 INFO L273 TraceCheckUtils]: 132: Hoare triple {44819#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44819#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:38,921 INFO L273 TraceCheckUtils]: 133: Hoare triple {44819#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44819#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:38,922 INFO L273 TraceCheckUtils]: 134: Hoare triple {44819#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {44820#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:38,923 INFO L273 TraceCheckUtils]: 135: Hoare triple {44820#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44820#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:38,923 INFO L273 TraceCheckUtils]: 136: Hoare triple {44820#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44820#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:38,924 INFO L273 TraceCheckUtils]: 137: Hoare triple {44820#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {44821#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:38,924 INFO L273 TraceCheckUtils]: 138: Hoare triple {44821#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44821#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:38,925 INFO L273 TraceCheckUtils]: 139: Hoare triple {44821#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44821#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:38,926 INFO L273 TraceCheckUtils]: 140: Hoare triple {44821#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {44822#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:38,926 INFO L273 TraceCheckUtils]: 141: Hoare triple {44822#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44822#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:38,927 INFO L273 TraceCheckUtils]: 142: Hoare triple {44822#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44822#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:38,927 INFO L273 TraceCheckUtils]: 143: Hoare triple {44822#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {44823#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:38,928 INFO L273 TraceCheckUtils]: 144: Hoare triple {44823#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44823#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:38,928 INFO L273 TraceCheckUtils]: 145: Hoare triple {44823#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44823#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:38,929 INFO L273 TraceCheckUtils]: 146: Hoare triple {44823#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {44824#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:38,930 INFO L273 TraceCheckUtils]: 147: Hoare triple {44824#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44824#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:38,930 INFO L273 TraceCheckUtils]: 148: Hoare triple {44824#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44824#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:38,931 INFO L273 TraceCheckUtils]: 149: Hoare triple {44824#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {44825#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:38,931 INFO L273 TraceCheckUtils]: 150: Hoare triple {44825#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44825#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:38,932 INFO L273 TraceCheckUtils]: 151: Hoare triple {44825#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44825#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:38,932 INFO L273 TraceCheckUtils]: 152: Hoare triple {44825#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {44826#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:38,933 INFO L273 TraceCheckUtils]: 153: Hoare triple {44826#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44826#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:38,934 INFO L273 TraceCheckUtils]: 154: Hoare triple {44826#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44826#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:38,934 INFO L273 TraceCheckUtils]: 155: Hoare triple {44826#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {44827#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:38,935 INFO L273 TraceCheckUtils]: 156: Hoare triple {44827#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44827#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:38,935 INFO L273 TraceCheckUtils]: 157: Hoare triple {44827#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44827#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:38,936 INFO L273 TraceCheckUtils]: 158: Hoare triple {44827#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {44828#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:38,936 INFO L273 TraceCheckUtils]: 159: Hoare triple {44828#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44828#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:38,937 INFO L273 TraceCheckUtils]: 160: Hoare triple {44828#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44828#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:38,938 INFO L273 TraceCheckUtils]: 161: Hoare triple {44828#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {44829#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:38,938 INFO L273 TraceCheckUtils]: 162: Hoare triple {44829#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44829#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:38,939 INFO L273 TraceCheckUtils]: 163: Hoare triple {44829#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44829#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:38,939 INFO L273 TraceCheckUtils]: 164: Hoare triple {44829#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {44830#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:38,940 INFO L273 TraceCheckUtils]: 165: Hoare triple {44830#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44830#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:38,940 INFO L273 TraceCheckUtils]: 166: Hoare triple {44830#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44830#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:38,941 INFO L273 TraceCheckUtils]: 167: Hoare triple {44830#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {44831#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:38,942 INFO L273 TraceCheckUtils]: 168: Hoare triple {44831#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44831#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:38,942 INFO L273 TraceCheckUtils]: 169: Hoare triple {44831#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {44831#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:38,943 INFO L273 TraceCheckUtils]: 170: Hoare triple {44831#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {44832#(<= main_~i~0 55)} is VALID [2018-11-23 11:57:38,943 INFO L273 TraceCheckUtils]: 171: Hoare triple {44832#(<= main_~i~0 55)} assume !(~i~0 < 100000); {44776#false} is VALID [2018-11-23 11:57:38,944 INFO L273 TraceCheckUtils]: 172: Hoare triple {44776#false} havoc ~x~0;~x~0 := 0; {44776#false} is VALID [2018-11-23 11:57:38,944 INFO L273 TraceCheckUtils]: 173: Hoare triple {44776#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {44776#false} is VALID [2018-11-23 11:57:38,944 INFO L256 TraceCheckUtils]: 174: Hoare triple {44776#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {44776#false} is VALID [2018-11-23 11:57:38,944 INFO L273 TraceCheckUtils]: 175: Hoare triple {44776#false} ~cond := #in~cond; {44776#false} is VALID [2018-11-23 11:57:38,944 INFO L273 TraceCheckUtils]: 176: Hoare triple {44776#false} assume 0 == ~cond; {44776#false} is VALID [2018-11-23 11:57:38,945 INFO L273 TraceCheckUtils]: 177: Hoare triple {44776#false} assume !false; {44776#false} is VALID [2018-11-23 11:57:38,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 0 proven. 4510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:38,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:38,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 59 [2018-11-23 11:57:38,984 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 178 [2018-11-23 11:57:38,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:38,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states. [2018-11-23 11:57:39,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:39,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-11-23 11:57:39,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-11-23 11:57:39,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-11-23 11:57:39,159 INFO L87 Difference]: Start difference. First operand 183 states and 239 transitions. Second operand 59 states. [2018-11-23 11:57:40,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:40,111 INFO L93 Difference]: Finished difference Result 199 states and 258 transitions. [2018-11-23 11:57:40,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-11-23 11:57:40,111 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 178 [2018-11-23 11:57:40,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:40,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 11:57:40,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 258 transitions. [2018-11-23 11:57:40,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 11:57:40,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 258 transitions. [2018-11-23 11:57:40,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states and 258 transitions. [2018-11-23 11:57:40,344 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:40,348 INFO L225 Difference]: With dead ends: 199 [2018-11-23 11:57:40,348 INFO L226 Difference]: Without dead ends: 188 [2018-11-23 11:57:40,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-11-23 11:57:40,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-23 11:57:40,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2018-11-23 11:57:40,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:40,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand 186 states. [2018-11-23 11:57:40,399 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand 186 states. [2018-11-23 11:57:40,399 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 186 states. [2018-11-23 11:57:40,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:40,403 INFO L93 Difference]: Finished difference Result 188 states and 246 transitions. [2018-11-23 11:57:40,403 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 246 transitions. [2018-11-23 11:57:40,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:40,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:40,403 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 188 states. [2018-11-23 11:57:40,403 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 188 states. [2018-11-23 11:57:40,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:40,406 INFO L93 Difference]: Finished difference Result 188 states and 246 transitions. [2018-11-23 11:57:40,406 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 246 transitions. [2018-11-23 11:57:40,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:40,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:40,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:40,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:40,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-11-23 11:57:40,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 243 transitions. [2018-11-23 11:57:40,409 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 243 transitions. Word has length 178 [2018-11-23 11:57:40,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:40,409 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 243 transitions. [2018-11-23 11:57:40,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-11-23 11:57:40,409 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 243 transitions. [2018-11-23 11:57:40,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-23 11:57:40,410 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:40,410 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:40,410 INFO L423 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:40,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:40,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1867070023, now seen corresponding path program 56 times [2018-11-23 11:57:40,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:40,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:40,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:40,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:57:40,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:42,084 INFO L256 TraceCheckUtils]: 0: Hoare triple {46259#true} call ULTIMATE.init(); {46259#true} is VALID [2018-11-23 11:57:42,084 INFO L273 TraceCheckUtils]: 1: Hoare triple {46259#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {46259#true} is VALID [2018-11-23 11:57:42,084 INFO L273 TraceCheckUtils]: 2: Hoare triple {46259#true} assume true; {46259#true} is VALID [2018-11-23 11:57:42,084 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {46259#true} {46259#true} #55#return; {46259#true} is VALID [2018-11-23 11:57:42,084 INFO L256 TraceCheckUtils]: 4: Hoare triple {46259#true} call #t~ret4 := main(); {46259#true} is VALID [2018-11-23 11:57:42,085 INFO L273 TraceCheckUtils]: 5: Hoare triple {46259#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {46261#(= main_~i~0 0)} is VALID [2018-11-23 11:57:42,085 INFO L273 TraceCheckUtils]: 6: Hoare triple {46261#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46261#(= main_~i~0 0)} is VALID [2018-11-23 11:57:42,085 INFO L273 TraceCheckUtils]: 7: Hoare triple {46261#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46261#(= main_~i~0 0)} is VALID [2018-11-23 11:57:42,086 INFO L273 TraceCheckUtils]: 8: Hoare triple {46261#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {46262#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:42,086 INFO L273 TraceCheckUtils]: 9: Hoare triple {46262#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46262#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:42,086 INFO L273 TraceCheckUtils]: 10: Hoare triple {46262#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46262#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:42,087 INFO L273 TraceCheckUtils]: 11: Hoare triple {46262#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {46263#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:42,087 INFO L273 TraceCheckUtils]: 12: Hoare triple {46263#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46263#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:42,088 INFO L273 TraceCheckUtils]: 13: Hoare triple {46263#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46263#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:42,089 INFO L273 TraceCheckUtils]: 14: Hoare triple {46263#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {46264#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:42,089 INFO L273 TraceCheckUtils]: 15: Hoare triple {46264#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46264#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:42,090 INFO L273 TraceCheckUtils]: 16: Hoare triple {46264#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46264#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:42,090 INFO L273 TraceCheckUtils]: 17: Hoare triple {46264#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {46265#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:42,091 INFO L273 TraceCheckUtils]: 18: Hoare triple {46265#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46265#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:42,091 INFO L273 TraceCheckUtils]: 19: Hoare triple {46265#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46265#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:42,092 INFO L273 TraceCheckUtils]: 20: Hoare triple {46265#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {46266#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:42,092 INFO L273 TraceCheckUtils]: 21: Hoare triple {46266#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46266#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:42,093 INFO L273 TraceCheckUtils]: 22: Hoare triple {46266#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46266#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:42,094 INFO L273 TraceCheckUtils]: 23: Hoare triple {46266#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {46267#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:42,094 INFO L273 TraceCheckUtils]: 24: Hoare triple {46267#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46267#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:42,095 INFO L273 TraceCheckUtils]: 25: Hoare triple {46267#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46267#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:42,095 INFO L273 TraceCheckUtils]: 26: Hoare triple {46267#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {46268#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:42,096 INFO L273 TraceCheckUtils]: 27: Hoare triple {46268#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46268#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:42,096 INFO L273 TraceCheckUtils]: 28: Hoare triple {46268#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46268#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:42,097 INFO L273 TraceCheckUtils]: 29: Hoare triple {46268#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {46269#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:42,098 INFO L273 TraceCheckUtils]: 30: Hoare triple {46269#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46269#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:42,098 INFO L273 TraceCheckUtils]: 31: Hoare triple {46269#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46269#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:42,099 INFO L273 TraceCheckUtils]: 32: Hoare triple {46269#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {46270#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:42,099 INFO L273 TraceCheckUtils]: 33: Hoare triple {46270#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46270#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:42,100 INFO L273 TraceCheckUtils]: 34: Hoare triple {46270#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46270#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:42,100 INFO L273 TraceCheckUtils]: 35: Hoare triple {46270#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {46271#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:42,101 INFO L273 TraceCheckUtils]: 36: Hoare triple {46271#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46271#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:42,101 INFO L273 TraceCheckUtils]: 37: Hoare triple {46271#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46271#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:42,102 INFO L273 TraceCheckUtils]: 38: Hoare triple {46271#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {46272#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:42,103 INFO L273 TraceCheckUtils]: 39: Hoare triple {46272#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46272#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:42,103 INFO L273 TraceCheckUtils]: 40: Hoare triple {46272#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46272#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:42,104 INFO L273 TraceCheckUtils]: 41: Hoare triple {46272#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {46273#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:42,104 INFO L273 TraceCheckUtils]: 42: Hoare triple {46273#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46273#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:42,105 INFO L273 TraceCheckUtils]: 43: Hoare triple {46273#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46273#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:42,106 INFO L273 TraceCheckUtils]: 44: Hoare triple {46273#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {46274#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:42,106 INFO L273 TraceCheckUtils]: 45: Hoare triple {46274#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46274#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:42,107 INFO L273 TraceCheckUtils]: 46: Hoare triple {46274#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46274#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:42,107 INFO L273 TraceCheckUtils]: 47: Hoare triple {46274#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {46275#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:42,108 INFO L273 TraceCheckUtils]: 48: Hoare triple {46275#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46275#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:42,108 INFO L273 TraceCheckUtils]: 49: Hoare triple {46275#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46275#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:42,109 INFO L273 TraceCheckUtils]: 50: Hoare triple {46275#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {46276#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:42,109 INFO L273 TraceCheckUtils]: 51: Hoare triple {46276#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46276#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:42,110 INFO L273 TraceCheckUtils]: 52: Hoare triple {46276#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46276#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:42,111 INFO L273 TraceCheckUtils]: 53: Hoare triple {46276#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {46277#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:42,111 INFO L273 TraceCheckUtils]: 54: Hoare triple {46277#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46277#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:42,112 INFO L273 TraceCheckUtils]: 55: Hoare triple {46277#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46277#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:42,112 INFO L273 TraceCheckUtils]: 56: Hoare triple {46277#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {46278#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:42,113 INFO L273 TraceCheckUtils]: 57: Hoare triple {46278#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46278#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:42,113 INFO L273 TraceCheckUtils]: 58: Hoare triple {46278#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46278#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:42,114 INFO L273 TraceCheckUtils]: 59: Hoare triple {46278#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {46279#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:42,115 INFO L273 TraceCheckUtils]: 60: Hoare triple {46279#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46279#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:42,115 INFO L273 TraceCheckUtils]: 61: Hoare triple {46279#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46279#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:42,116 INFO L273 TraceCheckUtils]: 62: Hoare triple {46279#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {46280#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:42,116 INFO L273 TraceCheckUtils]: 63: Hoare triple {46280#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46280#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:42,117 INFO L273 TraceCheckUtils]: 64: Hoare triple {46280#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46280#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:42,117 INFO L273 TraceCheckUtils]: 65: Hoare triple {46280#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {46281#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:42,118 INFO L273 TraceCheckUtils]: 66: Hoare triple {46281#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46281#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:42,118 INFO L273 TraceCheckUtils]: 67: Hoare triple {46281#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46281#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:42,119 INFO L273 TraceCheckUtils]: 68: Hoare triple {46281#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {46282#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:42,120 INFO L273 TraceCheckUtils]: 69: Hoare triple {46282#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46282#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:42,120 INFO L273 TraceCheckUtils]: 70: Hoare triple {46282#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46282#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:42,121 INFO L273 TraceCheckUtils]: 71: Hoare triple {46282#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {46283#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:42,121 INFO L273 TraceCheckUtils]: 72: Hoare triple {46283#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46283#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:42,122 INFO L273 TraceCheckUtils]: 73: Hoare triple {46283#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46283#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:42,123 INFO L273 TraceCheckUtils]: 74: Hoare triple {46283#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {46284#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:42,123 INFO L273 TraceCheckUtils]: 75: Hoare triple {46284#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46284#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:42,124 INFO L273 TraceCheckUtils]: 76: Hoare triple {46284#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46284#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:42,124 INFO L273 TraceCheckUtils]: 77: Hoare triple {46284#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {46285#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:42,125 INFO L273 TraceCheckUtils]: 78: Hoare triple {46285#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46285#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:42,125 INFO L273 TraceCheckUtils]: 79: Hoare triple {46285#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46285#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:42,126 INFO L273 TraceCheckUtils]: 80: Hoare triple {46285#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {46286#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:42,126 INFO L273 TraceCheckUtils]: 81: Hoare triple {46286#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46286#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:42,127 INFO L273 TraceCheckUtils]: 82: Hoare triple {46286#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46286#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:42,128 INFO L273 TraceCheckUtils]: 83: Hoare triple {46286#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {46287#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:42,128 INFO L273 TraceCheckUtils]: 84: Hoare triple {46287#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46287#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:42,129 INFO L273 TraceCheckUtils]: 85: Hoare triple {46287#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46287#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:42,129 INFO L273 TraceCheckUtils]: 86: Hoare triple {46287#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {46288#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:42,130 INFO L273 TraceCheckUtils]: 87: Hoare triple {46288#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46288#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:42,130 INFO L273 TraceCheckUtils]: 88: Hoare triple {46288#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46288#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:42,151 INFO L273 TraceCheckUtils]: 89: Hoare triple {46288#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {46289#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:42,151 INFO L273 TraceCheckUtils]: 90: Hoare triple {46289#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46289#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:42,152 INFO L273 TraceCheckUtils]: 91: Hoare triple {46289#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46289#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:42,152 INFO L273 TraceCheckUtils]: 92: Hoare triple {46289#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {46290#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:42,152 INFO L273 TraceCheckUtils]: 93: Hoare triple {46290#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46290#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:42,153 INFO L273 TraceCheckUtils]: 94: Hoare triple {46290#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46290#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:42,153 INFO L273 TraceCheckUtils]: 95: Hoare triple {46290#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {46291#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:42,153 INFO L273 TraceCheckUtils]: 96: Hoare triple {46291#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46291#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:42,154 INFO L273 TraceCheckUtils]: 97: Hoare triple {46291#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46291#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:42,154 INFO L273 TraceCheckUtils]: 98: Hoare triple {46291#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {46292#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:42,154 INFO L273 TraceCheckUtils]: 99: Hoare triple {46292#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46292#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:42,155 INFO L273 TraceCheckUtils]: 100: Hoare triple {46292#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46292#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:42,155 INFO L273 TraceCheckUtils]: 101: Hoare triple {46292#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {46293#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:42,156 INFO L273 TraceCheckUtils]: 102: Hoare triple {46293#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46293#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:42,156 INFO L273 TraceCheckUtils]: 103: Hoare triple {46293#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46293#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:42,157 INFO L273 TraceCheckUtils]: 104: Hoare triple {46293#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {46294#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:42,157 INFO L273 TraceCheckUtils]: 105: Hoare triple {46294#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46294#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:42,158 INFO L273 TraceCheckUtils]: 106: Hoare triple {46294#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46294#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:42,158 INFO L273 TraceCheckUtils]: 107: Hoare triple {46294#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {46295#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:42,159 INFO L273 TraceCheckUtils]: 108: Hoare triple {46295#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46295#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:42,159 INFO L273 TraceCheckUtils]: 109: Hoare triple {46295#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46295#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:42,160 INFO L273 TraceCheckUtils]: 110: Hoare triple {46295#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {46296#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:42,161 INFO L273 TraceCheckUtils]: 111: Hoare triple {46296#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46296#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:42,161 INFO L273 TraceCheckUtils]: 112: Hoare triple {46296#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46296#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:42,162 INFO L273 TraceCheckUtils]: 113: Hoare triple {46296#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {46297#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:42,162 INFO L273 TraceCheckUtils]: 114: Hoare triple {46297#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46297#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:42,163 INFO L273 TraceCheckUtils]: 115: Hoare triple {46297#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46297#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:42,164 INFO L273 TraceCheckUtils]: 116: Hoare triple {46297#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {46298#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:42,164 INFO L273 TraceCheckUtils]: 117: Hoare triple {46298#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46298#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:42,165 INFO L273 TraceCheckUtils]: 118: Hoare triple {46298#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46298#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:42,165 INFO L273 TraceCheckUtils]: 119: Hoare triple {46298#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {46299#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:42,166 INFO L273 TraceCheckUtils]: 120: Hoare triple {46299#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46299#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:42,166 INFO L273 TraceCheckUtils]: 121: Hoare triple {46299#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46299#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:42,167 INFO L273 TraceCheckUtils]: 122: Hoare triple {46299#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {46300#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:42,167 INFO L273 TraceCheckUtils]: 123: Hoare triple {46300#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46300#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:42,168 INFO L273 TraceCheckUtils]: 124: Hoare triple {46300#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46300#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:42,169 INFO L273 TraceCheckUtils]: 125: Hoare triple {46300#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {46301#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:42,169 INFO L273 TraceCheckUtils]: 126: Hoare triple {46301#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46301#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:42,170 INFO L273 TraceCheckUtils]: 127: Hoare triple {46301#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46301#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:42,170 INFO L273 TraceCheckUtils]: 128: Hoare triple {46301#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {46302#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:42,171 INFO L273 TraceCheckUtils]: 129: Hoare triple {46302#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46302#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:42,171 INFO L273 TraceCheckUtils]: 130: Hoare triple {46302#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46302#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:42,172 INFO L273 TraceCheckUtils]: 131: Hoare triple {46302#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {46303#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:42,173 INFO L273 TraceCheckUtils]: 132: Hoare triple {46303#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46303#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:42,173 INFO L273 TraceCheckUtils]: 133: Hoare triple {46303#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46303#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:42,174 INFO L273 TraceCheckUtils]: 134: Hoare triple {46303#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {46304#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:42,174 INFO L273 TraceCheckUtils]: 135: Hoare triple {46304#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46304#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:42,175 INFO L273 TraceCheckUtils]: 136: Hoare triple {46304#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46304#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:42,175 INFO L273 TraceCheckUtils]: 137: Hoare triple {46304#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {46305#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:42,176 INFO L273 TraceCheckUtils]: 138: Hoare triple {46305#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46305#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:42,176 INFO L273 TraceCheckUtils]: 139: Hoare triple {46305#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46305#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:42,177 INFO L273 TraceCheckUtils]: 140: Hoare triple {46305#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {46306#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:42,178 INFO L273 TraceCheckUtils]: 141: Hoare triple {46306#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46306#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:42,178 INFO L273 TraceCheckUtils]: 142: Hoare triple {46306#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46306#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:42,179 INFO L273 TraceCheckUtils]: 143: Hoare triple {46306#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {46307#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:42,179 INFO L273 TraceCheckUtils]: 144: Hoare triple {46307#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46307#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:42,180 INFO L273 TraceCheckUtils]: 145: Hoare triple {46307#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46307#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:42,181 INFO L273 TraceCheckUtils]: 146: Hoare triple {46307#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {46308#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:42,181 INFO L273 TraceCheckUtils]: 147: Hoare triple {46308#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46308#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:42,182 INFO L273 TraceCheckUtils]: 148: Hoare triple {46308#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46308#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:42,182 INFO L273 TraceCheckUtils]: 149: Hoare triple {46308#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {46309#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:42,183 INFO L273 TraceCheckUtils]: 150: Hoare triple {46309#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46309#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:42,183 INFO L273 TraceCheckUtils]: 151: Hoare triple {46309#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46309#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:42,184 INFO L273 TraceCheckUtils]: 152: Hoare triple {46309#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {46310#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:42,184 INFO L273 TraceCheckUtils]: 153: Hoare triple {46310#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46310#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:42,185 INFO L273 TraceCheckUtils]: 154: Hoare triple {46310#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46310#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:42,186 INFO L273 TraceCheckUtils]: 155: Hoare triple {46310#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {46311#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:42,186 INFO L273 TraceCheckUtils]: 156: Hoare triple {46311#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46311#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:42,187 INFO L273 TraceCheckUtils]: 157: Hoare triple {46311#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46311#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:42,187 INFO L273 TraceCheckUtils]: 158: Hoare triple {46311#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {46312#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:42,188 INFO L273 TraceCheckUtils]: 159: Hoare triple {46312#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46312#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:42,188 INFO L273 TraceCheckUtils]: 160: Hoare triple {46312#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46312#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:42,189 INFO L273 TraceCheckUtils]: 161: Hoare triple {46312#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {46313#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:42,190 INFO L273 TraceCheckUtils]: 162: Hoare triple {46313#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46313#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:42,190 INFO L273 TraceCheckUtils]: 163: Hoare triple {46313#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46313#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:42,191 INFO L273 TraceCheckUtils]: 164: Hoare triple {46313#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {46314#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:42,191 INFO L273 TraceCheckUtils]: 165: Hoare triple {46314#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46314#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:42,192 INFO L273 TraceCheckUtils]: 166: Hoare triple {46314#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46314#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:42,192 INFO L273 TraceCheckUtils]: 167: Hoare triple {46314#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {46315#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:42,193 INFO L273 TraceCheckUtils]: 168: Hoare triple {46315#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46315#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:42,193 INFO L273 TraceCheckUtils]: 169: Hoare triple {46315#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46315#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:42,194 INFO L273 TraceCheckUtils]: 170: Hoare triple {46315#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {46316#(<= main_~i~0 55)} is VALID [2018-11-23 11:57:42,195 INFO L273 TraceCheckUtils]: 171: Hoare triple {46316#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46316#(<= main_~i~0 55)} is VALID [2018-11-23 11:57:42,195 INFO L273 TraceCheckUtils]: 172: Hoare triple {46316#(<= main_~i~0 55)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46316#(<= main_~i~0 55)} is VALID [2018-11-23 11:57:42,196 INFO L273 TraceCheckUtils]: 173: Hoare triple {46316#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {46317#(<= main_~i~0 56)} is VALID [2018-11-23 11:57:42,197 INFO L273 TraceCheckUtils]: 174: Hoare triple {46317#(<= main_~i~0 56)} assume !(~i~0 < 100000); {46260#false} is VALID [2018-11-23 11:57:42,197 INFO L273 TraceCheckUtils]: 175: Hoare triple {46260#false} havoc ~x~0;~x~0 := 0; {46260#false} is VALID [2018-11-23 11:57:42,197 INFO L273 TraceCheckUtils]: 176: Hoare triple {46260#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {46260#false} is VALID [2018-11-23 11:57:42,197 INFO L256 TraceCheckUtils]: 177: Hoare triple {46260#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {46260#false} is VALID [2018-11-23 11:57:42,197 INFO L273 TraceCheckUtils]: 178: Hoare triple {46260#false} ~cond := #in~cond; {46260#false} is VALID [2018-11-23 11:57:42,197 INFO L273 TraceCheckUtils]: 179: Hoare triple {46260#false} assume 0 == ~cond; {46260#false} is VALID [2018-11-23 11:57:42,198 INFO L273 TraceCheckUtils]: 180: Hoare triple {46260#false} assume !false; {46260#false} is VALID [2018-11-23 11:57:42,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 0 proven. 4676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:42,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:42,220 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:42,228 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:57:42,312 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:57:42,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:57:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:42,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:42,798 INFO L256 TraceCheckUtils]: 0: Hoare triple {46259#true} call ULTIMATE.init(); {46259#true} is VALID [2018-11-23 11:57:42,798 INFO L273 TraceCheckUtils]: 1: Hoare triple {46259#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {46259#true} is VALID [2018-11-23 11:57:42,799 INFO L273 TraceCheckUtils]: 2: Hoare triple {46259#true} assume true; {46259#true} is VALID [2018-11-23 11:57:42,799 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {46259#true} {46259#true} #55#return; {46259#true} is VALID [2018-11-23 11:57:42,799 INFO L256 TraceCheckUtils]: 4: Hoare triple {46259#true} call #t~ret4 := main(); {46259#true} is VALID [2018-11-23 11:57:42,800 INFO L273 TraceCheckUtils]: 5: Hoare triple {46259#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {46336#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:42,800 INFO L273 TraceCheckUtils]: 6: Hoare triple {46336#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46336#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:42,801 INFO L273 TraceCheckUtils]: 7: Hoare triple {46336#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46336#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:42,801 INFO L273 TraceCheckUtils]: 8: Hoare triple {46336#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {46262#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:42,801 INFO L273 TraceCheckUtils]: 9: Hoare triple {46262#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46262#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:42,802 INFO L273 TraceCheckUtils]: 10: Hoare triple {46262#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46262#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:42,802 INFO L273 TraceCheckUtils]: 11: Hoare triple {46262#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {46263#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:42,802 INFO L273 TraceCheckUtils]: 12: Hoare triple {46263#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46263#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:42,803 INFO L273 TraceCheckUtils]: 13: Hoare triple {46263#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46263#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:42,804 INFO L273 TraceCheckUtils]: 14: Hoare triple {46263#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {46264#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:42,804 INFO L273 TraceCheckUtils]: 15: Hoare triple {46264#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46264#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:42,805 INFO L273 TraceCheckUtils]: 16: Hoare triple {46264#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46264#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:42,805 INFO L273 TraceCheckUtils]: 17: Hoare triple {46264#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {46265#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:42,806 INFO L273 TraceCheckUtils]: 18: Hoare triple {46265#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46265#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:42,806 INFO L273 TraceCheckUtils]: 19: Hoare triple {46265#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46265#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:42,807 INFO L273 TraceCheckUtils]: 20: Hoare triple {46265#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {46266#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:42,807 INFO L273 TraceCheckUtils]: 21: Hoare triple {46266#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46266#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:42,808 INFO L273 TraceCheckUtils]: 22: Hoare triple {46266#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46266#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:42,809 INFO L273 TraceCheckUtils]: 23: Hoare triple {46266#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {46267#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:42,809 INFO L273 TraceCheckUtils]: 24: Hoare triple {46267#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46267#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:42,810 INFO L273 TraceCheckUtils]: 25: Hoare triple {46267#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46267#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:42,810 INFO L273 TraceCheckUtils]: 26: Hoare triple {46267#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {46268#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:42,811 INFO L273 TraceCheckUtils]: 27: Hoare triple {46268#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46268#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:42,811 INFO L273 TraceCheckUtils]: 28: Hoare triple {46268#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46268#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:42,812 INFO L273 TraceCheckUtils]: 29: Hoare triple {46268#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {46269#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:42,813 INFO L273 TraceCheckUtils]: 30: Hoare triple {46269#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46269#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:42,813 INFO L273 TraceCheckUtils]: 31: Hoare triple {46269#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46269#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:42,814 INFO L273 TraceCheckUtils]: 32: Hoare triple {46269#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {46270#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:42,814 INFO L273 TraceCheckUtils]: 33: Hoare triple {46270#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46270#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:42,815 INFO L273 TraceCheckUtils]: 34: Hoare triple {46270#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46270#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:42,815 INFO L273 TraceCheckUtils]: 35: Hoare triple {46270#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {46271#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:42,816 INFO L273 TraceCheckUtils]: 36: Hoare triple {46271#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46271#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:42,816 INFO L273 TraceCheckUtils]: 37: Hoare triple {46271#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46271#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:42,817 INFO L273 TraceCheckUtils]: 38: Hoare triple {46271#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {46272#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:42,818 INFO L273 TraceCheckUtils]: 39: Hoare triple {46272#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46272#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:42,818 INFO L273 TraceCheckUtils]: 40: Hoare triple {46272#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46272#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:42,819 INFO L273 TraceCheckUtils]: 41: Hoare triple {46272#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {46273#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:42,819 INFO L273 TraceCheckUtils]: 42: Hoare triple {46273#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46273#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:42,820 INFO L273 TraceCheckUtils]: 43: Hoare triple {46273#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46273#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:42,821 INFO L273 TraceCheckUtils]: 44: Hoare triple {46273#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {46274#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:42,821 INFO L273 TraceCheckUtils]: 45: Hoare triple {46274#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46274#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:42,822 INFO L273 TraceCheckUtils]: 46: Hoare triple {46274#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46274#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:42,822 INFO L273 TraceCheckUtils]: 47: Hoare triple {46274#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {46275#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:42,823 INFO L273 TraceCheckUtils]: 48: Hoare triple {46275#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46275#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:42,823 INFO L273 TraceCheckUtils]: 49: Hoare triple {46275#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46275#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:42,824 INFO L273 TraceCheckUtils]: 50: Hoare triple {46275#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {46276#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:42,825 INFO L273 TraceCheckUtils]: 51: Hoare triple {46276#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46276#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:42,825 INFO L273 TraceCheckUtils]: 52: Hoare triple {46276#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46276#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:42,826 INFO L273 TraceCheckUtils]: 53: Hoare triple {46276#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {46277#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:42,826 INFO L273 TraceCheckUtils]: 54: Hoare triple {46277#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46277#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:42,827 INFO L273 TraceCheckUtils]: 55: Hoare triple {46277#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46277#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:42,827 INFO L273 TraceCheckUtils]: 56: Hoare triple {46277#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {46278#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:42,828 INFO L273 TraceCheckUtils]: 57: Hoare triple {46278#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46278#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:42,828 INFO L273 TraceCheckUtils]: 58: Hoare triple {46278#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46278#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:42,829 INFO L273 TraceCheckUtils]: 59: Hoare triple {46278#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {46279#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:42,830 INFO L273 TraceCheckUtils]: 60: Hoare triple {46279#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46279#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:42,830 INFO L273 TraceCheckUtils]: 61: Hoare triple {46279#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46279#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:42,831 INFO L273 TraceCheckUtils]: 62: Hoare triple {46279#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {46280#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:42,831 INFO L273 TraceCheckUtils]: 63: Hoare triple {46280#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46280#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:42,832 INFO L273 TraceCheckUtils]: 64: Hoare triple {46280#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46280#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:42,832 INFO L273 TraceCheckUtils]: 65: Hoare triple {46280#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {46281#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:42,833 INFO L273 TraceCheckUtils]: 66: Hoare triple {46281#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46281#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:42,833 INFO L273 TraceCheckUtils]: 67: Hoare triple {46281#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46281#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:42,834 INFO L273 TraceCheckUtils]: 68: Hoare triple {46281#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {46282#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:42,835 INFO L273 TraceCheckUtils]: 69: Hoare triple {46282#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46282#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:42,835 INFO L273 TraceCheckUtils]: 70: Hoare triple {46282#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46282#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:42,836 INFO L273 TraceCheckUtils]: 71: Hoare triple {46282#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {46283#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:42,836 INFO L273 TraceCheckUtils]: 72: Hoare triple {46283#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46283#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:42,837 INFO L273 TraceCheckUtils]: 73: Hoare triple {46283#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46283#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:42,838 INFO L273 TraceCheckUtils]: 74: Hoare triple {46283#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {46284#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:42,838 INFO L273 TraceCheckUtils]: 75: Hoare triple {46284#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46284#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:42,839 INFO L273 TraceCheckUtils]: 76: Hoare triple {46284#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46284#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:42,839 INFO L273 TraceCheckUtils]: 77: Hoare triple {46284#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {46285#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:42,840 INFO L273 TraceCheckUtils]: 78: Hoare triple {46285#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46285#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:42,840 INFO L273 TraceCheckUtils]: 79: Hoare triple {46285#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46285#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:42,841 INFO L273 TraceCheckUtils]: 80: Hoare triple {46285#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {46286#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:42,842 INFO L273 TraceCheckUtils]: 81: Hoare triple {46286#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46286#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:42,842 INFO L273 TraceCheckUtils]: 82: Hoare triple {46286#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46286#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:42,843 INFO L273 TraceCheckUtils]: 83: Hoare triple {46286#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {46287#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:42,843 INFO L273 TraceCheckUtils]: 84: Hoare triple {46287#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46287#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:42,844 INFO L273 TraceCheckUtils]: 85: Hoare triple {46287#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46287#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:42,844 INFO L273 TraceCheckUtils]: 86: Hoare triple {46287#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {46288#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:42,845 INFO L273 TraceCheckUtils]: 87: Hoare triple {46288#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46288#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:42,845 INFO L273 TraceCheckUtils]: 88: Hoare triple {46288#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46288#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:42,846 INFO L273 TraceCheckUtils]: 89: Hoare triple {46288#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {46289#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:42,847 INFO L273 TraceCheckUtils]: 90: Hoare triple {46289#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46289#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:42,847 INFO L273 TraceCheckUtils]: 91: Hoare triple {46289#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46289#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:42,848 INFO L273 TraceCheckUtils]: 92: Hoare triple {46289#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {46290#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:42,848 INFO L273 TraceCheckUtils]: 93: Hoare triple {46290#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46290#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:42,849 INFO L273 TraceCheckUtils]: 94: Hoare triple {46290#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46290#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:42,849 INFO L273 TraceCheckUtils]: 95: Hoare triple {46290#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {46291#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:42,850 INFO L273 TraceCheckUtils]: 96: Hoare triple {46291#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46291#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:42,850 INFO L273 TraceCheckUtils]: 97: Hoare triple {46291#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46291#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:42,851 INFO L273 TraceCheckUtils]: 98: Hoare triple {46291#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {46292#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:42,852 INFO L273 TraceCheckUtils]: 99: Hoare triple {46292#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46292#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:42,852 INFO L273 TraceCheckUtils]: 100: Hoare triple {46292#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46292#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:42,853 INFO L273 TraceCheckUtils]: 101: Hoare triple {46292#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {46293#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:42,853 INFO L273 TraceCheckUtils]: 102: Hoare triple {46293#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46293#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:42,854 INFO L273 TraceCheckUtils]: 103: Hoare triple {46293#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46293#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:42,855 INFO L273 TraceCheckUtils]: 104: Hoare triple {46293#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {46294#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:42,855 INFO L273 TraceCheckUtils]: 105: Hoare triple {46294#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46294#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:42,856 INFO L273 TraceCheckUtils]: 106: Hoare triple {46294#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46294#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:42,856 INFO L273 TraceCheckUtils]: 107: Hoare triple {46294#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {46295#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:42,857 INFO L273 TraceCheckUtils]: 108: Hoare triple {46295#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46295#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:42,857 INFO L273 TraceCheckUtils]: 109: Hoare triple {46295#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46295#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:42,858 INFO L273 TraceCheckUtils]: 110: Hoare triple {46295#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {46296#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:42,859 INFO L273 TraceCheckUtils]: 111: Hoare triple {46296#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46296#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:42,859 INFO L273 TraceCheckUtils]: 112: Hoare triple {46296#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46296#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:42,860 INFO L273 TraceCheckUtils]: 113: Hoare triple {46296#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {46297#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:42,860 INFO L273 TraceCheckUtils]: 114: Hoare triple {46297#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46297#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:42,861 INFO L273 TraceCheckUtils]: 115: Hoare triple {46297#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46297#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:42,862 INFO L273 TraceCheckUtils]: 116: Hoare triple {46297#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {46298#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:42,862 INFO L273 TraceCheckUtils]: 117: Hoare triple {46298#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46298#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:42,863 INFO L273 TraceCheckUtils]: 118: Hoare triple {46298#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46298#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:42,863 INFO L273 TraceCheckUtils]: 119: Hoare triple {46298#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {46299#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:42,864 INFO L273 TraceCheckUtils]: 120: Hoare triple {46299#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46299#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:42,864 INFO L273 TraceCheckUtils]: 121: Hoare triple {46299#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46299#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:42,865 INFO L273 TraceCheckUtils]: 122: Hoare triple {46299#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {46300#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:42,865 INFO L273 TraceCheckUtils]: 123: Hoare triple {46300#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46300#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:42,866 INFO L273 TraceCheckUtils]: 124: Hoare triple {46300#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46300#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:42,867 INFO L273 TraceCheckUtils]: 125: Hoare triple {46300#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {46301#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:42,867 INFO L273 TraceCheckUtils]: 126: Hoare triple {46301#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46301#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:42,868 INFO L273 TraceCheckUtils]: 127: Hoare triple {46301#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46301#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:42,868 INFO L273 TraceCheckUtils]: 128: Hoare triple {46301#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {46302#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:42,869 INFO L273 TraceCheckUtils]: 129: Hoare triple {46302#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46302#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:42,869 INFO L273 TraceCheckUtils]: 130: Hoare triple {46302#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46302#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:42,870 INFO L273 TraceCheckUtils]: 131: Hoare triple {46302#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {46303#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:42,871 INFO L273 TraceCheckUtils]: 132: Hoare triple {46303#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46303#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:42,871 INFO L273 TraceCheckUtils]: 133: Hoare triple {46303#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46303#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:42,872 INFO L273 TraceCheckUtils]: 134: Hoare triple {46303#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {46304#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:42,872 INFO L273 TraceCheckUtils]: 135: Hoare triple {46304#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46304#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:42,873 INFO L273 TraceCheckUtils]: 136: Hoare triple {46304#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46304#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:42,873 INFO L273 TraceCheckUtils]: 137: Hoare triple {46304#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {46305#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:42,874 INFO L273 TraceCheckUtils]: 138: Hoare triple {46305#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46305#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:42,874 INFO L273 TraceCheckUtils]: 139: Hoare triple {46305#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46305#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:42,875 INFO L273 TraceCheckUtils]: 140: Hoare triple {46305#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {46306#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:42,876 INFO L273 TraceCheckUtils]: 141: Hoare triple {46306#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46306#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:42,876 INFO L273 TraceCheckUtils]: 142: Hoare triple {46306#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46306#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:42,877 INFO L273 TraceCheckUtils]: 143: Hoare triple {46306#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {46307#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:42,877 INFO L273 TraceCheckUtils]: 144: Hoare triple {46307#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46307#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:42,878 INFO L273 TraceCheckUtils]: 145: Hoare triple {46307#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46307#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:42,879 INFO L273 TraceCheckUtils]: 146: Hoare triple {46307#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {46308#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:42,879 INFO L273 TraceCheckUtils]: 147: Hoare triple {46308#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46308#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:42,880 INFO L273 TraceCheckUtils]: 148: Hoare triple {46308#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46308#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:42,880 INFO L273 TraceCheckUtils]: 149: Hoare triple {46308#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {46309#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:42,881 INFO L273 TraceCheckUtils]: 150: Hoare triple {46309#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46309#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:42,881 INFO L273 TraceCheckUtils]: 151: Hoare triple {46309#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46309#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:42,882 INFO L273 TraceCheckUtils]: 152: Hoare triple {46309#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {46310#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:42,882 INFO L273 TraceCheckUtils]: 153: Hoare triple {46310#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46310#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:42,883 INFO L273 TraceCheckUtils]: 154: Hoare triple {46310#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46310#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:42,884 INFO L273 TraceCheckUtils]: 155: Hoare triple {46310#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {46311#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:42,884 INFO L273 TraceCheckUtils]: 156: Hoare triple {46311#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46311#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:42,885 INFO L273 TraceCheckUtils]: 157: Hoare triple {46311#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46311#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:42,885 INFO L273 TraceCheckUtils]: 158: Hoare triple {46311#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {46312#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:42,886 INFO L273 TraceCheckUtils]: 159: Hoare triple {46312#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46312#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:42,886 INFO L273 TraceCheckUtils]: 160: Hoare triple {46312#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46312#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:42,887 INFO L273 TraceCheckUtils]: 161: Hoare triple {46312#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {46313#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:42,888 INFO L273 TraceCheckUtils]: 162: Hoare triple {46313#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46313#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:42,888 INFO L273 TraceCheckUtils]: 163: Hoare triple {46313#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46313#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:42,889 INFO L273 TraceCheckUtils]: 164: Hoare triple {46313#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {46314#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:42,889 INFO L273 TraceCheckUtils]: 165: Hoare triple {46314#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46314#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:42,890 INFO L273 TraceCheckUtils]: 166: Hoare triple {46314#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46314#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:42,890 INFO L273 TraceCheckUtils]: 167: Hoare triple {46314#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {46315#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:42,891 INFO L273 TraceCheckUtils]: 168: Hoare triple {46315#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46315#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:42,891 INFO L273 TraceCheckUtils]: 169: Hoare triple {46315#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46315#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:42,892 INFO L273 TraceCheckUtils]: 170: Hoare triple {46315#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {46316#(<= main_~i~0 55)} is VALID [2018-11-23 11:57:42,893 INFO L273 TraceCheckUtils]: 171: Hoare triple {46316#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46316#(<= main_~i~0 55)} is VALID [2018-11-23 11:57:42,893 INFO L273 TraceCheckUtils]: 172: Hoare triple {46316#(<= main_~i~0 55)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {46316#(<= main_~i~0 55)} is VALID [2018-11-23 11:57:42,894 INFO L273 TraceCheckUtils]: 173: Hoare triple {46316#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {46317#(<= main_~i~0 56)} is VALID [2018-11-23 11:57:42,894 INFO L273 TraceCheckUtils]: 174: Hoare triple {46317#(<= main_~i~0 56)} assume !(~i~0 < 100000); {46260#false} is VALID [2018-11-23 11:57:42,895 INFO L273 TraceCheckUtils]: 175: Hoare triple {46260#false} havoc ~x~0;~x~0 := 0; {46260#false} is VALID [2018-11-23 11:57:42,895 INFO L273 TraceCheckUtils]: 176: Hoare triple {46260#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {46260#false} is VALID [2018-11-23 11:57:42,895 INFO L256 TraceCheckUtils]: 177: Hoare triple {46260#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {46260#false} is VALID [2018-11-23 11:57:42,895 INFO L273 TraceCheckUtils]: 178: Hoare triple {46260#false} ~cond := #in~cond; {46260#false} is VALID [2018-11-23 11:57:42,895 INFO L273 TraceCheckUtils]: 179: Hoare triple {46260#false} assume 0 == ~cond; {46260#false} is VALID [2018-11-23 11:57:42,896 INFO L273 TraceCheckUtils]: 180: Hoare triple {46260#false} assume !false; {46260#false} is VALID [2018-11-23 11:57:42,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 0 proven. 4676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:42,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:42,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 60 [2018-11-23 11:57:42,937 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 181 [2018-11-23 11:57:42,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:42,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states. [2018-11-23 11:57:43,117 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:43,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-11-23 11:57:43,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-11-23 11:57:43,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-11-23 11:57:43,119 INFO L87 Difference]: Start difference. First operand 186 states and 243 transitions. Second operand 60 states. [2018-11-23 11:57:44,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:44,335 INFO L93 Difference]: Finished difference Result 202 states and 262 transitions. [2018-11-23 11:57:44,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-23 11:57:44,335 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 181 [2018-11-23 11:57:44,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:44,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 11:57:44,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 262 transitions. [2018-11-23 11:57:44,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 11:57:44,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 262 transitions. [2018-11-23 11:57:44,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states and 262 transitions. [2018-11-23 11:57:44,579 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:44,583 INFO L225 Difference]: With dead ends: 202 [2018-11-23 11:57:44,583 INFO L226 Difference]: Without dead ends: 191 [2018-11-23 11:57:44,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-11-23 11:57:44,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-11-23 11:57:44,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2018-11-23 11:57:44,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:44,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand 189 states. [2018-11-23 11:57:44,632 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand 189 states. [2018-11-23 11:57:44,632 INFO L87 Difference]: Start difference. First operand 191 states. Second operand 189 states. [2018-11-23 11:57:44,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:44,635 INFO L93 Difference]: Finished difference Result 191 states and 250 transitions. [2018-11-23 11:57:44,635 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 250 transitions. [2018-11-23 11:57:44,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:44,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:44,636 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand 191 states. [2018-11-23 11:57:44,636 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 191 states. [2018-11-23 11:57:44,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:44,638 INFO L93 Difference]: Finished difference Result 191 states and 250 transitions. [2018-11-23 11:57:44,638 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 250 transitions. [2018-11-23 11:57:44,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:44,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:44,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:44,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:44,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-23 11:57:44,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 247 transitions. [2018-11-23 11:57:44,641 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 247 transitions. Word has length 181 [2018-11-23 11:57:44,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:44,641 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 247 transitions. [2018-11-23 11:57:44,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-11-23 11:57:44,642 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 247 transitions. [2018-11-23 11:57:44,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-23 11:57:44,642 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:44,642 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:44,643 INFO L423 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:44,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:44,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1283761123, now seen corresponding path program 57 times [2018-11-23 11:57:44,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:44,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:44,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:44,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:44,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:46,399 INFO L256 TraceCheckUtils]: 0: Hoare triple {47767#true} call ULTIMATE.init(); {47767#true} is VALID [2018-11-23 11:57:46,400 INFO L273 TraceCheckUtils]: 1: Hoare triple {47767#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {47767#true} is VALID [2018-11-23 11:57:46,400 INFO L273 TraceCheckUtils]: 2: Hoare triple {47767#true} assume true; {47767#true} is VALID [2018-11-23 11:57:46,400 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {47767#true} {47767#true} #55#return; {47767#true} is VALID [2018-11-23 11:57:46,400 INFO L256 TraceCheckUtils]: 4: Hoare triple {47767#true} call #t~ret4 := main(); {47767#true} is VALID [2018-11-23 11:57:46,401 INFO L273 TraceCheckUtils]: 5: Hoare triple {47767#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {47769#(= main_~i~0 0)} is VALID [2018-11-23 11:57:46,401 INFO L273 TraceCheckUtils]: 6: Hoare triple {47769#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47769#(= main_~i~0 0)} is VALID [2018-11-23 11:57:46,402 INFO L273 TraceCheckUtils]: 7: Hoare triple {47769#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47769#(= main_~i~0 0)} is VALID [2018-11-23 11:57:46,402 INFO L273 TraceCheckUtils]: 8: Hoare triple {47769#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {47770#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:46,403 INFO L273 TraceCheckUtils]: 9: Hoare triple {47770#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47770#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:46,403 INFO L273 TraceCheckUtils]: 10: Hoare triple {47770#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47770#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:46,404 INFO L273 TraceCheckUtils]: 11: Hoare triple {47770#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {47771#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:46,404 INFO L273 TraceCheckUtils]: 12: Hoare triple {47771#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47771#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:46,405 INFO L273 TraceCheckUtils]: 13: Hoare triple {47771#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47771#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:46,406 INFO L273 TraceCheckUtils]: 14: Hoare triple {47771#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {47772#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:46,406 INFO L273 TraceCheckUtils]: 15: Hoare triple {47772#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47772#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:46,407 INFO L273 TraceCheckUtils]: 16: Hoare triple {47772#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47772#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:46,407 INFO L273 TraceCheckUtils]: 17: Hoare triple {47772#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {47773#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:46,408 INFO L273 TraceCheckUtils]: 18: Hoare triple {47773#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47773#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:46,408 INFO L273 TraceCheckUtils]: 19: Hoare triple {47773#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47773#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:46,409 INFO L273 TraceCheckUtils]: 20: Hoare triple {47773#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {47774#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:46,409 INFO L273 TraceCheckUtils]: 21: Hoare triple {47774#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47774#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:46,410 INFO L273 TraceCheckUtils]: 22: Hoare triple {47774#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47774#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:46,410 INFO L273 TraceCheckUtils]: 23: Hoare triple {47774#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {47775#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:46,411 INFO L273 TraceCheckUtils]: 24: Hoare triple {47775#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47775#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:46,411 INFO L273 TraceCheckUtils]: 25: Hoare triple {47775#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47775#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:46,412 INFO L273 TraceCheckUtils]: 26: Hoare triple {47775#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {47776#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:46,413 INFO L273 TraceCheckUtils]: 27: Hoare triple {47776#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47776#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:46,413 INFO L273 TraceCheckUtils]: 28: Hoare triple {47776#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47776#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:46,414 INFO L273 TraceCheckUtils]: 29: Hoare triple {47776#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {47777#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:46,414 INFO L273 TraceCheckUtils]: 30: Hoare triple {47777#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47777#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:46,415 INFO L273 TraceCheckUtils]: 31: Hoare triple {47777#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47777#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:46,415 INFO L273 TraceCheckUtils]: 32: Hoare triple {47777#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {47778#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:46,416 INFO L273 TraceCheckUtils]: 33: Hoare triple {47778#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47778#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:46,416 INFO L273 TraceCheckUtils]: 34: Hoare triple {47778#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47778#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:46,417 INFO L273 TraceCheckUtils]: 35: Hoare triple {47778#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {47779#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:46,417 INFO L273 TraceCheckUtils]: 36: Hoare triple {47779#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47779#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:46,418 INFO L273 TraceCheckUtils]: 37: Hoare triple {47779#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47779#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:46,418 INFO L273 TraceCheckUtils]: 38: Hoare triple {47779#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {47780#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:46,419 INFO L273 TraceCheckUtils]: 39: Hoare triple {47780#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47780#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:46,419 INFO L273 TraceCheckUtils]: 40: Hoare triple {47780#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47780#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:46,420 INFO L273 TraceCheckUtils]: 41: Hoare triple {47780#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {47781#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:46,420 INFO L273 TraceCheckUtils]: 42: Hoare triple {47781#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47781#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:46,421 INFO L273 TraceCheckUtils]: 43: Hoare triple {47781#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47781#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:46,422 INFO L273 TraceCheckUtils]: 44: Hoare triple {47781#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {47782#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:46,422 INFO L273 TraceCheckUtils]: 45: Hoare triple {47782#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47782#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:46,423 INFO L273 TraceCheckUtils]: 46: Hoare triple {47782#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47782#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:46,423 INFO L273 TraceCheckUtils]: 47: Hoare triple {47782#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {47783#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:46,424 INFO L273 TraceCheckUtils]: 48: Hoare triple {47783#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47783#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:46,424 INFO L273 TraceCheckUtils]: 49: Hoare triple {47783#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47783#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:46,425 INFO L273 TraceCheckUtils]: 50: Hoare triple {47783#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {47784#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:46,425 INFO L273 TraceCheckUtils]: 51: Hoare triple {47784#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47784#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:46,426 INFO L273 TraceCheckUtils]: 52: Hoare triple {47784#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47784#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:46,427 INFO L273 TraceCheckUtils]: 53: Hoare triple {47784#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {47785#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:46,427 INFO L273 TraceCheckUtils]: 54: Hoare triple {47785#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47785#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:46,428 INFO L273 TraceCheckUtils]: 55: Hoare triple {47785#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47785#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:46,428 INFO L273 TraceCheckUtils]: 56: Hoare triple {47785#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {47786#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:46,429 INFO L273 TraceCheckUtils]: 57: Hoare triple {47786#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47786#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:46,429 INFO L273 TraceCheckUtils]: 58: Hoare triple {47786#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47786#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:46,430 INFO L273 TraceCheckUtils]: 59: Hoare triple {47786#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {47787#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:46,430 INFO L273 TraceCheckUtils]: 60: Hoare triple {47787#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47787#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:46,431 INFO L273 TraceCheckUtils]: 61: Hoare triple {47787#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47787#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:46,432 INFO L273 TraceCheckUtils]: 62: Hoare triple {47787#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {47788#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:46,432 INFO L273 TraceCheckUtils]: 63: Hoare triple {47788#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47788#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:46,433 INFO L273 TraceCheckUtils]: 64: Hoare triple {47788#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47788#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:46,433 INFO L273 TraceCheckUtils]: 65: Hoare triple {47788#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {47789#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:46,434 INFO L273 TraceCheckUtils]: 66: Hoare triple {47789#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47789#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:46,434 INFO L273 TraceCheckUtils]: 67: Hoare triple {47789#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47789#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:46,435 INFO L273 TraceCheckUtils]: 68: Hoare triple {47789#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {47790#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:46,435 INFO L273 TraceCheckUtils]: 69: Hoare triple {47790#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47790#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:46,436 INFO L273 TraceCheckUtils]: 70: Hoare triple {47790#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47790#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:46,437 INFO L273 TraceCheckUtils]: 71: Hoare triple {47790#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {47791#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:46,437 INFO L273 TraceCheckUtils]: 72: Hoare triple {47791#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47791#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:46,438 INFO L273 TraceCheckUtils]: 73: Hoare triple {47791#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47791#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:46,438 INFO L273 TraceCheckUtils]: 74: Hoare triple {47791#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {47792#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:46,439 INFO L273 TraceCheckUtils]: 75: Hoare triple {47792#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47792#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:46,439 INFO L273 TraceCheckUtils]: 76: Hoare triple {47792#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47792#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:46,440 INFO L273 TraceCheckUtils]: 77: Hoare triple {47792#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {47793#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:46,440 INFO L273 TraceCheckUtils]: 78: Hoare triple {47793#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47793#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:46,441 INFO L273 TraceCheckUtils]: 79: Hoare triple {47793#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47793#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:46,441 INFO L273 TraceCheckUtils]: 80: Hoare triple {47793#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {47794#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:46,442 INFO L273 TraceCheckUtils]: 81: Hoare triple {47794#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47794#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:46,442 INFO L273 TraceCheckUtils]: 82: Hoare triple {47794#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47794#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:46,443 INFO L273 TraceCheckUtils]: 83: Hoare triple {47794#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {47795#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:46,443 INFO L273 TraceCheckUtils]: 84: Hoare triple {47795#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47795#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:46,444 INFO L273 TraceCheckUtils]: 85: Hoare triple {47795#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47795#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:46,445 INFO L273 TraceCheckUtils]: 86: Hoare triple {47795#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {47796#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:46,445 INFO L273 TraceCheckUtils]: 87: Hoare triple {47796#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47796#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:46,445 INFO L273 TraceCheckUtils]: 88: Hoare triple {47796#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47796#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:46,446 INFO L273 TraceCheckUtils]: 89: Hoare triple {47796#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {47797#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:46,447 INFO L273 TraceCheckUtils]: 90: Hoare triple {47797#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47797#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:46,447 INFO L273 TraceCheckUtils]: 91: Hoare triple {47797#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47797#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:46,448 INFO L273 TraceCheckUtils]: 92: Hoare triple {47797#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {47798#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:46,448 INFO L273 TraceCheckUtils]: 93: Hoare triple {47798#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47798#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:46,449 INFO L273 TraceCheckUtils]: 94: Hoare triple {47798#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47798#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:46,449 INFO L273 TraceCheckUtils]: 95: Hoare triple {47798#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {47799#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:46,450 INFO L273 TraceCheckUtils]: 96: Hoare triple {47799#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47799#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:46,450 INFO L273 TraceCheckUtils]: 97: Hoare triple {47799#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47799#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:46,451 INFO L273 TraceCheckUtils]: 98: Hoare triple {47799#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {47800#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:46,451 INFO L273 TraceCheckUtils]: 99: Hoare triple {47800#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47800#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:46,452 INFO L273 TraceCheckUtils]: 100: Hoare triple {47800#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47800#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:46,453 INFO L273 TraceCheckUtils]: 101: Hoare triple {47800#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {47801#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:46,453 INFO L273 TraceCheckUtils]: 102: Hoare triple {47801#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47801#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:46,453 INFO L273 TraceCheckUtils]: 103: Hoare triple {47801#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47801#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:46,454 INFO L273 TraceCheckUtils]: 104: Hoare triple {47801#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {47802#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:46,455 INFO L273 TraceCheckUtils]: 105: Hoare triple {47802#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47802#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:46,455 INFO L273 TraceCheckUtils]: 106: Hoare triple {47802#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47802#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:46,456 INFO L273 TraceCheckUtils]: 107: Hoare triple {47802#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {47803#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:46,456 INFO L273 TraceCheckUtils]: 108: Hoare triple {47803#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47803#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:46,457 INFO L273 TraceCheckUtils]: 109: Hoare triple {47803#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47803#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:46,457 INFO L273 TraceCheckUtils]: 110: Hoare triple {47803#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {47804#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:46,458 INFO L273 TraceCheckUtils]: 111: Hoare triple {47804#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47804#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:46,458 INFO L273 TraceCheckUtils]: 112: Hoare triple {47804#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47804#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:46,459 INFO L273 TraceCheckUtils]: 113: Hoare triple {47804#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {47805#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:46,459 INFO L273 TraceCheckUtils]: 114: Hoare triple {47805#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47805#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:46,460 INFO L273 TraceCheckUtils]: 115: Hoare triple {47805#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47805#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:46,461 INFO L273 TraceCheckUtils]: 116: Hoare triple {47805#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {47806#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:46,461 INFO L273 TraceCheckUtils]: 117: Hoare triple {47806#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47806#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:46,461 INFO L273 TraceCheckUtils]: 118: Hoare triple {47806#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47806#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:46,462 INFO L273 TraceCheckUtils]: 119: Hoare triple {47806#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {47807#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:46,463 INFO L273 TraceCheckUtils]: 120: Hoare triple {47807#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47807#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:46,463 INFO L273 TraceCheckUtils]: 121: Hoare triple {47807#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47807#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:46,464 INFO L273 TraceCheckUtils]: 122: Hoare triple {47807#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {47808#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:46,464 INFO L273 TraceCheckUtils]: 123: Hoare triple {47808#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47808#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:46,465 INFO L273 TraceCheckUtils]: 124: Hoare triple {47808#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47808#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:46,465 INFO L273 TraceCheckUtils]: 125: Hoare triple {47808#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {47809#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:46,466 INFO L273 TraceCheckUtils]: 126: Hoare triple {47809#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47809#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:46,466 INFO L273 TraceCheckUtils]: 127: Hoare triple {47809#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47809#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:46,467 INFO L273 TraceCheckUtils]: 128: Hoare triple {47809#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {47810#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:46,468 INFO L273 TraceCheckUtils]: 129: Hoare triple {47810#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47810#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:46,468 INFO L273 TraceCheckUtils]: 130: Hoare triple {47810#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47810#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:46,469 INFO L273 TraceCheckUtils]: 131: Hoare triple {47810#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {47811#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:46,469 INFO L273 TraceCheckUtils]: 132: Hoare triple {47811#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47811#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:46,470 INFO L273 TraceCheckUtils]: 133: Hoare triple {47811#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47811#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:46,470 INFO L273 TraceCheckUtils]: 134: Hoare triple {47811#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {47812#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:46,471 INFO L273 TraceCheckUtils]: 135: Hoare triple {47812#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47812#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:46,471 INFO L273 TraceCheckUtils]: 136: Hoare triple {47812#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47812#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:46,472 INFO L273 TraceCheckUtils]: 137: Hoare triple {47812#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {47813#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:46,473 INFO L273 TraceCheckUtils]: 138: Hoare triple {47813#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47813#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:46,473 INFO L273 TraceCheckUtils]: 139: Hoare triple {47813#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47813#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:46,474 INFO L273 TraceCheckUtils]: 140: Hoare triple {47813#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {47814#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:46,474 INFO L273 TraceCheckUtils]: 141: Hoare triple {47814#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47814#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:46,475 INFO L273 TraceCheckUtils]: 142: Hoare triple {47814#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47814#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:46,475 INFO L273 TraceCheckUtils]: 143: Hoare triple {47814#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {47815#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:46,476 INFO L273 TraceCheckUtils]: 144: Hoare triple {47815#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47815#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:46,476 INFO L273 TraceCheckUtils]: 145: Hoare triple {47815#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47815#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:46,477 INFO L273 TraceCheckUtils]: 146: Hoare triple {47815#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {47816#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:46,477 INFO L273 TraceCheckUtils]: 147: Hoare triple {47816#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47816#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:46,478 INFO L273 TraceCheckUtils]: 148: Hoare triple {47816#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47816#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:46,479 INFO L273 TraceCheckUtils]: 149: Hoare triple {47816#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {47817#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:46,479 INFO L273 TraceCheckUtils]: 150: Hoare triple {47817#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47817#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:46,480 INFO L273 TraceCheckUtils]: 151: Hoare triple {47817#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47817#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:46,480 INFO L273 TraceCheckUtils]: 152: Hoare triple {47817#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {47818#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:46,481 INFO L273 TraceCheckUtils]: 153: Hoare triple {47818#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47818#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:46,481 INFO L273 TraceCheckUtils]: 154: Hoare triple {47818#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47818#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:46,482 INFO L273 TraceCheckUtils]: 155: Hoare triple {47818#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {47819#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:46,482 INFO L273 TraceCheckUtils]: 156: Hoare triple {47819#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47819#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:46,483 INFO L273 TraceCheckUtils]: 157: Hoare triple {47819#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47819#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:46,483 INFO L273 TraceCheckUtils]: 158: Hoare triple {47819#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {47820#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:46,484 INFO L273 TraceCheckUtils]: 159: Hoare triple {47820#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47820#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:46,484 INFO L273 TraceCheckUtils]: 160: Hoare triple {47820#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47820#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:46,485 INFO L273 TraceCheckUtils]: 161: Hoare triple {47820#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {47821#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:46,485 INFO L273 TraceCheckUtils]: 162: Hoare triple {47821#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47821#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:46,486 INFO L273 TraceCheckUtils]: 163: Hoare triple {47821#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47821#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:46,487 INFO L273 TraceCheckUtils]: 164: Hoare triple {47821#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {47822#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:46,487 INFO L273 TraceCheckUtils]: 165: Hoare triple {47822#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47822#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:46,488 INFO L273 TraceCheckUtils]: 166: Hoare triple {47822#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47822#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:46,488 INFO L273 TraceCheckUtils]: 167: Hoare triple {47822#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {47823#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:46,489 INFO L273 TraceCheckUtils]: 168: Hoare triple {47823#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47823#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:46,489 INFO L273 TraceCheckUtils]: 169: Hoare triple {47823#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47823#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:46,490 INFO L273 TraceCheckUtils]: 170: Hoare triple {47823#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {47824#(<= main_~i~0 55)} is VALID [2018-11-23 11:57:46,490 INFO L273 TraceCheckUtils]: 171: Hoare triple {47824#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47824#(<= main_~i~0 55)} is VALID [2018-11-23 11:57:46,491 INFO L273 TraceCheckUtils]: 172: Hoare triple {47824#(<= main_~i~0 55)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47824#(<= main_~i~0 55)} is VALID [2018-11-23 11:57:46,492 INFO L273 TraceCheckUtils]: 173: Hoare triple {47824#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {47825#(<= main_~i~0 56)} is VALID [2018-11-23 11:57:46,492 INFO L273 TraceCheckUtils]: 174: Hoare triple {47825#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47825#(<= main_~i~0 56)} is VALID [2018-11-23 11:57:46,493 INFO L273 TraceCheckUtils]: 175: Hoare triple {47825#(<= main_~i~0 56)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47825#(<= main_~i~0 56)} is VALID [2018-11-23 11:57:46,493 INFO L273 TraceCheckUtils]: 176: Hoare triple {47825#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {47826#(<= main_~i~0 57)} is VALID [2018-11-23 11:57:46,494 INFO L273 TraceCheckUtils]: 177: Hoare triple {47826#(<= main_~i~0 57)} assume !(~i~0 < 100000); {47768#false} is VALID [2018-11-23 11:57:46,494 INFO L273 TraceCheckUtils]: 178: Hoare triple {47768#false} havoc ~x~0;~x~0 := 0; {47768#false} is VALID [2018-11-23 11:57:46,494 INFO L273 TraceCheckUtils]: 179: Hoare triple {47768#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {47768#false} is VALID [2018-11-23 11:57:46,494 INFO L256 TraceCheckUtils]: 180: Hoare triple {47768#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {47768#false} is VALID [2018-11-23 11:57:46,495 INFO L273 TraceCheckUtils]: 181: Hoare triple {47768#false} ~cond := #in~cond; {47768#false} is VALID [2018-11-23 11:57:46,495 INFO L273 TraceCheckUtils]: 182: Hoare triple {47768#false} assume 0 == ~cond; {47768#false} is VALID [2018-11-23 11:57:46,495 INFO L273 TraceCheckUtils]: 183: Hoare triple {47768#false} assume !false; {47768#false} is VALID [2018-11-23 11:57:46,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 0 proven. 4845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:46,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:46,517 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:46,542 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:57:46,708 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-11-23 11:57:46,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:57:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:46,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:47,158 INFO L256 TraceCheckUtils]: 0: Hoare triple {47767#true} call ULTIMATE.init(); {47767#true} is VALID [2018-11-23 11:57:47,158 INFO L273 TraceCheckUtils]: 1: Hoare triple {47767#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {47767#true} is VALID [2018-11-23 11:57:47,158 INFO L273 TraceCheckUtils]: 2: Hoare triple {47767#true} assume true; {47767#true} is VALID [2018-11-23 11:57:47,159 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {47767#true} {47767#true} #55#return; {47767#true} is VALID [2018-11-23 11:57:47,159 INFO L256 TraceCheckUtils]: 4: Hoare triple {47767#true} call #t~ret4 := main(); {47767#true} is VALID [2018-11-23 11:57:47,159 INFO L273 TraceCheckUtils]: 5: Hoare triple {47767#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {47845#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:47,160 INFO L273 TraceCheckUtils]: 6: Hoare triple {47845#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47845#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:47,160 INFO L273 TraceCheckUtils]: 7: Hoare triple {47845#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47845#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:47,161 INFO L273 TraceCheckUtils]: 8: Hoare triple {47845#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {47770#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:47,161 INFO L273 TraceCheckUtils]: 9: Hoare triple {47770#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47770#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:47,161 INFO L273 TraceCheckUtils]: 10: Hoare triple {47770#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47770#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:47,162 INFO L273 TraceCheckUtils]: 11: Hoare triple {47770#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {47771#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:47,162 INFO L273 TraceCheckUtils]: 12: Hoare triple {47771#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47771#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:47,163 INFO L273 TraceCheckUtils]: 13: Hoare triple {47771#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47771#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:47,163 INFO L273 TraceCheckUtils]: 14: Hoare triple {47771#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {47772#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:47,164 INFO L273 TraceCheckUtils]: 15: Hoare triple {47772#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47772#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:47,164 INFO L273 TraceCheckUtils]: 16: Hoare triple {47772#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47772#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:47,165 INFO L273 TraceCheckUtils]: 17: Hoare triple {47772#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {47773#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:47,166 INFO L273 TraceCheckUtils]: 18: Hoare triple {47773#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47773#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:47,166 INFO L273 TraceCheckUtils]: 19: Hoare triple {47773#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47773#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:47,167 INFO L273 TraceCheckUtils]: 20: Hoare triple {47773#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {47774#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:47,167 INFO L273 TraceCheckUtils]: 21: Hoare triple {47774#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47774#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:47,168 INFO L273 TraceCheckUtils]: 22: Hoare triple {47774#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47774#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:47,168 INFO L273 TraceCheckUtils]: 23: Hoare triple {47774#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {47775#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:47,169 INFO L273 TraceCheckUtils]: 24: Hoare triple {47775#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47775#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:47,169 INFO L273 TraceCheckUtils]: 25: Hoare triple {47775#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47775#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:47,170 INFO L273 TraceCheckUtils]: 26: Hoare triple {47775#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {47776#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:47,170 INFO L273 TraceCheckUtils]: 27: Hoare triple {47776#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47776#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:47,171 INFO L273 TraceCheckUtils]: 28: Hoare triple {47776#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47776#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:47,172 INFO L273 TraceCheckUtils]: 29: Hoare triple {47776#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {47777#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:47,172 INFO L273 TraceCheckUtils]: 30: Hoare triple {47777#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47777#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:47,172 INFO L273 TraceCheckUtils]: 31: Hoare triple {47777#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47777#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:47,173 INFO L273 TraceCheckUtils]: 32: Hoare triple {47777#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {47778#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:47,174 INFO L273 TraceCheckUtils]: 33: Hoare triple {47778#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47778#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:47,174 INFO L273 TraceCheckUtils]: 34: Hoare triple {47778#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47778#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:47,175 INFO L273 TraceCheckUtils]: 35: Hoare triple {47778#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {47779#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:47,175 INFO L273 TraceCheckUtils]: 36: Hoare triple {47779#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47779#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:47,176 INFO L273 TraceCheckUtils]: 37: Hoare triple {47779#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47779#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:47,176 INFO L273 TraceCheckUtils]: 38: Hoare triple {47779#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {47780#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:47,177 INFO L273 TraceCheckUtils]: 39: Hoare triple {47780#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47780#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:47,177 INFO L273 TraceCheckUtils]: 40: Hoare triple {47780#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47780#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:47,178 INFO L273 TraceCheckUtils]: 41: Hoare triple {47780#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {47781#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:47,179 INFO L273 TraceCheckUtils]: 42: Hoare triple {47781#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47781#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:47,179 INFO L273 TraceCheckUtils]: 43: Hoare triple {47781#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47781#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:47,180 INFO L273 TraceCheckUtils]: 44: Hoare triple {47781#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {47782#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:47,180 INFO L273 TraceCheckUtils]: 45: Hoare triple {47782#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47782#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:47,181 INFO L273 TraceCheckUtils]: 46: Hoare triple {47782#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47782#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:47,182 INFO L273 TraceCheckUtils]: 47: Hoare triple {47782#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {47783#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:47,182 INFO L273 TraceCheckUtils]: 48: Hoare triple {47783#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47783#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:47,183 INFO L273 TraceCheckUtils]: 49: Hoare triple {47783#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47783#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:47,183 INFO L273 TraceCheckUtils]: 50: Hoare triple {47783#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {47784#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:47,184 INFO L273 TraceCheckUtils]: 51: Hoare triple {47784#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47784#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:47,184 INFO L273 TraceCheckUtils]: 52: Hoare triple {47784#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47784#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:47,185 INFO L273 TraceCheckUtils]: 53: Hoare triple {47784#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {47785#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:47,185 INFO L273 TraceCheckUtils]: 54: Hoare triple {47785#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47785#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:47,186 INFO L273 TraceCheckUtils]: 55: Hoare triple {47785#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47785#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:47,187 INFO L273 TraceCheckUtils]: 56: Hoare triple {47785#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {47786#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:47,187 INFO L273 TraceCheckUtils]: 57: Hoare triple {47786#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47786#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:47,188 INFO L273 TraceCheckUtils]: 58: Hoare triple {47786#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47786#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:47,188 INFO L273 TraceCheckUtils]: 59: Hoare triple {47786#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {47787#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:47,189 INFO L273 TraceCheckUtils]: 60: Hoare triple {47787#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47787#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:47,189 INFO L273 TraceCheckUtils]: 61: Hoare triple {47787#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47787#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:47,190 INFO L273 TraceCheckUtils]: 62: Hoare triple {47787#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {47788#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:47,190 INFO L273 TraceCheckUtils]: 63: Hoare triple {47788#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47788#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:47,191 INFO L273 TraceCheckUtils]: 64: Hoare triple {47788#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47788#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:47,191 INFO L273 TraceCheckUtils]: 65: Hoare triple {47788#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {47789#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:47,192 INFO L273 TraceCheckUtils]: 66: Hoare triple {47789#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47789#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:47,192 INFO L273 TraceCheckUtils]: 67: Hoare triple {47789#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47789#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:47,193 INFO L273 TraceCheckUtils]: 68: Hoare triple {47789#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {47790#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:47,194 INFO L273 TraceCheckUtils]: 69: Hoare triple {47790#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47790#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:47,194 INFO L273 TraceCheckUtils]: 70: Hoare triple {47790#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47790#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:47,195 INFO L273 TraceCheckUtils]: 71: Hoare triple {47790#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {47791#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:47,195 INFO L273 TraceCheckUtils]: 72: Hoare triple {47791#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47791#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:47,196 INFO L273 TraceCheckUtils]: 73: Hoare triple {47791#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47791#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:47,196 INFO L273 TraceCheckUtils]: 74: Hoare triple {47791#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {47792#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:47,197 INFO L273 TraceCheckUtils]: 75: Hoare triple {47792#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47792#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:47,197 INFO L273 TraceCheckUtils]: 76: Hoare triple {47792#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47792#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:47,198 INFO L273 TraceCheckUtils]: 77: Hoare triple {47792#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {47793#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:47,198 INFO L273 TraceCheckUtils]: 78: Hoare triple {47793#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47793#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:47,199 INFO L273 TraceCheckUtils]: 79: Hoare triple {47793#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47793#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:47,199 INFO L273 TraceCheckUtils]: 80: Hoare triple {47793#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {47794#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:47,200 INFO L273 TraceCheckUtils]: 81: Hoare triple {47794#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47794#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:47,200 INFO L273 TraceCheckUtils]: 82: Hoare triple {47794#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47794#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:47,201 INFO L273 TraceCheckUtils]: 83: Hoare triple {47794#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {47795#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:47,201 INFO L273 TraceCheckUtils]: 84: Hoare triple {47795#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47795#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:47,202 INFO L273 TraceCheckUtils]: 85: Hoare triple {47795#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47795#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:47,203 INFO L273 TraceCheckUtils]: 86: Hoare triple {47795#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {47796#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:47,203 INFO L273 TraceCheckUtils]: 87: Hoare triple {47796#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47796#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:47,204 INFO L273 TraceCheckUtils]: 88: Hoare triple {47796#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47796#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:47,204 INFO L273 TraceCheckUtils]: 89: Hoare triple {47796#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {47797#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:47,205 INFO L273 TraceCheckUtils]: 90: Hoare triple {47797#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47797#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:47,205 INFO L273 TraceCheckUtils]: 91: Hoare triple {47797#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47797#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:47,206 INFO L273 TraceCheckUtils]: 92: Hoare triple {47797#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {47798#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:47,206 INFO L273 TraceCheckUtils]: 93: Hoare triple {47798#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47798#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:47,207 INFO L273 TraceCheckUtils]: 94: Hoare triple {47798#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47798#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:47,207 INFO L273 TraceCheckUtils]: 95: Hoare triple {47798#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {47799#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:47,208 INFO L273 TraceCheckUtils]: 96: Hoare triple {47799#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47799#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:47,208 INFO L273 TraceCheckUtils]: 97: Hoare triple {47799#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47799#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:47,209 INFO L273 TraceCheckUtils]: 98: Hoare triple {47799#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {47800#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:47,209 INFO L273 TraceCheckUtils]: 99: Hoare triple {47800#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47800#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:47,210 INFO L273 TraceCheckUtils]: 100: Hoare triple {47800#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47800#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:47,211 INFO L273 TraceCheckUtils]: 101: Hoare triple {47800#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {47801#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:47,211 INFO L273 TraceCheckUtils]: 102: Hoare triple {47801#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47801#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:47,211 INFO L273 TraceCheckUtils]: 103: Hoare triple {47801#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47801#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:47,212 INFO L273 TraceCheckUtils]: 104: Hoare triple {47801#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {47802#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:47,213 INFO L273 TraceCheckUtils]: 105: Hoare triple {47802#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47802#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:47,213 INFO L273 TraceCheckUtils]: 106: Hoare triple {47802#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47802#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:47,214 INFO L273 TraceCheckUtils]: 107: Hoare triple {47802#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {47803#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:47,214 INFO L273 TraceCheckUtils]: 108: Hoare triple {47803#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47803#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:47,215 INFO L273 TraceCheckUtils]: 109: Hoare triple {47803#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47803#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:47,215 INFO L273 TraceCheckUtils]: 110: Hoare triple {47803#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {47804#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:47,216 INFO L273 TraceCheckUtils]: 111: Hoare triple {47804#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47804#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:47,216 INFO L273 TraceCheckUtils]: 112: Hoare triple {47804#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47804#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:47,217 INFO L273 TraceCheckUtils]: 113: Hoare triple {47804#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {47805#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:47,218 INFO L273 TraceCheckUtils]: 114: Hoare triple {47805#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47805#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:47,218 INFO L273 TraceCheckUtils]: 115: Hoare triple {47805#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47805#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:47,219 INFO L273 TraceCheckUtils]: 116: Hoare triple {47805#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {47806#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:47,219 INFO L273 TraceCheckUtils]: 117: Hoare triple {47806#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47806#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:47,220 INFO L273 TraceCheckUtils]: 118: Hoare triple {47806#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47806#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:47,220 INFO L273 TraceCheckUtils]: 119: Hoare triple {47806#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {47807#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:47,221 INFO L273 TraceCheckUtils]: 120: Hoare triple {47807#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47807#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:47,221 INFO L273 TraceCheckUtils]: 121: Hoare triple {47807#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47807#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:47,222 INFO L273 TraceCheckUtils]: 122: Hoare triple {47807#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {47808#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:47,222 INFO L273 TraceCheckUtils]: 123: Hoare triple {47808#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47808#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:47,223 INFO L273 TraceCheckUtils]: 124: Hoare triple {47808#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47808#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:47,224 INFO L273 TraceCheckUtils]: 125: Hoare triple {47808#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {47809#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:47,224 INFO L273 TraceCheckUtils]: 126: Hoare triple {47809#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47809#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:47,225 INFO L273 TraceCheckUtils]: 127: Hoare triple {47809#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47809#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:47,225 INFO L273 TraceCheckUtils]: 128: Hoare triple {47809#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {47810#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:47,226 INFO L273 TraceCheckUtils]: 129: Hoare triple {47810#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47810#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:47,226 INFO L273 TraceCheckUtils]: 130: Hoare triple {47810#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47810#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:47,227 INFO L273 TraceCheckUtils]: 131: Hoare triple {47810#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {47811#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:47,227 INFO L273 TraceCheckUtils]: 132: Hoare triple {47811#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47811#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:47,228 INFO L273 TraceCheckUtils]: 133: Hoare triple {47811#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47811#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:47,229 INFO L273 TraceCheckUtils]: 134: Hoare triple {47811#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {47812#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:47,229 INFO L273 TraceCheckUtils]: 135: Hoare triple {47812#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47812#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:47,229 INFO L273 TraceCheckUtils]: 136: Hoare triple {47812#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47812#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:47,230 INFO L273 TraceCheckUtils]: 137: Hoare triple {47812#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {47813#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:47,231 INFO L273 TraceCheckUtils]: 138: Hoare triple {47813#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47813#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:47,231 INFO L273 TraceCheckUtils]: 139: Hoare triple {47813#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47813#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:47,232 INFO L273 TraceCheckUtils]: 140: Hoare triple {47813#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {47814#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:47,232 INFO L273 TraceCheckUtils]: 141: Hoare triple {47814#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47814#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:47,233 INFO L273 TraceCheckUtils]: 142: Hoare triple {47814#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47814#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:47,234 INFO L273 TraceCheckUtils]: 143: Hoare triple {47814#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {47815#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:47,234 INFO L273 TraceCheckUtils]: 144: Hoare triple {47815#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47815#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:47,234 INFO L273 TraceCheckUtils]: 145: Hoare triple {47815#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47815#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:47,235 INFO L273 TraceCheckUtils]: 146: Hoare triple {47815#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {47816#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:47,236 INFO L273 TraceCheckUtils]: 147: Hoare triple {47816#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47816#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:47,236 INFO L273 TraceCheckUtils]: 148: Hoare triple {47816#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47816#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:47,237 INFO L273 TraceCheckUtils]: 149: Hoare triple {47816#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {47817#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:47,237 INFO L273 TraceCheckUtils]: 150: Hoare triple {47817#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47817#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:47,238 INFO L273 TraceCheckUtils]: 151: Hoare triple {47817#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47817#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:47,239 INFO L273 TraceCheckUtils]: 152: Hoare triple {47817#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {47818#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:47,239 INFO L273 TraceCheckUtils]: 153: Hoare triple {47818#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47818#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:47,240 INFO L273 TraceCheckUtils]: 154: Hoare triple {47818#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47818#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:47,240 INFO L273 TraceCheckUtils]: 155: Hoare triple {47818#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {47819#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:47,241 INFO L273 TraceCheckUtils]: 156: Hoare triple {47819#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47819#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:47,241 INFO L273 TraceCheckUtils]: 157: Hoare triple {47819#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47819#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:47,242 INFO L273 TraceCheckUtils]: 158: Hoare triple {47819#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {47820#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:47,243 INFO L273 TraceCheckUtils]: 159: Hoare triple {47820#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47820#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:47,243 INFO L273 TraceCheckUtils]: 160: Hoare triple {47820#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47820#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:47,244 INFO L273 TraceCheckUtils]: 161: Hoare triple {47820#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {47821#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:47,244 INFO L273 TraceCheckUtils]: 162: Hoare triple {47821#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47821#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:47,245 INFO L273 TraceCheckUtils]: 163: Hoare triple {47821#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47821#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:47,245 INFO L273 TraceCheckUtils]: 164: Hoare triple {47821#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {47822#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:47,246 INFO L273 TraceCheckUtils]: 165: Hoare triple {47822#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47822#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:47,246 INFO L273 TraceCheckUtils]: 166: Hoare triple {47822#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47822#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:47,247 INFO L273 TraceCheckUtils]: 167: Hoare triple {47822#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {47823#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:47,248 INFO L273 TraceCheckUtils]: 168: Hoare triple {47823#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47823#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:47,248 INFO L273 TraceCheckUtils]: 169: Hoare triple {47823#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47823#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:47,249 INFO L273 TraceCheckUtils]: 170: Hoare triple {47823#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {47824#(<= main_~i~0 55)} is VALID [2018-11-23 11:57:47,249 INFO L273 TraceCheckUtils]: 171: Hoare triple {47824#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47824#(<= main_~i~0 55)} is VALID [2018-11-23 11:57:47,250 INFO L273 TraceCheckUtils]: 172: Hoare triple {47824#(<= main_~i~0 55)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47824#(<= main_~i~0 55)} is VALID [2018-11-23 11:57:47,250 INFO L273 TraceCheckUtils]: 173: Hoare triple {47824#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {47825#(<= main_~i~0 56)} is VALID [2018-11-23 11:57:47,251 INFO L273 TraceCheckUtils]: 174: Hoare triple {47825#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47825#(<= main_~i~0 56)} is VALID [2018-11-23 11:57:47,251 INFO L273 TraceCheckUtils]: 175: Hoare triple {47825#(<= main_~i~0 56)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {47825#(<= main_~i~0 56)} is VALID [2018-11-23 11:57:47,252 INFO L273 TraceCheckUtils]: 176: Hoare triple {47825#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {47826#(<= main_~i~0 57)} is VALID [2018-11-23 11:57:47,253 INFO L273 TraceCheckUtils]: 177: Hoare triple {47826#(<= main_~i~0 57)} assume !(~i~0 < 100000); {47768#false} is VALID [2018-11-23 11:57:47,253 INFO L273 TraceCheckUtils]: 178: Hoare triple {47768#false} havoc ~x~0;~x~0 := 0; {47768#false} is VALID [2018-11-23 11:57:47,253 INFO L273 TraceCheckUtils]: 179: Hoare triple {47768#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {47768#false} is VALID [2018-11-23 11:57:47,253 INFO L256 TraceCheckUtils]: 180: Hoare triple {47768#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {47768#false} is VALID [2018-11-23 11:57:47,253 INFO L273 TraceCheckUtils]: 181: Hoare triple {47768#false} ~cond := #in~cond; {47768#false} is VALID [2018-11-23 11:57:47,253 INFO L273 TraceCheckUtils]: 182: Hoare triple {47768#false} assume 0 == ~cond; {47768#false} is VALID [2018-11-23 11:57:47,254 INFO L273 TraceCheckUtils]: 183: Hoare triple {47768#false} assume !false; {47768#false} is VALID [2018-11-23 11:57:47,276 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 0 proven. 4845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:47,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:47,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 61 [2018-11-23 11:57:47,297 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 184 [2018-11-23 11:57:47,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:47,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 61 states. [2018-11-23 11:57:47,475 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:47,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-11-23 11:57:47,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-11-23 11:57:47,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-23 11:57:47,476 INFO L87 Difference]: Start difference. First operand 189 states and 247 transitions. Second operand 61 states. [2018-11-23 11:57:48,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:48,751 INFO L93 Difference]: Finished difference Result 205 states and 266 transitions. [2018-11-23 11:57:48,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-11-23 11:57:48,751 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 184 [2018-11-23 11:57:48,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:48,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 11:57:48,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 266 transitions. [2018-11-23 11:57:48,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 11:57:48,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 266 transitions. [2018-11-23 11:57:48,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states and 266 transitions. [2018-11-23 11:57:49,042 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 266 edges. 266 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:49,046 INFO L225 Difference]: With dead ends: 205 [2018-11-23 11:57:49,046 INFO L226 Difference]: Without dead ends: 194 [2018-11-23 11:57:49,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-23 11:57:49,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-23 11:57:49,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2018-11-23 11:57:49,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:49,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand 192 states. [2018-11-23 11:57:49,099 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 192 states. [2018-11-23 11:57:49,099 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 192 states. [2018-11-23 11:57:49,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:49,102 INFO L93 Difference]: Finished difference Result 194 states and 254 transitions. [2018-11-23 11:57:49,102 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 254 transitions. [2018-11-23 11:57:49,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:49,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:49,103 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand 194 states. [2018-11-23 11:57:49,103 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 194 states. [2018-11-23 11:57:49,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:49,105 INFO L93 Difference]: Finished difference Result 194 states and 254 transitions. [2018-11-23 11:57:49,105 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 254 transitions. [2018-11-23 11:57:49,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:49,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:49,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:49,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:49,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-11-23 11:57:49,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 251 transitions. [2018-11-23 11:57:49,108 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 251 transitions. Word has length 184 [2018-11-23 11:57:49,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:49,109 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 251 transitions. [2018-11-23 11:57:49,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-11-23 11:57:49,109 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 251 transitions. [2018-11-23 11:57:49,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-23 11:57:49,109 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:49,110 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:49,110 INFO L423 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:49,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:49,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1184177529, now seen corresponding path program 58 times [2018-11-23 11:57:49,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:49,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:49,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:49,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:49,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:50,703 INFO L256 TraceCheckUtils]: 0: Hoare triple {49299#true} call ULTIMATE.init(); {49299#true} is VALID [2018-11-23 11:57:50,703 INFO L273 TraceCheckUtils]: 1: Hoare triple {49299#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {49299#true} is VALID [2018-11-23 11:57:50,704 INFO L273 TraceCheckUtils]: 2: Hoare triple {49299#true} assume true; {49299#true} is VALID [2018-11-23 11:57:50,704 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {49299#true} {49299#true} #55#return; {49299#true} is VALID [2018-11-23 11:57:50,704 INFO L256 TraceCheckUtils]: 4: Hoare triple {49299#true} call #t~ret4 := main(); {49299#true} is VALID [2018-11-23 11:57:50,704 INFO L273 TraceCheckUtils]: 5: Hoare triple {49299#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {49301#(= main_~i~0 0)} is VALID [2018-11-23 11:57:50,705 INFO L273 TraceCheckUtils]: 6: Hoare triple {49301#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49301#(= main_~i~0 0)} is VALID [2018-11-23 11:57:50,705 INFO L273 TraceCheckUtils]: 7: Hoare triple {49301#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49301#(= main_~i~0 0)} is VALID [2018-11-23 11:57:50,706 INFO L273 TraceCheckUtils]: 8: Hoare triple {49301#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {49302#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:50,707 INFO L273 TraceCheckUtils]: 9: Hoare triple {49302#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49302#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:50,707 INFO L273 TraceCheckUtils]: 10: Hoare triple {49302#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49302#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:50,708 INFO L273 TraceCheckUtils]: 11: Hoare triple {49302#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {49303#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:50,709 INFO L273 TraceCheckUtils]: 12: Hoare triple {49303#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49303#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:50,709 INFO L273 TraceCheckUtils]: 13: Hoare triple {49303#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49303#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:50,710 INFO L273 TraceCheckUtils]: 14: Hoare triple {49303#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {49304#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:50,710 INFO L273 TraceCheckUtils]: 15: Hoare triple {49304#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49304#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:50,711 INFO L273 TraceCheckUtils]: 16: Hoare triple {49304#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49304#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:50,711 INFO L273 TraceCheckUtils]: 17: Hoare triple {49304#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {49305#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:50,712 INFO L273 TraceCheckUtils]: 18: Hoare triple {49305#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49305#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:50,712 INFO L273 TraceCheckUtils]: 19: Hoare triple {49305#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49305#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:50,713 INFO L273 TraceCheckUtils]: 20: Hoare triple {49305#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {49306#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:50,714 INFO L273 TraceCheckUtils]: 21: Hoare triple {49306#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49306#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:50,714 INFO L273 TraceCheckUtils]: 22: Hoare triple {49306#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49306#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:50,715 INFO L273 TraceCheckUtils]: 23: Hoare triple {49306#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {49307#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:50,715 INFO L273 TraceCheckUtils]: 24: Hoare triple {49307#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49307#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:50,716 INFO L273 TraceCheckUtils]: 25: Hoare triple {49307#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49307#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:50,717 INFO L273 TraceCheckUtils]: 26: Hoare triple {49307#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {49308#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:50,717 INFO L273 TraceCheckUtils]: 27: Hoare triple {49308#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49308#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:50,718 INFO L273 TraceCheckUtils]: 28: Hoare triple {49308#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49308#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:50,718 INFO L273 TraceCheckUtils]: 29: Hoare triple {49308#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {49309#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:50,719 INFO L273 TraceCheckUtils]: 30: Hoare triple {49309#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49309#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:50,719 INFO L273 TraceCheckUtils]: 31: Hoare triple {49309#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49309#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:50,720 INFO L273 TraceCheckUtils]: 32: Hoare triple {49309#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {49310#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:50,720 INFO L273 TraceCheckUtils]: 33: Hoare triple {49310#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49310#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:50,721 INFO L273 TraceCheckUtils]: 34: Hoare triple {49310#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49310#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:50,722 INFO L273 TraceCheckUtils]: 35: Hoare triple {49310#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {49311#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:50,722 INFO L273 TraceCheckUtils]: 36: Hoare triple {49311#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49311#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:50,723 INFO L273 TraceCheckUtils]: 37: Hoare triple {49311#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49311#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:50,723 INFO L273 TraceCheckUtils]: 38: Hoare triple {49311#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {49312#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:50,724 INFO L273 TraceCheckUtils]: 39: Hoare triple {49312#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49312#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:50,724 INFO L273 TraceCheckUtils]: 40: Hoare triple {49312#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49312#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:50,725 INFO L273 TraceCheckUtils]: 41: Hoare triple {49312#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {49313#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:50,726 INFO L273 TraceCheckUtils]: 42: Hoare triple {49313#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49313#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:50,726 INFO L273 TraceCheckUtils]: 43: Hoare triple {49313#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49313#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:50,727 INFO L273 TraceCheckUtils]: 44: Hoare triple {49313#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {49314#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:50,727 INFO L273 TraceCheckUtils]: 45: Hoare triple {49314#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49314#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:50,728 INFO L273 TraceCheckUtils]: 46: Hoare triple {49314#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49314#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:50,729 INFO L273 TraceCheckUtils]: 47: Hoare triple {49314#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {49315#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:50,729 INFO L273 TraceCheckUtils]: 48: Hoare triple {49315#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49315#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:50,730 INFO L273 TraceCheckUtils]: 49: Hoare triple {49315#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49315#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:50,730 INFO L273 TraceCheckUtils]: 50: Hoare triple {49315#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {49316#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:50,731 INFO L273 TraceCheckUtils]: 51: Hoare triple {49316#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49316#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:50,731 INFO L273 TraceCheckUtils]: 52: Hoare triple {49316#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49316#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:50,732 INFO L273 TraceCheckUtils]: 53: Hoare triple {49316#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {49317#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:50,733 INFO L273 TraceCheckUtils]: 54: Hoare triple {49317#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49317#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:50,733 INFO L273 TraceCheckUtils]: 55: Hoare triple {49317#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49317#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:50,734 INFO L273 TraceCheckUtils]: 56: Hoare triple {49317#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {49318#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:50,734 INFO L273 TraceCheckUtils]: 57: Hoare triple {49318#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49318#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:50,735 INFO L273 TraceCheckUtils]: 58: Hoare triple {49318#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49318#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:50,736 INFO L273 TraceCheckUtils]: 59: Hoare triple {49318#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {49319#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:50,736 INFO L273 TraceCheckUtils]: 60: Hoare triple {49319#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49319#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:50,737 INFO L273 TraceCheckUtils]: 61: Hoare triple {49319#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49319#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:50,737 INFO L273 TraceCheckUtils]: 62: Hoare triple {49319#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {49320#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:50,738 INFO L273 TraceCheckUtils]: 63: Hoare triple {49320#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49320#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:50,738 INFO L273 TraceCheckUtils]: 64: Hoare triple {49320#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49320#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:50,739 INFO L273 TraceCheckUtils]: 65: Hoare triple {49320#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {49321#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:50,740 INFO L273 TraceCheckUtils]: 66: Hoare triple {49321#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49321#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:50,740 INFO L273 TraceCheckUtils]: 67: Hoare triple {49321#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49321#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:50,741 INFO L273 TraceCheckUtils]: 68: Hoare triple {49321#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {49322#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:50,741 INFO L273 TraceCheckUtils]: 69: Hoare triple {49322#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49322#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:50,742 INFO L273 TraceCheckUtils]: 70: Hoare triple {49322#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49322#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:50,742 INFO L273 TraceCheckUtils]: 71: Hoare triple {49322#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {49323#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:50,743 INFO L273 TraceCheckUtils]: 72: Hoare triple {49323#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49323#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:50,743 INFO L273 TraceCheckUtils]: 73: Hoare triple {49323#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49323#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:50,744 INFO L273 TraceCheckUtils]: 74: Hoare triple {49323#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {49324#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:50,745 INFO L273 TraceCheckUtils]: 75: Hoare triple {49324#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49324#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:50,745 INFO L273 TraceCheckUtils]: 76: Hoare triple {49324#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49324#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:50,746 INFO L273 TraceCheckUtils]: 77: Hoare triple {49324#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {49325#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:50,746 INFO L273 TraceCheckUtils]: 78: Hoare triple {49325#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49325#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:50,747 INFO L273 TraceCheckUtils]: 79: Hoare triple {49325#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49325#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:50,748 INFO L273 TraceCheckUtils]: 80: Hoare triple {49325#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {49326#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:50,748 INFO L273 TraceCheckUtils]: 81: Hoare triple {49326#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49326#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:50,749 INFO L273 TraceCheckUtils]: 82: Hoare triple {49326#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49326#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:50,749 INFO L273 TraceCheckUtils]: 83: Hoare triple {49326#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {49327#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:50,750 INFO L273 TraceCheckUtils]: 84: Hoare triple {49327#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49327#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:50,750 INFO L273 TraceCheckUtils]: 85: Hoare triple {49327#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49327#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:50,751 INFO L273 TraceCheckUtils]: 86: Hoare triple {49327#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {49328#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:50,751 INFO L273 TraceCheckUtils]: 87: Hoare triple {49328#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49328#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:50,752 INFO L273 TraceCheckUtils]: 88: Hoare triple {49328#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49328#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:50,753 INFO L273 TraceCheckUtils]: 89: Hoare triple {49328#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {49329#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:50,753 INFO L273 TraceCheckUtils]: 90: Hoare triple {49329#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49329#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:50,754 INFO L273 TraceCheckUtils]: 91: Hoare triple {49329#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49329#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:50,754 INFO L273 TraceCheckUtils]: 92: Hoare triple {49329#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {49330#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:50,755 INFO L273 TraceCheckUtils]: 93: Hoare triple {49330#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49330#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:50,755 INFO L273 TraceCheckUtils]: 94: Hoare triple {49330#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49330#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:50,756 INFO L273 TraceCheckUtils]: 95: Hoare triple {49330#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {49331#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:50,757 INFO L273 TraceCheckUtils]: 96: Hoare triple {49331#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49331#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:50,757 INFO L273 TraceCheckUtils]: 97: Hoare triple {49331#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49331#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:50,758 INFO L273 TraceCheckUtils]: 98: Hoare triple {49331#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {49332#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:50,758 INFO L273 TraceCheckUtils]: 99: Hoare triple {49332#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49332#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:50,759 INFO L273 TraceCheckUtils]: 100: Hoare triple {49332#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49332#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:50,759 INFO L273 TraceCheckUtils]: 101: Hoare triple {49332#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {49333#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:50,760 INFO L273 TraceCheckUtils]: 102: Hoare triple {49333#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49333#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:50,760 INFO L273 TraceCheckUtils]: 103: Hoare triple {49333#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49333#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:50,761 INFO L273 TraceCheckUtils]: 104: Hoare triple {49333#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {49334#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:50,762 INFO L273 TraceCheckUtils]: 105: Hoare triple {49334#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49334#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:50,762 INFO L273 TraceCheckUtils]: 106: Hoare triple {49334#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49334#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:50,763 INFO L273 TraceCheckUtils]: 107: Hoare triple {49334#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {49335#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:50,763 INFO L273 TraceCheckUtils]: 108: Hoare triple {49335#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49335#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:50,764 INFO L273 TraceCheckUtils]: 109: Hoare triple {49335#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49335#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:50,765 INFO L273 TraceCheckUtils]: 110: Hoare triple {49335#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {49336#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:50,765 INFO L273 TraceCheckUtils]: 111: Hoare triple {49336#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49336#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:50,766 INFO L273 TraceCheckUtils]: 112: Hoare triple {49336#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49336#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:50,766 INFO L273 TraceCheckUtils]: 113: Hoare triple {49336#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {49337#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:50,767 INFO L273 TraceCheckUtils]: 114: Hoare triple {49337#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49337#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:50,767 INFO L273 TraceCheckUtils]: 115: Hoare triple {49337#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49337#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:50,768 INFO L273 TraceCheckUtils]: 116: Hoare triple {49337#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {49338#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:50,768 INFO L273 TraceCheckUtils]: 117: Hoare triple {49338#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49338#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:50,769 INFO L273 TraceCheckUtils]: 118: Hoare triple {49338#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49338#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:50,770 INFO L273 TraceCheckUtils]: 119: Hoare triple {49338#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {49339#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:50,770 INFO L273 TraceCheckUtils]: 120: Hoare triple {49339#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49339#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:50,771 INFO L273 TraceCheckUtils]: 121: Hoare triple {49339#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49339#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:50,771 INFO L273 TraceCheckUtils]: 122: Hoare triple {49339#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {49340#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:50,772 INFO L273 TraceCheckUtils]: 123: Hoare triple {49340#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49340#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:50,772 INFO L273 TraceCheckUtils]: 124: Hoare triple {49340#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49340#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:50,773 INFO L273 TraceCheckUtils]: 125: Hoare triple {49340#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {49341#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:50,773 INFO L273 TraceCheckUtils]: 126: Hoare triple {49341#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49341#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:50,774 INFO L273 TraceCheckUtils]: 127: Hoare triple {49341#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49341#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:50,775 INFO L273 TraceCheckUtils]: 128: Hoare triple {49341#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {49342#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:50,775 INFO L273 TraceCheckUtils]: 129: Hoare triple {49342#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49342#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:50,776 INFO L273 TraceCheckUtils]: 130: Hoare triple {49342#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49342#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:50,776 INFO L273 TraceCheckUtils]: 131: Hoare triple {49342#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {49343#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:50,777 INFO L273 TraceCheckUtils]: 132: Hoare triple {49343#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49343#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:50,777 INFO L273 TraceCheckUtils]: 133: Hoare triple {49343#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49343#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:50,778 INFO L273 TraceCheckUtils]: 134: Hoare triple {49343#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {49344#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:50,778 INFO L273 TraceCheckUtils]: 135: Hoare triple {49344#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49344#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:50,779 INFO L273 TraceCheckUtils]: 136: Hoare triple {49344#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49344#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:50,780 INFO L273 TraceCheckUtils]: 137: Hoare triple {49344#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {49345#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:50,780 INFO L273 TraceCheckUtils]: 138: Hoare triple {49345#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49345#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:50,780 INFO L273 TraceCheckUtils]: 139: Hoare triple {49345#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49345#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:50,781 INFO L273 TraceCheckUtils]: 140: Hoare triple {49345#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {49346#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:50,782 INFO L273 TraceCheckUtils]: 141: Hoare triple {49346#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49346#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:50,782 INFO L273 TraceCheckUtils]: 142: Hoare triple {49346#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49346#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:50,783 INFO L273 TraceCheckUtils]: 143: Hoare triple {49346#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {49347#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:50,783 INFO L273 TraceCheckUtils]: 144: Hoare triple {49347#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49347#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:50,784 INFO L273 TraceCheckUtils]: 145: Hoare triple {49347#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49347#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:50,784 INFO L273 TraceCheckUtils]: 146: Hoare triple {49347#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {49348#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:50,785 INFO L273 TraceCheckUtils]: 147: Hoare triple {49348#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49348#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:50,785 INFO L273 TraceCheckUtils]: 148: Hoare triple {49348#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49348#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:50,786 INFO L273 TraceCheckUtils]: 149: Hoare triple {49348#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {49349#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:50,786 INFO L273 TraceCheckUtils]: 150: Hoare triple {49349#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49349#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:50,787 INFO L273 TraceCheckUtils]: 151: Hoare triple {49349#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49349#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:50,788 INFO L273 TraceCheckUtils]: 152: Hoare triple {49349#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {49350#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:50,788 INFO L273 TraceCheckUtils]: 153: Hoare triple {49350#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49350#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:50,788 INFO L273 TraceCheckUtils]: 154: Hoare triple {49350#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49350#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:50,789 INFO L273 TraceCheckUtils]: 155: Hoare triple {49350#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {49351#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:50,790 INFO L273 TraceCheckUtils]: 156: Hoare triple {49351#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49351#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:50,790 INFO L273 TraceCheckUtils]: 157: Hoare triple {49351#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49351#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:50,791 INFO L273 TraceCheckUtils]: 158: Hoare triple {49351#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {49352#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:50,791 INFO L273 TraceCheckUtils]: 159: Hoare triple {49352#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49352#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:50,792 INFO L273 TraceCheckUtils]: 160: Hoare triple {49352#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49352#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:50,792 INFO L273 TraceCheckUtils]: 161: Hoare triple {49352#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {49353#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:50,793 INFO L273 TraceCheckUtils]: 162: Hoare triple {49353#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49353#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:50,793 INFO L273 TraceCheckUtils]: 163: Hoare triple {49353#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49353#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:50,794 INFO L273 TraceCheckUtils]: 164: Hoare triple {49353#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {49354#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:50,794 INFO L273 TraceCheckUtils]: 165: Hoare triple {49354#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49354#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:50,795 INFO L273 TraceCheckUtils]: 166: Hoare triple {49354#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49354#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:50,796 INFO L273 TraceCheckUtils]: 167: Hoare triple {49354#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {49355#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:50,796 INFO L273 TraceCheckUtils]: 168: Hoare triple {49355#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49355#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:50,796 INFO L273 TraceCheckUtils]: 169: Hoare triple {49355#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49355#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:50,797 INFO L273 TraceCheckUtils]: 170: Hoare triple {49355#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {49356#(<= main_~i~0 55)} is VALID [2018-11-23 11:57:50,798 INFO L273 TraceCheckUtils]: 171: Hoare triple {49356#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49356#(<= main_~i~0 55)} is VALID [2018-11-23 11:57:50,798 INFO L273 TraceCheckUtils]: 172: Hoare triple {49356#(<= main_~i~0 55)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49356#(<= main_~i~0 55)} is VALID [2018-11-23 11:57:50,799 INFO L273 TraceCheckUtils]: 173: Hoare triple {49356#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {49357#(<= main_~i~0 56)} is VALID [2018-11-23 11:57:50,799 INFO L273 TraceCheckUtils]: 174: Hoare triple {49357#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49357#(<= main_~i~0 56)} is VALID [2018-11-23 11:57:50,800 INFO L273 TraceCheckUtils]: 175: Hoare triple {49357#(<= main_~i~0 56)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49357#(<= main_~i~0 56)} is VALID [2018-11-23 11:57:50,800 INFO L273 TraceCheckUtils]: 176: Hoare triple {49357#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {49358#(<= main_~i~0 57)} is VALID [2018-11-23 11:57:50,801 INFO L273 TraceCheckUtils]: 177: Hoare triple {49358#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49358#(<= main_~i~0 57)} is VALID [2018-11-23 11:57:50,801 INFO L273 TraceCheckUtils]: 178: Hoare triple {49358#(<= main_~i~0 57)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49358#(<= main_~i~0 57)} is VALID [2018-11-23 11:57:50,802 INFO L273 TraceCheckUtils]: 179: Hoare triple {49358#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {49359#(<= main_~i~0 58)} is VALID [2018-11-23 11:57:50,802 INFO L273 TraceCheckUtils]: 180: Hoare triple {49359#(<= main_~i~0 58)} assume !(~i~0 < 100000); {49300#false} is VALID [2018-11-23 11:57:50,803 INFO L273 TraceCheckUtils]: 181: Hoare triple {49300#false} havoc ~x~0;~x~0 := 0; {49300#false} is VALID [2018-11-23 11:57:50,803 INFO L273 TraceCheckUtils]: 182: Hoare triple {49300#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {49300#false} is VALID [2018-11-23 11:57:50,803 INFO L256 TraceCheckUtils]: 183: Hoare triple {49300#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {49300#false} is VALID [2018-11-23 11:57:50,803 INFO L273 TraceCheckUtils]: 184: Hoare triple {49300#false} ~cond := #in~cond; {49300#false} is VALID [2018-11-23 11:57:50,803 INFO L273 TraceCheckUtils]: 185: Hoare triple {49300#false} assume 0 == ~cond; {49300#false} is VALID [2018-11-23 11:57:50,804 INFO L273 TraceCheckUtils]: 186: Hoare triple {49300#false} assume !false; {49300#false} is VALID [2018-11-23 11:57:50,827 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 0 proven. 5017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:50,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:50,828 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:50,836 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:57:50,931 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:57:50,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:57:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:50,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:51,508 INFO L256 TraceCheckUtils]: 0: Hoare triple {49299#true} call ULTIMATE.init(); {49299#true} is VALID [2018-11-23 11:57:51,508 INFO L273 TraceCheckUtils]: 1: Hoare triple {49299#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {49299#true} is VALID [2018-11-23 11:57:51,509 INFO L273 TraceCheckUtils]: 2: Hoare triple {49299#true} assume true; {49299#true} is VALID [2018-11-23 11:57:51,509 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {49299#true} {49299#true} #55#return; {49299#true} is VALID [2018-11-23 11:57:51,509 INFO L256 TraceCheckUtils]: 4: Hoare triple {49299#true} call #t~ret4 := main(); {49299#true} is VALID [2018-11-23 11:57:51,510 INFO L273 TraceCheckUtils]: 5: Hoare triple {49299#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {49378#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:51,510 INFO L273 TraceCheckUtils]: 6: Hoare triple {49378#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49378#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:51,510 INFO L273 TraceCheckUtils]: 7: Hoare triple {49378#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49378#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:51,511 INFO L273 TraceCheckUtils]: 8: Hoare triple {49378#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {49302#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:51,511 INFO L273 TraceCheckUtils]: 9: Hoare triple {49302#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49302#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:51,511 INFO L273 TraceCheckUtils]: 10: Hoare triple {49302#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49302#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:51,512 INFO L273 TraceCheckUtils]: 11: Hoare triple {49302#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {49303#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:51,512 INFO L273 TraceCheckUtils]: 12: Hoare triple {49303#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49303#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:51,513 INFO L273 TraceCheckUtils]: 13: Hoare triple {49303#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49303#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:51,514 INFO L273 TraceCheckUtils]: 14: Hoare triple {49303#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {49304#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:51,514 INFO L273 TraceCheckUtils]: 15: Hoare triple {49304#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49304#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:51,515 INFO L273 TraceCheckUtils]: 16: Hoare triple {49304#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49304#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:51,515 INFO L273 TraceCheckUtils]: 17: Hoare triple {49304#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {49305#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:51,516 INFO L273 TraceCheckUtils]: 18: Hoare triple {49305#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49305#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:51,516 INFO L273 TraceCheckUtils]: 19: Hoare triple {49305#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49305#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:51,517 INFO L273 TraceCheckUtils]: 20: Hoare triple {49305#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {49306#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:51,518 INFO L273 TraceCheckUtils]: 21: Hoare triple {49306#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49306#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:51,518 INFO L273 TraceCheckUtils]: 22: Hoare triple {49306#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49306#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:51,519 INFO L273 TraceCheckUtils]: 23: Hoare triple {49306#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {49307#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:51,519 INFO L273 TraceCheckUtils]: 24: Hoare triple {49307#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49307#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:51,520 INFO L273 TraceCheckUtils]: 25: Hoare triple {49307#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49307#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:51,521 INFO L273 TraceCheckUtils]: 26: Hoare triple {49307#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {49308#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:51,521 INFO L273 TraceCheckUtils]: 27: Hoare triple {49308#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49308#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:51,522 INFO L273 TraceCheckUtils]: 28: Hoare triple {49308#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49308#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:51,522 INFO L273 TraceCheckUtils]: 29: Hoare triple {49308#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {49309#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:51,523 INFO L273 TraceCheckUtils]: 30: Hoare triple {49309#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49309#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:51,523 INFO L273 TraceCheckUtils]: 31: Hoare triple {49309#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49309#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:51,524 INFO L273 TraceCheckUtils]: 32: Hoare triple {49309#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {49310#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:51,525 INFO L273 TraceCheckUtils]: 33: Hoare triple {49310#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49310#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:51,525 INFO L273 TraceCheckUtils]: 34: Hoare triple {49310#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49310#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:51,526 INFO L273 TraceCheckUtils]: 35: Hoare triple {49310#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {49311#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:51,526 INFO L273 TraceCheckUtils]: 36: Hoare triple {49311#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49311#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:51,527 INFO L273 TraceCheckUtils]: 37: Hoare triple {49311#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49311#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:51,528 INFO L273 TraceCheckUtils]: 38: Hoare triple {49311#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {49312#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:51,528 INFO L273 TraceCheckUtils]: 39: Hoare triple {49312#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49312#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:51,529 INFO L273 TraceCheckUtils]: 40: Hoare triple {49312#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49312#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:51,529 INFO L273 TraceCheckUtils]: 41: Hoare triple {49312#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {49313#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:51,530 INFO L273 TraceCheckUtils]: 42: Hoare triple {49313#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49313#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:51,530 INFO L273 TraceCheckUtils]: 43: Hoare triple {49313#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49313#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:51,531 INFO L273 TraceCheckUtils]: 44: Hoare triple {49313#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {49314#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:51,531 INFO L273 TraceCheckUtils]: 45: Hoare triple {49314#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49314#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:51,532 INFO L273 TraceCheckUtils]: 46: Hoare triple {49314#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49314#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:51,533 INFO L273 TraceCheckUtils]: 47: Hoare triple {49314#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {49315#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:51,533 INFO L273 TraceCheckUtils]: 48: Hoare triple {49315#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49315#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:51,534 INFO L273 TraceCheckUtils]: 49: Hoare triple {49315#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49315#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:51,534 INFO L273 TraceCheckUtils]: 50: Hoare triple {49315#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {49316#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:51,535 INFO L273 TraceCheckUtils]: 51: Hoare triple {49316#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49316#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:51,535 INFO L273 TraceCheckUtils]: 52: Hoare triple {49316#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49316#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:51,536 INFO L273 TraceCheckUtils]: 53: Hoare triple {49316#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {49317#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:51,537 INFO L273 TraceCheckUtils]: 54: Hoare triple {49317#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49317#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:51,537 INFO L273 TraceCheckUtils]: 55: Hoare triple {49317#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49317#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:51,538 INFO L273 TraceCheckUtils]: 56: Hoare triple {49317#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {49318#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:51,538 INFO L273 TraceCheckUtils]: 57: Hoare triple {49318#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49318#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:51,539 INFO L273 TraceCheckUtils]: 58: Hoare triple {49318#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49318#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:51,540 INFO L273 TraceCheckUtils]: 59: Hoare triple {49318#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {49319#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:51,540 INFO L273 TraceCheckUtils]: 60: Hoare triple {49319#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49319#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:51,541 INFO L273 TraceCheckUtils]: 61: Hoare triple {49319#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49319#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:51,541 INFO L273 TraceCheckUtils]: 62: Hoare triple {49319#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {49320#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:51,542 INFO L273 TraceCheckUtils]: 63: Hoare triple {49320#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49320#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:51,542 INFO L273 TraceCheckUtils]: 64: Hoare triple {49320#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49320#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:51,543 INFO L273 TraceCheckUtils]: 65: Hoare triple {49320#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {49321#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:51,544 INFO L273 TraceCheckUtils]: 66: Hoare triple {49321#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49321#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:51,544 INFO L273 TraceCheckUtils]: 67: Hoare triple {49321#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49321#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:51,545 INFO L273 TraceCheckUtils]: 68: Hoare triple {49321#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {49322#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:51,545 INFO L273 TraceCheckUtils]: 69: Hoare triple {49322#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49322#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:51,546 INFO L273 TraceCheckUtils]: 70: Hoare triple {49322#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49322#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:51,546 INFO L273 TraceCheckUtils]: 71: Hoare triple {49322#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {49323#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:51,547 INFO L273 TraceCheckUtils]: 72: Hoare triple {49323#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49323#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:51,547 INFO L273 TraceCheckUtils]: 73: Hoare triple {49323#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49323#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:51,548 INFO L273 TraceCheckUtils]: 74: Hoare triple {49323#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {49324#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:51,549 INFO L273 TraceCheckUtils]: 75: Hoare triple {49324#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49324#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:51,549 INFO L273 TraceCheckUtils]: 76: Hoare triple {49324#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49324#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:51,550 INFO L273 TraceCheckUtils]: 77: Hoare triple {49324#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {49325#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:51,550 INFO L273 TraceCheckUtils]: 78: Hoare triple {49325#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49325#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:51,551 INFO L273 TraceCheckUtils]: 79: Hoare triple {49325#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49325#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:51,552 INFO L273 TraceCheckUtils]: 80: Hoare triple {49325#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {49326#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:51,552 INFO L273 TraceCheckUtils]: 81: Hoare triple {49326#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49326#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:51,553 INFO L273 TraceCheckUtils]: 82: Hoare triple {49326#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49326#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:51,553 INFO L273 TraceCheckUtils]: 83: Hoare triple {49326#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {49327#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:51,554 INFO L273 TraceCheckUtils]: 84: Hoare triple {49327#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49327#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:51,554 INFO L273 TraceCheckUtils]: 85: Hoare triple {49327#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49327#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:51,555 INFO L273 TraceCheckUtils]: 86: Hoare triple {49327#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {49328#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:51,555 INFO L273 TraceCheckUtils]: 87: Hoare triple {49328#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49328#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:51,556 INFO L273 TraceCheckUtils]: 88: Hoare triple {49328#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49328#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:51,557 INFO L273 TraceCheckUtils]: 89: Hoare triple {49328#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {49329#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:51,557 INFO L273 TraceCheckUtils]: 90: Hoare triple {49329#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49329#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:51,558 INFO L273 TraceCheckUtils]: 91: Hoare triple {49329#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49329#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:51,558 INFO L273 TraceCheckUtils]: 92: Hoare triple {49329#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {49330#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:51,559 INFO L273 TraceCheckUtils]: 93: Hoare triple {49330#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49330#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:51,559 INFO L273 TraceCheckUtils]: 94: Hoare triple {49330#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49330#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:51,560 INFO L273 TraceCheckUtils]: 95: Hoare triple {49330#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {49331#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:51,561 INFO L273 TraceCheckUtils]: 96: Hoare triple {49331#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49331#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:51,561 INFO L273 TraceCheckUtils]: 97: Hoare triple {49331#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49331#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:51,562 INFO L273 TraceCheckUtils]: 98: Hoare triple {49331#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {49332#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:51,562 INFO L273 TraceCheckUtils]: 99: Hoare triple {49332#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49332#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:51,563 INFO L273 TraceCheckUtils]: 100: Hoare triple {49332#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49332#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:51,563 INFO L273 TraceCheckUtils]: 101: Hoare triple {49332#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {49333#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:51,564 INFO L273 TraceCheckUtils]: 102: Hoare triple {49333#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49333#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:51,564 INFO L273 TraceCheckUtils]: 103: Hoare triple {49333#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49333#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:51,565 INFO L273 TraceCheckUtils]: 104: Hoare triple {49333#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {49334#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:51,566 INFO L273 TraceCheckUtils]: 105: Hoare triple {49334#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49334#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:51,566 INFO L273 TraceCheckUtils]: 106: Hoare triple {49334#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49334#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:51,567 INFO L273 TraceCheckUtils]: 107: Hoare triple {49334#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {49335#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:51,567 INFO L273 TraceCheckUtils]: 108: Hoare triple {49335#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49335#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:51,568 INFO L273 TraceCheckUtils]: 109: Hoare triple {49335#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49335#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:51,569 INFO L273 TraceCheckUtils]: 110: Hoare triple {49335#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {49336#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:51,569 INFO L273 TraceCheckUtils]: 111: Hoare triple {49336#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49336#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:51,570 INFO L273 TraceCheckUtils]: 112: Hoare triple {49336#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49336#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:51,570 INFO L273 TraceCheckUtils]: 113: Hoare triple {49336#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {49337#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:51,571 INFO L273 TraceCheckUtils]: 114: Hoare triple {49337#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49337#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:51,571 INFO L273 TraceCheckUtils]: 115: Hoare triple {49337#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49337#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:51,572 INFO L273 TraceCheckUtils]: 116: Hoare triple {49337#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {49338#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:51,572 INFO L273 TraceCheckUtils]: 117: Hoare triple {49338#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49338#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:51,573 INFO L273 TraceCheckUtils]: 118: Hoare triple {49338#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49338#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:51,574 INFO L273 TraceCheckUtils]: 119: Hoare triple {49338#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {49339#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:51,574 INFO L273 TraceCheckUtils]: 120: Hoare triple {49339#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49339#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:51,575 INFO L273 TraceCheckUtils]: 121: Hoare triple {49339#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49339#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:51,575 INFO L273 TraceCheckUtils]: 122: Hoare triple {49339#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {49340#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:51,576 INFO L273 TraceCheckUtils]: 123: Hoare triple {49340#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49340#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:51,576 INFO L273 TraceCheckUtils]: 124: Hoare triple {49340#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49340#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:51,577 INFO L273 TraceCheckUtils]: 125: Hoare triple {49340#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {49341#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:51,578 INFO L273 TraceCheckUtils]: 126: Hoare triple {49341#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49341#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:51,578 INFO L273 TraceCheckUtils]: 127: Hoare triple {49341#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49341#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:51,579 INFO L273 TraceCheckUtils]: 128: Hoare triple {49341#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {49342#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:51,579 INFO L273 TraceCheckUtils]: 129: Hoare triple {49342#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49342#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:51,580 INFO L273 TraceCheckUtils]: 130: Hoare triple {49342#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49342#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:51,580 INFO L273 TraceCheckUtils]: 131: Hoare triple {49342#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {49343#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:51,581 INFO L273 TraceCheckUtils]: 132: Hoare triple {49343#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49343#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:51,581 INFO L273 TraceCheckUtils]: 133: Hoare triple {49343#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49343#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:51,582 INFO L273 TraceCheckUtils]: 134: Hoare triple {49343#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {49344#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:51,583 INFO L273 TraceCheckUtils]: 135: Hoare triple {49344#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49344#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:51,583 INFO L273 TraceCheckUtils]: 136: Hoare triple {49344#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49344#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:51,584 INFO L273 TraceCheckUtils]: 137: Hoare triple {49344#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {49345#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:51,584 INFO L273 TraceCheckUtils]: 138: Hoare triple {49345#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49345#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:51,585 INFO L273 TraceCheckUtils]: 139: Hoare triple {49345#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49345#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:51,586 INFO L273 TraceCheckUtils]: 140: Hoare triple {49345#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {49346#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:51,586 INFO L273 TraceCheckUtils]: 141: Hoare triple {49346#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49346#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:51,587 INFO L273 TraceCheckUtils]: 142: Hoare triple {49346#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49346#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:51,587 INFO L273 TraceCheckUtils]: 143: Hoare triple {49346#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {49347#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:51,588 INFO L273 TraceCheckUtils]: 144: Hoare triple {49347#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49347#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:51,588 INFO L273 TraceCheckUtils]: 145: Hoare triple {49347#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49347#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:51,589 INFO L273 TraceCheckUtils]: 146: Hoare triple {49347#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {49348#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:51,589 INFO L273 TraceCheckUtils]: 147: Hoare triple {49348#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49348#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:51,590 INFO L273 TraceCheckUtils]: 148: Hoare triple {49348#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49348#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:51,591 INFO L273 TraceCheckUtils]: 149: Hoare triple {49348#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {49349#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:51,591 INFO L273 TraceCheckUtils]: 150: Hoare triple {49349#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49349#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:51,592 INFO L273 TraceCheckUtils]: 151: Hoare triple {49349#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49349#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:51,592 INFO L273 TraceCheckUtils]: 152: Hoare triple {49349#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {49350#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:51,593 INFO L273 TraceCheckUtils]: 153: Hoare triple {49350#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49350#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:51,593 INFO L273 TraceCheckUtils]: 154: Hoare triple {49350#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49350#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:51,594 INFO L273 TraceCheckUtils]: 155: Hoare triple {49350#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {49351#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:51,595 INFO L273 TraceCheckUtils]: 156: Hoare triple {49351#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49351#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:51,595 INFO L273 TraceCheckUtils]: 157: Hoare triple {49351#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49351#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:51,596 INFO L273 TraceCheckUtils]: 158: Hoare triple {49351#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {49352#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:51,596 INFO L273 TraceCheckUtils]: 159: Hoare triple {49352#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49352#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:51,597 INFO L273 TraceCheckUtils]: 160: Hoare triple {49352#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49352#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:51,597 INFO L273 TraceCheckUtils]: 161: Hoare triple {49352#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {49353#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:51,598 INFO L273 TraceCheckUtils]: 162: Hoare triple {49353#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49353#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:51,598 INFO L273 TraceCheckUtils]: 163: Hoare triple {49353#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49353#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:51,599 INFO L273 TraceCheckUtils]: 164: Hoare triple {49353#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {49354#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:51,600 INFO L273 TraceCheckUtils]: 165: Hoare triple {49354#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49354#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:51,600 INFO L273 TraceCheckUtils]: 166: Hoare triple {49354#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49354#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:51,601 INFO L273 TraceCheckUtils]: 167: Hoare triple {49354#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {49355#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:51,601 INFO L273 TraceCheckUtils]: 168: Hoare triple {49355#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49355#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:51,602 INFO L273 TraceCheckUtils]: 169: Hoare triple {49355#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49355#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:51,603 INFO L273 TraceCheckUtils]: 170: Hoare triple {49355#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {49356#(<= main_~i~0 55)} is VALID [2018-11-23 11:57:51,603 INFO L273 TraceCheckUtils]: 171: Hoare triple {49356#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49356#(<= main_~i~0 55)} is VALID [2018-11-23 11:57:51,604 INFO L273 TraceCheckUtils]: 172: Hoare triple {49356#(<= main_~i~0 55)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49356#(<= main_~i~0 55)} is VALID [2018-11-23 11:57:51,604 INFO L273 TraceCheckUtils]: 173: Hoare triple {49356#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {49357#(<= main_~i~0 56)} is VALID [2018-11-23 11:57:51,605 INFO L273 TraceCheckUtils]: 174: Hoare triple {49357#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49357#(<= main_~i~0 56)} is VALID [2018-11-23 11:57:51,605 INFO L273 TraceCheckUtils]: 175: Hoare triple {49357#(<= main_~i~0 56)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49357#(<= main_~i~0 56)} is VALID [2018-11-23 11:57:51,606 INFO L273 TraceCheckUtils]: 176: Hoare triple {49357#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {49358#(<= main_~i~0 57)} is VALID [2018-11-23 11:57:51,607 INFO L273 TraceCheckUtils]: 177: Hoare triple {49358#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49358#(<= main_~i~0 57)} is VALID [2018-11-23 11:57:51,607 INFO L273 TraceCheckUtils]: 178: Hoare triple {49358#(<= main_~i~0 57)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {49358#(<= main_~i~0 57)} is VALID [2018-11-23 11:57:51,608 INFO L273 TraceCheckUtils]: 179: Hoare triple {49358#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {49359#(<= main_~i~0 58)} is VALID [2018-11-23 11:57:51,608 INFO L273 TraceCheckUtils]: 180: Hoare triple {49359#(<= main_~i~0 58)} assume !(~i~0 < 100000); {49300#false} is VALID [2018-11-23 11:57:51,609 INFO L273 TraceCheckUtils]: 181: Hoare triple {49300#false} havoc ~x~0;~x~0 := 0; {49300#false} is VALID [2018-11-23 11:57:51,609 INFO L273 TraceCheckUtils]: 182: Hoare triple {49300#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {49300#false} is VALID [2018-11-23 11:57:51,609 INFO L256 TraceCheckUtils]: 183: Hoare triple {49300#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {49300#false} is VALID [2018-11-23 11:57:51,609 INFO L273 TraceCheckUtils]: 184: Hoare triple {49300#false} ~cond := #in~cond; {49300#false} is VALID [2018-11-23 11:57:51,609 INFO L273 TraceCheckUtils]: 185: Hoare triple {49300#false} assume 0 == ~cond; {49300#false} is VALID [2018-11-23 11:57:51,609 INFO L273 TraceCheckUtils]: 186: Hoare triple {49300#false} assume !false; {49300#false} is VALID [2018-11-23 11:57:51,633 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 0 proven. 5017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:51,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:51,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 62 [2018-11-23 11:57:51,652 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 187 [2018-11-23 11:57:51,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:51,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states. [2018-11-23 11:57:51,838 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:51,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-11-23 11:57:51,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-11-23 11:57:51,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-11-23 11:57:51,840 INFO L87 Difference]: Start difference. First operand 192 states and 251 transitions. Second operand 62 states. [2018-11-23 11:57:53,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:53,120 INFO L93 Difference]: Finished difference Result 208 states and 270 transitions. [2018-11-23 11:57:53,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-11-23 11:57:53,120 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 187 [2018-11-23 11:57:53,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:53,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 11:57:53,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 270 transitions. [2018-11-23 11:57:53,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 11:57:53,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 270 transitions. [2018-11-23 11:57:53,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 61 states and 270 transitions. [2018-11-23 11:57:53,366 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 270 edges. 270 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:53,370 INFO L225 Difference]: With dead ends: 208 [2018-11-23 11:57:53,370 INFO L226 Difference]: Without dead ends: 197 [2018-11-23 11:57:53,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-11-23 11:57:53,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-11-23 11:57:53,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2018-11-23 11:57:53,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:53,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand 195 states. [2018-11-23 11:57:53,421 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand 195 states. [2018-11-23 11:57:53,421 INFO L87 Difference]: Start difference. First operand 197 states. Second operand 195 states. [2018-11-23 11:57:53,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:53,424 INFO L93 Difference]: Finished difference Result 197 states and 258 transitions. [2018-11-23 11:57:53,425 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 258 transitions. [2018-11-23 11:57:53,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:53,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:53,425 INFO L74 IsIncluded]: Start isIncluded. First operand 195 states. Second operand 197 states. [2018-11-23 11:57:53,425 INFO L87 Difference]: Start difference. First operand 195 states. Second operand 197 states. [2018-11-23 11:57:53,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:53,428 INFO L93 Difference]: Finished difference Result 197 states and 258 transitions. [2018-11-23 11:57:53,428 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 258 transitions. [2018-11-23 11:57:53,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:53,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:53,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:53,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:53,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-23 11:57:53,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 255 transitions. [2018-11-23 11:57:53,431 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 255 transitions. Word has length 187 [2018-11-23 11:57:53,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:53,431 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 255 transitions. [2018-11-23 11:57:53,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-11-23 11:57:53,431 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 255 transitions. [2018-11-23 11:57:53,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-23 11:57:53,432 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:53,432 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:53,432 INFO L423 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:53,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:53,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1983237085, now seen corresponding path program 59 times [2018-11-23 11:57:53,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:53,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:53,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:53,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:53,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:55,051 INFO L256 TraceCheckUtils]: 0: Hoare triple {50855#true} call ULTIMATE.init(); {50855#true} is VALID [2018-11-23 11:57:55,051 INFO L273 TraceCheckUtils]: 1: Hoare triple {50855#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {50855#true} is VALID [2018-11-23 11:57:55,051 INFO L273 TraceCheckUtils]: 2: Hoare triple {50855#true} assume true; {50855#true} is VALID [2018-11-23 11:57:55,051 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {50855#true} {50855#true} #55#return; {50855#true} is VALID [2018-11-23 11:57:55,052 INFO L256 TraceCheckUtils]: 4: Hoare triple {50855#true} call #t~ret4 := main(); {50855#true} is VALID [2018-11-23 11:57:55,052 INFO L273 TraceCheckUtils]: 5: Hoare triple {50855#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {50857#(= main_~i~0 0)} is VALID [2018-11-23 11:57:55,053 INFO L273 TraceCheckUtils]: 6: Hoare triple {50857#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50857#(= main_~i~0 0)} is VALID [2018-11-23 11:57:55,053 INFO L273 TraceCheckUtils]: 7: Hoare triple {50857#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50857#(= main_~i~0 0)} is VALID [2018-11-23 11:57:55,054 INFO L273 TraceCheckUtils]: 8: Hoare triple {50857#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {50858#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:55,054 INFO L273 TraceCheckUtils]: 9: Hoare triple {50858#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50858#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:55,055 INFO L273 TraceCheckUtils]: 10: Hoare triple {50858#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50858#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:55,055 INFO L273 TraceCheckUtils]: 11: Hoare triple {50858#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {50859#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:55,056 INFO L273 TraceCheckUtils]: 12: Hoare triple {50859#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50859#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:55,056 INFO L273 TraceCheckUtils]: 13: Hoare triple {50859#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50859#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:55,057 INFO L273 TraceCheckUtils]: 14: Hoare triple {50859#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {50860#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:55,057 INFO L273 TraceCheckUtils]: 15: Hoare triple {50860#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50860#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:55,058 INFO L273 TraceCheckUtils]: 16: Hoare triple {50860#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50860#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:55,058 INFO L273 TraceCheckUtils]: 17: Hoare triple {50860#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {50861#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:55,059 INFO L273 TraceCheckUtils]: 18: Hoare triple {50861#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50861#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:55,059 INFO L273 TraceCheckUtils]: 19: Hoare triple {50861#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50861#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:55,060 INFO L273 TraceCheckUtils]: 20: Hoare triple {50861#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {50862#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:55,061 INFO L273 TraceCheckUtils]: 21: Hoare triple {50862#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50862#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:55,061 INFO L273 TraceCheckUtils]: 22: Hoare triple {50862#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50862#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:55,062 INFO L273 TraceCheckUtils]: 23: Hoare triple {50862#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {50863#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:55,062 INFO L273 TraceCheckUtils]: 24: Hoare triple {50863#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50863#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:55,063 INFO L273 TraceCheckUtils]: 25: Hoare triple {50863#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50863#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:55,063 INFO L273 TraceCheckUtils]: 26: Hoare triple {50863#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {50864#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:55,064 INFO L273 TraceCheckUtils]: 27: Hoare triple {50864#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50864#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:55,064 INFO L273 TraceCheckUtils]: 28: Hoare triple {50864#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50864#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:55,065 INFO L273 TraceCheckUtils]: 29: Hoare triple {50864#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {50865#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:55,065 INFO L273 TraceCheckUtils]: 30: Hoare triple {50865#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50865#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:55,066 INFO L273 TraceCheckUtils]: 31: Hoare triple {50865#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50865#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:55,067 INFO L273 TraceCheckUtils]: 32: Hoare triple {50865#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {50866#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:55,067 INFO L273 TraceCheckUtils]: 33: Hoare triple {50866#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50866#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:55,067 INFO L273 TraceCheckUtils]: 34: Hoare triple {50866#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50866#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:55,068 INFO L273 TraceCheckUtils]: 35: Hoare triple {50866#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {50867#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:55,069 INFO L273 TraceCheckUtils]: 36: Hoare triple {50867#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50867#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:55,069 INFO L273 TraceCheckUtils]: 37: Hoare triple {50867#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50867#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:55,070 INFO L273 TraceCheckUtils]: 38: Hoare triple {50867#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {50868#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:55,070 INFO L273 TraceCheckUtils]: 39: Hoare triple {50868#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50868#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:55,071 INFO L273 TraceCheckUtils]: 40: Hoare triple {50868#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50868#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:55,071 INFO L273 TraceCheckUtils]: 41: Hoare triple {50868#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {50869#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:55,072 INFO L273 TraceCheckUtils]: 42: Hoare triple {50869#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50869#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:55,072 INFO L273 TraceCheckUtils]: 43: Hoare triple {50869#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50869#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:55,073 INFO L273 TraceCheckUtils]: 44: Hoare triple {50869#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {50870#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:55,073 INFO L273 TraceCheckUtils]: 45: Hoare triple {50870#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50870#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:55,074 INFO L273 TraceCheckUtils]: 46: Hoare triple {50870#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50870#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:55,075 INFO L273 TraceCheckUtils]: 47: Hoare triple {50870#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {50871#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:55,075 INFO L273 TraceCheckUtils]: 48: Hoare triple {50871#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50871#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:55,075 INFO L273 TraceCheckUtils]: 49: Hoare triple {50871#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50871#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:55,076 INFO L273 TraceCheckUtils]: 50: Hoare triple {50871#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {50872#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:55,077 INFO L273 TraceCheckUtils]: 51: Hoare triple {50872#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50872#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:55,077 INFO L273 TraceCheckUtils]: 52: Hoare triple {50872#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50872#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:55,078 INFO L273 TraceCheckUtils]: 53: Hoare triple {50872#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {50873#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:55,078 INFO L273 TraceCheckUtils]: 54: Hoare triple {50873#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50873#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:55,079 INFO L273 TraceCheckUtils]: 55: Hoare triple {50873#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50873#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:55,079 INFO L273 TraceCheckUtils]: 56: Hoare triple {50873#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {50874#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:55,080 INFO L273 TraceCheckUtils]: 57: Hoare triple {50874#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50874#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:55,080 INFO L273 TraceCheckUtils]: 58: Hoare triple {50874#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50874#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:55,081 INFO L273 TraceCheckUtils]: 59: Hoare triple {50874#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {50875#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:55,081 INFO L273 TraceCheckUtils]: 60: Hoare triple {50875#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50875#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:55,082 INFO L273 TraceCheckUtils]: 61: Hoare triple {50875#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50875#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:55,083 INFO L273 TraceCheckUtils]: 62: Hoare triple {50875#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {50876#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:55,083 INFO L273 TraceCheckUtils]: 63: Hoare triple {50876#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50876#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:55,084 INFO L273 TraceCheckUtils]: 64: Hoare triple {50876#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50876#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:55,084 INFO L273 TraceCheckUtils]: 65: Hoare triple {50876#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {50877#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:55,085 INFO L273 TraceCheckUtils]: 66: Hoare triple {50877#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50877#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:55,085 INFO L273 TraceCheckUtils]: 67: Hoare triple {50877#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50877#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:55,086 INFO L273 TraceCheckUtils]: 68: Hoare triple {50877#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {50878#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:55,086 INFO L273 TraceCheckUtils]: 69: Hoare triple {50878#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50878#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:55,087 INFO L273 TraceCheckUtils]: 70: Hoare triple {50878#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50878#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:55,087 INFO L273 TraceCheckUtils]: 71: Hoare triple {50878#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {50879#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:55,088 INFO L273 TraceCheckUtils]: 72: Hoare triple {50879#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50879#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:55,088 INFO L273 TraceCheckUtils]: 73: Hoare triple {50879#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50879#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:55,089 INFO L273 TraceCheckUtils]: 74: Hoare triple {50879#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {50880#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:55,089 INFO L273 TraceCheckUtils]: 75: Hoare triple {50880#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50880#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:55,090 INFO L273 TraceCheckUtils]: 76: Hoare triple {50880#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50880#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:55,091 INFO L273 TraceCheckUtils]: 77: Hoare triple {50880#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {50881#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:55,091 INFO L273 TraceCheckUtils]: 78: Hoare triple {50881#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50881#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:55,091 INFO L273 TraceCheckUtils]: 79: Hoare triple {50881#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50881#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:55,092 INFO L273 TraceCheckUtils]: 80: Hoare triple {50881#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {50882#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:55,093 INFO L273 TraceCheckUtils]: 81: Hoare triple {50882#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50882#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:55,093 INFO L273 TraceCheckUtils]: 82: Hoare triple {50882#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50882#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:55,094 INFO L273 TraceCheckUtils]: 83: Hoare triple {50882#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {50883#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:55,094 INFO L273 TraceCheckUtils]: 84: Hoare triple {50883#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50883#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:55,095 INFO L273 TraceCheckUtils]: 85: Hoare triple {50883#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50883#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:55,095 INFO L273 TraceCheckUtils]: 86: Hoare triple {50883#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {50884#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:55,096 INFO L273 TraceCheckUtils]: 87: Hoare triple {50884#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50884#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:55,096 INFO L273 TraceCheckUtils]: 88: Hoare triple {50884#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50884#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:55,097 INFO L273 TraceCheckUtils]: 89: Hoare triple {50884#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {50885#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:55,097 INFO L273 TraceCheckUtils]: 90: Hoare triple {50885#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50885#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:55,098 INFO L273 TraceCheckUtils]: 91: Hoare triple {50885#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50885#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:55,098 INFO L273 TraceCheckUtils]: 92: Hoare triple {50885#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {50886#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:55,099 INFO L273 TraceCheckUtils]: 93: Hoare triple {50886#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50886#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:55,099 INFO L273 TraceCheckUtils]: 94: Hoare triple {50886#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50886#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:55,100 INFO L273 TraceCheckUtils]: 95: Hoare triple {50886#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {50887#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:55,101 INFO L273 TraceCheckUtils]: 96: Hoare triple {50887#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50887#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:55,101 INFO L273 TraceCheckUtils]: 97: Hoare triple {50887#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50887#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:55,102 INFO L273 TraceCheckUtils]: 98: Hoare triple {50887#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {50888#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:55,102 INFO L273 TraceCheckUtils]: 99: Hoare triple {50888#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50888#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:55,103 INFO L273 TraceCheckUtils]: 100: Hoare triple {50888#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50888#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:55,103 INFO L273 TraceCheckUtils]: 101: Hoare triple {50888#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {50889#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:55,104 INFO L273 TraceCheckUtils]: 102: Hoare triple {50889#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50889#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:55,104 INFO L273 TraceCheckUtils]: 103: Hoare triple {50889#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50889#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:55,105 INFO L273 TraceCheckUtils]: 104: Hoare triple {50889#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {50890#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:55,106 INFO L273 TraceCheckUtils]: 105: Hoare triple {50890#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50890#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:55,106 INFO L273 TraceCheckUtils]: 106: Hoare triple {50890#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50890#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:55,107 INFO L273 TraceCheckUtils]: 107: Hoare triple {50890#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {50891#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:55,107 INFO L273 TraceCheckUtils]: 108: Hoare triple {50891#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50891#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:55,108 INFO L273 TraceCheckUtils]: 109: Hoare triple {50891#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50891#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:55,108 INFO L273 TraceCheckUtils]: 110: Hoare triple {50891#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {50892#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:55,109 INFO L273 TraceCheckUtils]: 111: Hoare triple {50892#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50892#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:55,109 INFO L273 TraceCheckUtils]: 112: Hoare triple {50892#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50892#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:55,110 INFO L273 TraceCheckUtils]: 113: Hoare triple {50892#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {50893#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:55,111 INFO L273 TraceCheckUtils]: 114: Hoare triple {50893#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50893#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:55,111 INFO L273 TraceCheckUtils]: 115: Hoare triple {50893#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50893#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:55,112 INFO L273 TraceCheckUtils]: 116: Hoare triple {50893#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {50894#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:55,112 INFO L273 TraceCheckUtils]: 117: Hoare triple {50894#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50894#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:55,113 INFO L273 TraceCheckUtils]: 118: Hoare triple {50894#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50894#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:55,113 INFO L273 TraceCheckUtils]: 119: Hoare triple {50894#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {50895#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:55,114 INFO L273 TraceCheckUtils]: 120: Hoare triple {50895#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50895#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:55,114 INFO L273 TraceCheckUtils]: 121: Hoare triple {50895#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50895#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:55,115 INFO L273 TraceCheckUtils]: 122: Hoare triple {50895#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {50896#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:55,115 INFO L273 TraceCheckUtils]: 123: Hoare triple {50896#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50896#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:55,116 INFO L273 TraceCheckUtils]: 124: Hoare triple {50896#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50896#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:55,117 INFO L273 TraceCheckUtils]: 125: Hoare triple {50896#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {50897#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:55,117 INFO L273 TraceCheckUtils]: 126: Hoare triple {50897#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50897#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:55,118 INFO L273 TraceCheckUtils]: 127: Hoare triple {50897#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50897#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:55,118 INFO L273 TraceCheckUtils]: 128: Hoare triple {50897#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {50898#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:55,119 INFO L273 TraceCheckUtils]: 129: Hoare triple {50898#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50898#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:55,119 INFO L273 TraceCheckUtils]: 130: Hoare triple {50898#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50898#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:55,120 INFO L273 TraceCheckUtils]: 131: Hoare triple {50898#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {50899#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:55,120 INFO L273 TraceCheckUtils]: 132: Hoare triple {50899#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50899#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:55,121 INFO L273 TraceCheckUtils]: 133: Hoare triple {50899#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50899#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:55,121 INFO L273 TraceCheckUtils]: 134: Hoare triple {50899#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {50900#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:55,122 INFO L273 TraceCheckUtils]: 135: Hoare triple {50900#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50900#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:55,122 INFO L273 TraceCheckUtils]: 136: Hoare triple {50900#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50900#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:55,123 INFO L273 TraceCheckUtils]: 137: Hoare triple {50900#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {50901#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:55,123 INFO L273 TraceCheckUtils]: 138: Hoare triple {50901#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50901#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:55,124 INFO L273 TraceCheckUtils]: 139: Hoare triple {50901#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50901#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:55,125 INFO L273 TraceCheckUtils]: 140: Hoare triple {50901#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {50902#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:55,125 INFO L273 TraceCheckUtils]: 141: Hoare triple {50902#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50902#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:55,125 INFO L273 TraceCheckUtils]: 142: Hoare triple {50902#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50902#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:55,126 INFO L273 TraceCheckUtils]: 143: Hoare triple {50902#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {50903#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:55,127 INFO L273 TraceCheckUtils]: 144: Hoare triple {50903#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50903#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:55,127 INFO L273 TraceCheckUtils]: 145: Hoare triple {50903#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50903#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:55,128 INFO L273 TraceCheckUtils]: 146: Hoare triple {50903#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {50904#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:55,128 INFO L273 TraceCheckUtils]: 147: Hoare triple {50904#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50904#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:55,129 INFO L273 TraceCheckUtils]: 148: Hoare triple {50904#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50904#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:55,129 INFO L273 TraceCheckUtils]: 149: Hoare triple {50904#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {50905#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:55,130 INFO L273 TraceCheckUtils]: 150: Hoare triple {50905#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50905#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:55,130 INFO L273 TraceCheckUtils]: 151: Hoare triple {50905#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50905#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:55,131 INFO L273 TraceCheckUtils]: 152: Hoare triple {50905#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {50906#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:55,131 INFO L273 TraceCheckUtils]: 153: Hoare triple {50906#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50906#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:55,132 INFO L273 TraceCheckUtils]: 154: Hoare triple {50906#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50906#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:55,132 INFO L273 TraceCheckUtils]: 155: Hoare triple {50906#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {50907#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:55,133 INFO L273 TraceCheckUtils]: 156: Hoare triple {50907#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50907#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:55,133 INFO L273 TraceCheckUtils]: 157: Hoare triple {50907#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50907#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:55,134 INFO L273 TraceCheckUtils]: 158: Hoare triple {50907#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {50908#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:55,135 INFO L273 TraceCheckUtils]: 159: Hoare triple {50908#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50908#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:55,135 INFO L273 TraceCheckUtils]: 160: Hoare triple {50908#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50908#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:55,136 INFO L273 TraceCheckUtils]: 161: Hoare triple {50908#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {50909#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:55,136 INFO L273 TraceCheckUtils]: 162: Hoare triple {50909#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50909#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:55,137 INFO L273 TraceCheckUtils]: 163: Hoare triple {50909#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50909#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:55,137 INFO L273 TraceCheckUtils]: 164: Hoare triple {50909#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {50910#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:55,138 INFO L273 TraceCheckUtils]: 165: Hoare triple {50910#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50910#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:55,138 INFO L273 TraceCheckUtils]: 166: Hoare triple {50910#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50910#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:55,139 INFO L273 TraceCheckUtils]: 167: Hoare triple {50910#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {50911#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:55,139 INFO L273 TraceCheckUtils]: 168: Hoare triple {50911#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50911#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:55,140 INFO L273 TraceCheckUtils]: 169: Hoare triple {50911#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50911#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:55,140 INFO L273 TraceCheckUtils]: 170: Hoare triple {50911#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {50912#(<= main_~i~0 55)} is VALID [2018-11-23 11:57:55,141 INFO L273 TraceCheckUtils]: 171: Hoare triple {50912#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50912#(<= main_~i~0 55)} is VALID [2018-11-23 11:57:55,141 INFO L273 TraceCheckUtils]: 172: Hoare triple {50912#(<= main_~i~0 55)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50912#(<= main_~i~0 55)} is VALID [2018-11-23 11:57:55,142 INFO L273 TraceCheckUtils]: 173: Hoare triple {50912#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {50913#(<= main_~i~0 56)} is VALID [2018-11-23 11:57:55,143 INFO L273 TraceCheckUtils]: 174: Hoare triple {50913#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50913#(<= main_~i~0 56)} is VALID [2018-11-23 11:57:55,143 INFO L273 TraceCheckUtils]: 175: Hoare triple {50913#(<= main_~i~0 56)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50913#(<= main_~i~0 56)} is VALID [2018-11-23 11:57:55,144 INFO L273 TraceCheckUtils]: 176: Hoare triple {50913#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {50914#(<= main_~i~0 57)} is VALID [2018-11-23 11:57:55,144 INFO L273 TraceCheckUtils]: 177: Hoare triple {50914#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50914#(<= main_~i~0 57)} is VALID [2018-11-23 11:57:55,145 INFO L273 TraceCheckUtils]: 178: Hoare triple {50914#(<= main_~i~0 57)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50914#(<= main_~i~0 57)} is VALID [2018-11-23 11:57:55,145 INFO L273 TraceCheckUtils]: 179: Hoare triple {50914#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {50915#(<= main_~i~0 58)} is VALID [2018-11-23 11:57:55,146 INFO L273 TraceCheckUtils]: 180: Hoare triple {50915#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50915#(<= main_~i~0 58)} is VALID [2018-11-23 11:57:55,146 INFO L273 TraceCheckUtils]: 181: Hoare triple {50915#(<= main_~i~0 58)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50915#(<= main_~i~0 58)} is VALID [2018-11-23 11:57:55,147 INFO L273 TraceCheckUtils]: 182: Hoare triple {50915#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {50916#(<= main_~i~0 59)} is VALID [2018-11-23 11:57:55,147 INFO L273 TraceCheckUtils]: 183: Hoare triple {50916#(<= main_~i~0 59)} assume !(~i~0 < 100000); {50856#false} is VALID [2018-11-23 11:57:55,148 INFO L273 TraceCheckUtils]: 184: Hoare triple {50856#false} havoc ~x~0;~x~0 := 0; {50856#false} is VALID [2018-11-23 11:57:55,148 INFO L273 TraceCheckUtils]: 185: Hoare triple {50856#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {50856#false} is VALID [2018-11-23 11:57:55,148 INFO L256 TraceCheckUtils]: 186: Hoare triple {50856#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {50856#false} is VALID [2018-11-23 11:57:55,148 INFO L273 TraceCheckUtils]: 187: Hoare triple {50856#false} ~cond := #in~cond; {50856#false} is VALID [2018-11-23 11:57:55,148 INFO L273 TraceCheckUtils]: 188: Hoare triple {50856#false} assume 0 == ~cond; {50856#false} is VALID [2018-11-23 11:57:55,148 INFO L273 TraceCheckUtils]: 189: Hoare triple {50856#false} assume !false; {50856#false} is VALID [2018-11-23 11:57:55,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 0 proven. 5192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:55,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:55,173 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:55,196 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:57:55,345 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-11-23 11:57:55,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:57:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:55,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:55,799 INFO L256 TraceCheckUtils]: 0: Hoare triple {50855#true} call ULTIMATE.init(); {50855#true} is VALID [2018-11-23 11:57:55,799 INFO L273 TraceCheckUtils]: 1: Hoare triple {50855#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {50855#true} is VALID [2018-11-23 11:57:55,800 INFO L273 TraceCheckUtils]: 2: Hoare triple {50855#true} assume true; {50855#true} is VALID [2018-11-23 11:57:55,800 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {50855#true} {50855#true} #55#return; {50855#true} is VALID [2018-11-23 11:57:55,800 INFO L256 TraceCheckUtils]: 4: Hoare triple {50855#true} call #t~ret4 := main(); {50855#true} is VALID [2018-11-23 11:57:55,801 INFO L273 TraceCheckUtils]: 5: Hoare triple {50855#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {50935#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:55,801 INFO L273 TraceCheckUtils]: 6: Hoare triple {50935#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50935#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:55,801 INFO L273 TraceCheckUtils]: 7: Hoare triple {50935#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50935#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:55,802 INFO L273 TraceCheckUtils]: 8: Hoare triple {50935#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {50858#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:55,802 INFO L273 TraceCheckUtils]: 9: Hoare triple {50858#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50858#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:55,802 INFO L273 TraceCheckUtils]: 10: Hoare triple {50858#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50858#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:55,803 INFO L273 TraceCheckUtils]: 11: Hoare triple {50858#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {50859#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:55,803 INFO L273 TraceCheckUtils]: 12: Hoare triple {50859#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50859#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:55,803 INFO L273 TraceCheckUtils]: 13: Hoare triple {50859#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50859#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:55,804 INFO L273 TraceCheckUtils]: 14: Hoare triple {50859#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {50860#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:55,804 INFO L273 TraceCheckUtils]: 15: Hoare triple {50860#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50860#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:55,805 INFO L273 TraceCheckUtils]: 16: Hoare triple {50860#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50860#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:55,805 INFO L273 TraceCheckUtils]: 17: Hoare triple {50860#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {50861#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:55,806 INFO L273 TraceCheckUtils]: 18: Hoare triple {50861#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50861#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:55,806 INFO L273 TraceCheckUtils]: 19: Hoare triple {50861#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50861#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:55,807 INFO L273 TraceCheckUtils]: 20: Hoare triple {50861#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {50862#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:55,807 INFO L273 TraceCheckUtils]: 21: Hoare triple {50862#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50862#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:55,808 INFO L273 TraceCheckUtils]: 22: Hoare triple {50862#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50862#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:55,808 INFO L273 TraceCheckUtils]: 23: Hoare triple {50862#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {50863#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:55,809 INFO L273 TraceCheckUtils]: 24: Hoare triple {50863#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50863#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:55,809 INFO L273 TraceCheckUtils]: 25: Hoare triple {50863#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50863#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:55,810 INFO L273 TraceCheckUtils]: 26: Hoare triple {50863#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {50864#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:55,811 INFO L273 TraceCheckUtils]: 27: Hoare triple {50864#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50864#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:55,811 INFO L273 TraceCheckUtils]: 28: Hoare triple {50864#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50864#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:55,812 INFO L273 TraceCheckUtils]: 29: Hoare triple {50864#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {50865#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:55,812 INFO L273 TraceCheckUtils]: 30: Hoare triple {50865#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50865#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:55,813 INFO L273 TraceCheckUtils]: 31: Hoare triple {50865#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50865#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:55,813 INFO L273 TraceCheckUtils]: 32: Hoare triple {50865#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {50866#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:55,814 INFO L273 TraceCheckUtils]: 33: Hoare triple {50866#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50866#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:55,814 INFO L273 TraceCheckUtils]: 34: Hoare triple {50866#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50866#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:55,815 INFO L273 TraceCheckUtils]: 35: Hoare triple {50866#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {50867#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:55,815 INFO L273 TraceCheckUtils]: 36: Hoare triple {50867#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50867#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:55,816 INFO L273 TraceCheckUtils]: 37: Hoare triple {50867#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50867#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:55,816 INFO L273 TraceCheckUtils]: 38: Hoare triple {50867#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {50868#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:55,817 INFO L273 TraceCheckUtils]: 39: Hoare triple {50868#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50868#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:55,817 INFO L273 TraceCheckUtils]: 40: Hoare triple {50868#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50868#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:55,818 INFO L273 TraceCheckUtils]: 41: Hoare triple {50868#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {50869#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:55,819 INFO L273 TraceCheckUtils]: 42: Hoare triple {50869#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50869#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:55,819 INFO L273 TraceCheckUtils]: 43: Hoare triple {50869#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50869#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:55,820 INFO L273 TraceCheckUtils]: 44: Hoare triple {50869#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {50870#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:55,820 INFO L273 TraceCheckUtils]: 45: Hoare triple {50870#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50870#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:55,821 INFO L273 TraceCheckUtils]: 46: Hoare triple {50870#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50870#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:55,821 INFO L273 TraceCheckUtils]: 47: Hoare triple {50870#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {50871#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:55,822 INFO L273 TraceCheckUtils]: 48: Hoare triple {50871#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50871#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:55,822 INFO L273 TraceCheckUtils]: 49: Hoare triple {50871#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50871#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:55,823 INFO L273 TraceCheckUtils]: 50: Hoare triple {50871#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {50872#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:55,823 INFO L273 TraceCheckUtils]: 51: Hoare triple {50872#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50872#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:55,824 INFO L273 TraceCheckUtils]: 52: Hoare triple {50872#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50872#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:55,824 INFO L273 TraceCheckUtils]: 53: Hoare triple {50872#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {50873#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:55,825 INFO L273 TraceCheckUtils]: 54: Hoare triple {50873#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50873#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:55,825 INFO L273 TraceCheckUtils]: 55: Hoare triple {50873#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50873#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:55,826 INFO L273 TraceCheckUtils]: 56: Hoare triple {50873#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {50874#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:55,826 INFO L273 TraceCheckUtils]: 57: Hoare triple {50874#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50874#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:55,827 INFO L273 TraceCheckUtils]: 58: Hoare triple {50874#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50874#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:55,828 INFO L273 TraceCheckUtils]: 59: Hoare triple {50874#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {50875#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:55,828 INFO L273 TraceCheckUtils]: 60: Hoare triple {50875#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50875#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:55,829 INFO L273 TraceCheckUtils]: 61: Hoare triple {50875#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50875#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:55,829 INFO L273 TraceCheckUtils]: 62: Hoare triple {50875#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {50876#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:55,830 INFO L273 TraceCheckUtils]: 63: Hoare triple {50876#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50876#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:55,830 INFO L273 TraceCheckUtils]: 64: Hoare triple {50876#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50876#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:55,831 INFO L273 TraceCheckUtils]: 65: Hoare triple {50876#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {50877#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:55,831 INFO L273 TraceCheckUtils]: 66: Hoare triple {50877#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50877#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:55,832 INFO L273 TraceCheckUtils]: 67: Hoare triple {50877#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50877#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:55,832 INFO L273 TraceCheckUtils]: 68: Hoare triple {50877#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {50878#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:55,833 INFO L273 TraceCheckUtils]: 69: Hoare triple {50878#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50878#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:55,833 INFO L273 TraceCheckUtils]: 70: Hoare triple {50878#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50878#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:55,834 INFO L273 TraceCheckUtils]: 71: Hoare triple {50878#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {50879#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:55,834 INFO L273 TraceCheckUtils]: 72: Hoare triple {50879#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50879#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:55,835 INFO L273 TraceCheckUtils]: 73: Hoare triple {50879#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50879#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:55,836 INFO L273 TraceCheckUtils]: 74: Hoare triple {50879#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {50880#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:55,836 INFO L273 TraceCheckUtils]: 75: Hoare triple {50880#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50880#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:55,837 INFO L273 TraceCheckUtils]: 76: Hoare triple {50880#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50880#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:55,837 INFO L273 TraceCheckUtils]: 77: Hoare triple {50880#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {50881#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:55,838 INFO L273 TraceCheckUtils]: 78: Hoare triple {50881#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50881#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:55,838 INFO L273 TraceCheckUtils]: 79: Hoare triple {50881#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50881#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:55,839 INFO L273 TraceCheckUtils]: 80: Hoare triple {50881#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {50882#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:55,839 INFO L273 TraceCheckUtils]: 81: Hoare triple {50882#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50882#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:55,840 INFO L273 TraceCheckUtils]: 82: Hoare triple {50882#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50882#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:55,840 INFO L273 TraceCheckUtils]: 83: Hoare triple {50882#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {50883#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:55,841 INFO L273 TraceCheckUtils]: 84: Hoare triple {50883#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50883#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:55,841 INFO L273 TraceCheckUtils]: 85: Hoare triple {50883#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50883#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:55,842 INFO L273 TraceCheckUtils]: 86: Hoare triple {50883#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {50884#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:55,842 INFO L273 TraceCheckUtils]: 87: Hoare triple {50884#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50884#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:55,843 INFO L273 TraceCheckUtils]: 88: Hoare triple {50884#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50884#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:55,844 INFO L273 TraceCheckUtils]: 89: Hoare triple {50884#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {50885#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:55,844 INFO L273 TraceCheckUtils]: 90: Hoare triple {50885#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50885#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:55,844 INFO L273 TraceCheckUtils]: 91: Hoare triple {50885#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50885#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:55,845 INFO L273 TraceCheckUtils]: 92: Hoare triple {50885#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {50886#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:55,846 INFO L273 TraceCheckUtils]: 93: Hoare triple {50886#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50886#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:55,846 INFO L273 TraceCheckUtils]: 94: Hoare triple {50886#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50886#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:55,847 INFO L273 TraceCheckUtils]: 95: Hoare triple {50886#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {50887#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:55,847 INFO L273 TraceCheckUtils]: 96: Hoare triple {50887#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50887#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:55,848 INFO L273 TraceCheckUtils]: 97: Hoare triple {50887#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50887#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:55,848 INFO L273 TraceCheckUtils]: 98: Hoare triple {50887#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {50888#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:55,849 INFO L273 TraceCheckUtils]: 99: Hoare triple {50888#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50888#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:55,849 INFO L273 TraceCheckUtils]: 100: Hoare triple {50888#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50888#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:55,850 INFO L273 TraceCheckUtils]: 101: Hoare triple {50888#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {50889#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:55,850 INFO L273 TraceCheckUtils]: 102: Hoare triple {50889#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50889#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:55,851 INFO L273 TraceCheckUtils]: 103: Hoare triple {50889#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50889#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:55,851 INFO L273 TraceCheckUtils]: 104: Hoare triple {50889#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {50890#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:55,852 INFO L273 TraceCheckUtils]: 105: Hoare triple {50890#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50890#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:55,852 INFO L273 TraceCheckUtils]: 106: Hoare triple {50890#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50890#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:55,853 INFO L273 TraceCheckUtils]: 107: Hoare triple {50890#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {50891#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:55,854 INFO L273 TraceCheckUtils]: 108: Hoare triple {50891#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50891#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:55,854 INFO L273 TraceCheckUtils]: 109: Hoare triple {50891#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50891#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:55,855 INFO L273 TraceCheckUtils]: 110: Hoare triple {50891#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {50892#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:55,855 INFO L273 TraceCheckUtils]: 111: Hoare triple {50892#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50892#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:55,856 INFO L273 TraceCheckUtils]: 112: Hoare triple {50892#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50892#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:55,856 INFO L273 TraceCheckUtils]: 113: Hoare triple {50892#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {50893#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:55,857 INFO L273 TraceCheckUtils]: 114: Hoare triple {50893#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50893#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:55,857 INFO L273 TraceCheckUtils]: 115: Hoare triple {50893#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50893#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:55,858 INFO L273 TraceCheckUtils]: 116: Hoare triple {50893#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {50894#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:55,858 INFO L273 TraceCheckUtils]: 117: Hoare triple {50894#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50894#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:55,859 INFO L273 TraceCheckUtils]: 118: Hoare triple {50894#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50894#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:55,859 INFO L273 TraceCheckUtils]: 119: Hoare triple {50894#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {50895#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:55,860 INFO L273 TraceCheckUtils]: 120: Hoare triple {50895#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50895#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:55,860 INFO L273 TraceCheckUtils]: 121: Hoare triple {50895#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50895#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:55,861 INFO L273 TraceCheckUtils]: 122: Hoare triple {50895#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {50896#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:55,862 INFO L273 TraceCheckUtils]: 123: Hoare triple {50896#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50896#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:55,862 INFO L273 TraceCheckUtils]: 124: Hoare triple {50896#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50896#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:55,863 INFO L273 TraceCheckUtils]: 125: Hoare triple {50896#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {50897#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:55,863 INFO L273 TraceCheckUtils]: 126: Hoare triple {50897#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50897#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:55,864 INFO L273 TraceCheckUtils]: 127: Hoare triple {50897#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50897#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:55,864 INFO L273 TraceCheckUtils]: 128: Hoare triple {50897#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {50898#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:55,865 INFO L273 TraceCheckUtils]: 129: Hoare triple {50898#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50898#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:55,865 INFO L273 TraceCheckUtils]: 130: Hoare triple {50898#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50898#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:55,866 INFO L273 TraceCheckUtils]: 131: Hoare triple {50898#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {50899#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:55,866 INFO L273 TraceCheckUtils]: 132: Hoare triple {50899#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50899#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:55,867 INFO L273 TraceCheckUtils]: 133: Hoare triple {50899#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50899#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:55,867 INFO L273 TraceCheckUtils]: 134: Hoare triple {50899#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {50900#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:55,868 INFO L273 TraceCheckUtils]: 135: Hoare triple {50900#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50900#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:55,868 INFO L273 TraceCheckUtils]: 136: Hoare triple {50900#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50900#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:55,869 INFO L273 TraceCheckUtils]: 137: Hoare triple {50900#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {50901#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:55,870 INFO L273 TraceCheckUtils]: 138: Hoare triple {50901#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50901#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:55,870 INFO L273 TraceCheckUtils]: 139: Hoare triple {50901#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50901#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:55,871 INFO L273 TraceCheckUtils]: 140: Hoare triple {50901#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {50902#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:55,871 INFO L273 TraceCheckUtils]: 141: Hoare triple {50902#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50902#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:55,872 INFO L273 TraceCheckUtils]: 142: Hoare triple {50902#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50902#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:55,872 INFO L273 TraceCheckUtils]: 143: Hoare triple {50902#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {50903#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:55,873 INFO L273 TraceCheckUtils]: 144: Hoare triple {50903#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50903#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:55,873 INFO L273 TraceCheckUtils]: 145: Hoare triple {50903#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50903#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:55,874 INFO L273 TraceCheckUtils]: 146: Hoare triple {50903#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {50904#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:55,874 INFO L273 TraceCheckUtils]: 147: Hoare triple {50904#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50904#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:55,875 INFO L273 TraceCheckUtils]: 148: Hoare triple {50904#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50904#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:55,875 INFO L273 TraceCheckUtils]: 149: Hoare triple {50904#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {50905#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:55,876 INFO L273 TraceCheckUtils]: 150: Hoare triple {50905#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50905#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:55,876 INFO L273 TraceCheckUtils]: 151: Hoare triple {50905#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50905#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:55,877 INFO L273 TraceCheckUtils]: 152: Hoare triple {50905#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {50906#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:55,877 INFO L273 TraceCheckUtils]: 153: Hoare triple {50906#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50906#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:55,878 INFO L273 TraceCheckUtils]: 154: Hoare triple {50906#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50906#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:55,879 INFO L273 TraceCheckUtils]: 155: Hoare triple {50906#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {50907#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:55,879 INFO L273 TraceCheckUtils]: 156: Hoare triple {50907#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50907#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:55,880 INFO L273 TraceCheckUtils]: 157: Hoare triple {50907#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50907#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:55,880 INFO L273 TraceCheckUtils]: 158: Hoare triple {50907#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {50908#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:55,881 INFO L273 TraceCheckUtils]: 159: Hoare triple {50908#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50908#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:55,881 INFO L273 TraceCheckUtils]: 160: Hoare triple {50908#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50908#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:55,882 INFO L273 TraceCheckUtils]: 161: Hoare triple {50908#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {50909#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:55,882 INFO L273 TraceCheckUtils]: 162: Hoare triple {50909#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50909#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:55,883 INFO L273 TraceCheckUtils]: 163: Hoare triple {50909#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50909#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:55,883 INFO L273 TraceCheckUtils]: 164: Hoare triple {50909#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {50910#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:55,884 INFO L273 TraceCheckUtils]: 165: Hoare triple {50910#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50910#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:55,884 INFO L273 TraceCheckUtils]: 166: Hoare triple {50910#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50910#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:55,885 INFO L273 TraceCheckUtils]: 167: Hoare triple {50910#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {50911#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:55,885 INFO L273 TraceCheckUtils]: 168: Hoare triple {50911#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50911#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:55,886 INFO L273 TraceCheckUtils]: 169: Hoare triple {50911#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50911#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:55,887 INFO L273 TraceCheckUtils]: 170: Hoare triple {50911#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {50912#(<= main_~i~0 55)} is VALID [2018-11-23 11:57:55,887 INFO L273 TraceCheckUtils]: 171: Hoare triple {50912#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50912#(<= main_~i~0 55)} is VALID [2018-11-23 11:57:55,888 INFO L273 TraceCheckUtils]: 172: Hoare triple {50912#(<= main_~i~0 55)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50912#(<= main_~i~0 55)} is VALID [2018-11-23 11:57:55,888 INFO L273 TraceCheckUtils]: 173: Hoare triple {50912#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {50913#(<= main_~i~0 56)} is VALID [2018-11-23 11:57:55,889 INFO L273 TraceCheckUtils]: 174: Hoare triple {50913#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50913#(<= main_~i~0 56)} is VALID [2018-11-23 11:57:55,889 INFO L273 TraceCheckUtils]: 175: Hoare triple {50913#(<= main_~i~0 56)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50913#(<= main_~i~0 56)} is VALID [2018-11-23 11:57:55,890 INFO L273 TraceCheckUtils]: 176: Hoare triple {50913#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {50914#(<= main_~i~0 57)} is VALID [2018-11-23 11:57:55,890 INFO L273 TraceCheckUtils]: 177: Hoare triple {50914#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50914#(<= main_~i~0 57)} is VALID [2018-11-23 11:57:55,891 INFO L273 TraceCheckUtils]: 178: Hoare triple {50914#(<= main_~i~0 57)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50914#(<= main_~i~0 57)} is VALID [2018-11-23 11:57:55,892 INFO L273 TraceCheckUtils]: 179: Hoare triple {50914#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {50915#(<= main_~i~0 58)} is VALID [2018-11-23 11:57:55,892 INFO L273 TraceCheckUtils]: 180: Hoare triple {50915#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50915#(<= main_~i~0 58)} is VALID [2018-11-23 11:57:55,892 INFO L273 TraceCheckUtils]: 181: Hoare triple {50915#(<= main_~i~0 58)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {50915#(<= main_~i~0 58)} is VALID [2018-11-23 11:57:55,893 INFO L273 TraceCheckUtils]: 182: Hoare triple {50915#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {50916#(<= main_~i~0 59)} is VALID [2018-11-23 11:57:55,894 INFO L273 TraceCheckUtils]: 183: Hoare triple {50916#(<= main_~i~0 59)} assume !(~i~0 < 100000); {50856#false} is VALID [2018-11-23 11:57:55,894 INFO L273 TraceCheckUtils]: 184: Hoare triple {50856#false} havoc ~x~0;~x~0 := 0; {50856#false} is VALID [2018-11-23 11:57:55,894 INFO L273 TraceCheckUtils]: 185: Hoare triple {50856#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {50856#false} is VALID [2018-11-23 11:57:55,894 INFO L256 TraceCheckUtils]: 186: Hoare triple {50856#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {50856#false} is VALID [2018-11-23 11:57:55,894 INFO L273 TraceCheckUtils]: 187: Hoare triple {50856#false} ~cond := #in~cond; {50856#false} is VALID [2018-11-23 11:57:55,895 INFO L273 TraceCheckUtils]: 188: Hoare triple {50856#false} assume 0 == ~cond; {50856#false} is VALID [2018-11-23 11:57:55,895 INFO L273 TraceCheckUtils]: 189: Hoare triple {50856#false} assume !false; {50856#false} is VALID [2018-11-23 11:57:55,918 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 0 proven. 5192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:55,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:55,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 63 [2018-11-23 11:57:55,938 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 190 [2018-11-23 11:57:55,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:55,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 63 states. [2018-11-23 11:57:56,117 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:56,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-11-23 11:57:56,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-11-23 11:57:56,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-23 11:57:56,118 INFO L87 Difference]: Start difference. First operand 195 states and 255 transitions. Second operand 63 states. [2018-11-23 11:57:57,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:57,578 INFO L93 Difference]: Finished difference Result 211 states and 274 transitions. [2018-11-23 11:57:57,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-11-23 11:57:57,578 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 190 [2018-11-23 11:57:57,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:57,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 11:57:57,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 274 transitions. [2018-11-23 11:57:57,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 11:57:57,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 274 transitions. [2018-11-23 11:57:57,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states and 274 transitions. [2018-11-23 11:57:57,840 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 274 edges. 274 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:57,844 INFO L225 Difference]: With dead ends: 211 [2018-11-23 11:57:57,844 INFO L226 Difference]: Without dead ends: 200 [2018-11-23 11:57:57,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-23 11:57:57,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-11-23 11:57:57,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2018-11-23 11:57:57,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:57,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand 198 states. [2018-11-23 11:57:57,937 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 198 states. [2018-11-23 11:57:57,937 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 198 states. [2018-11-23 11:57:57,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:57,940 INFO L93 Difference]: Finished difference Result 200 states and 262 transitions. [2018-11-23 11:57:57,940 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 262 transitions. [2018-11-23 11:57:57,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:57,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:57,941 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand 200 states. [2018-11-23 11:57:57,941 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 200 states. [2018-11-23 11:57:57,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:57,944 INFO L93 Difference]: Finished difference Result 200 states and 262 transitions. [2018-11-23 11:57:57,944 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 262 transitions. [2018-11-23 11:57:57,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:57,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:57,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:57,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:57,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-11-23 11:57:57,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 259 transitions. [2018-11-23 11:57:57,947 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 259 transitions. Word has length 190 [2018-11-23 11:57:57,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:57,947 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 259 transitions. [2018-11-23 11:57:57,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-11-23 11:57:57,947 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 259 transitions. [2018-11-23 11:57:57,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-23 11:57:57,948 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:57,948 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:57,948 INFO L423 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:57,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:57,948 INFO L82 PathProgramCache]: Analyzing trace with hash -2000509639, now seen corresponding path program 60 times [2018-11-23 11:57:57,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:57,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:57,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:57,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:57,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:59,603 INFO L256 TraceCheckUtils]: 0: Hoare triple {52435#true} call ULTIMATE.init(); {52435#true} is VALID [2018-11-23 11:57:59,603 INFO L273 TraceCheckUtils]: 1: Hoare triple {52435#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {52435#true} is VALID [2018-11-23 11:57:59,603 INFO L273 TraceCheckUtils]: 2: Hoare triple {52435#true} assume true; {52435#true} is VALID [2018-11-23 11:57:59,603 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {52435#true} {52435#true} #55#return; {52435#true} is VALID [2018-11-23 11:57:59,604 INFO L256 TraceCheckUtils]: 4: Hoare triple {52435#true} call #t~ret4 := main(); {52435#true} is VALID [2018-11-23 11:57:59,604 INFO L273 TraceCheckUtils]: 5: Hoare triple {52435#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {52437#(= main_~i~0 0)} is VALID [2018-11-23 11:57:59,605 INFO L273 TraceCheckUtils]: 6: Hoare triple {52437#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52437#(= main_~i~0 0)} is VALID [2018-11-23 11:57:59,605 INFO L273 TraceCheckUtils]: 7: Hoare triple {52437#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52437#(= main_~i~0 0)} is VALID [2018-11-23 11:57:59,606 INFO L273 TraceCheckUtils]: 8: Hoare triple {52437#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {52438#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:59,606 INFO L273 TraceCheckUtils]: 9: Hoare triple {52438#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52438#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:59,606 INFO L273 TraceCheckUtils]: 10: Hoare triple {52438#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52438#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:59,607 INFO L273 TraceCheckUtils]: 11: Hoare triple {52438#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {52439#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:59,607 INFO L273 TraceCheckUtils]: 12: Hoare triple {52439#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52439#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:59,607 INFO L273 TraceCheckUtils]: 13: Hoare triple {52439#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52439#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:59,608 INFO L273 TraceCheckUtils]: 14: Hoare triple {52439#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {52440#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:59,608 INFO L273 TraceCheckUtils]: 15: Hoare triple {52440#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52440#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:59,609 INFO L273 TraceCheckUtils]: 16: Hoare triple {52440#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52440#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:59,609 INFO L273 TraceCheckUtils]: 17: Hoare triple {52440#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {52441#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:59,610 INFO L273 TraceCheckUtils]: 18: Hoare triple {52441#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52441#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:59,610 INFO L273 TraceCheckUtils]: 19: Hoare triple {52441#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52441#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:59,611 INFO L273 TraceCheckUtils]: 20: Hoare triple {52441#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {52442#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:59,611 INFO L273 TraceCheckUtils]: 21: Hoare triple {52442#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52442#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:59,612 INFO L273 TraceCheckUtils]: 22: Hoare triple {52442#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52442#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:59,613 INFO L273 TraceCheckUtils]: 23: Hoare triple {52442#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {52443#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:59,613 INFO L273 TraceCheckUtils]: 24: Hoare triple {52443#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52443#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:59,613 INFO L273 TraceCheckUtils]: 25: Hoare triple {52443#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52443#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:59,614 INFO L273 TraceCheckUtils]: 26: Hoare triple {52443#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {52444#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:59,615 INFO L273 TraceCheckUtils]: 27: Hoare triple {52444#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52444#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:59,615 INFO L273 TraceCheckUtils]: 28: Hoare triple {52444#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52444#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:59,616 INFO L273 TraceCheckUtils]: 29: Hoare triple {52444#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {52445#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:59,616 INFO L273 TraceCheckUtils]: 30: Hoare triple {52445#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52445#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:59,617 INFO L273 TraceCheckUtils]: 31: Hoare triple {52445#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52445#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:59,617 INFO L273 TraceCheckUtils]: 32: Hoare triple {52445#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {52446#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:59,618 INFO L273 TraceCheckUtils]: 33: Hoare triple {52446#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52446#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:59,618 INFO L273 TraceCheckUtils]: 34: Hoare triple {52446#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52446#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:59,619 INFO L273 TraceCheckUtils]: 35: Hoare triple {52446#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {52447#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:59,619 INFO L273 TraceCheckUtils]: 36: Hoare triple {52447#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52447#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:59,620 INFO L273 TraceCheckUtils]: 37: Hoare triple {52447#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52447#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:59,621 INFO L273 TraceCheckUtils]: 38: Hoare triple {52447#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {52448#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:59,621 INFO L273 TraceCheckUtils]: 39: Hoare triple {52448#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52448#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:59,621 INFO L273 TraceCheckUtils]: 40: Hoare triple {52448#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52448#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:59,622 INFO L273 TraceCheckUtils]: 41: Hoare triple {52448#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {52449#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:59,623 INFO L273 TraceCheckUtils]: 42: Hoare triple {52449#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52449#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:59,623 INFO L273 TraceCheckUtils]: 43: Hoare triple {52449#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52449#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:59,624 INFO L273 TraceCheckUtils]: 44: Hoare triple {52449#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {52450#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:59,624 INFO L273 TraceCheckUtils]: 45: Hoare triple {52450#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52450#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:59,625 INFO L273 TraceCheckUtils]: 46: Hoare triple {52450#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52450#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:59,625 INFO L273 TraceCheckUtils]: 47: Hoare triple {52450#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {52451#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:59,626 INFO L273 TraceCheckUtils]: 48: Hoare triple {52451#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52451#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:59,626 INFO L273 TraceCheckUtils]: 49: Hoare triple {52451#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52451#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:59,627 INFO L273 TraceCheckUtils]: 50: Hoare triple {52451#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {52452#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:59,627 INFO L273 TraceCheckUtils]: 51: Hoare triple {52452#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52452#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:59,628 INFO L273 TraceCheckUtils]: 52: Hoare triple {52452#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52452#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:59,629 INFO L273 TraceCheckUtils]: 53: Hoare triple {52452#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {52453#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:59,629 INFO L273 TraceCheckUtils]: 54: Hoare triple {52453#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52453#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:59,629 INFO L273 TraceCheckUtils]: 55: Hoare triple {52453#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52453#(<= main_~i~0 16)} is VALID [2018-11-23 11:57:59,630 INFO L273 TraceCheckUtils]: 56: Hoare triple {52453#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {52454#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:59,631 INFO L273 TraceCheckUtils]: 57: Hoare triple {52454#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52454#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:59,631 INFO L273 TraceCheckUtils]: 58: Hoare triple {52454#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52454#(<= main_~i~0 17)} is VALID [2018-11-23 11:57:59,632 INFO L273 TraceCheckUtils]: 59: Hoare triple {52454#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {52455#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:59,632 INFO L273 TraceCheckUtils]: 60: Hoare triple {52455#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52455#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:59,633 INFO L273 TraceCheckUtils]: 61: Hoare triple {52455#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52455#(<= main_~i~0 18)} is VALID [2018-11-23 11:57:59,633 INFO L273 TraceCheckUtils]: 62: Hoare triple {52455#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {52456#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:59,634 INFO L273 TraceCheckUtils]: 63: Hoare triple {52456#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52456#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:59,634 INFO L273 TraceCheckUtils]: 64: Hoare triple {52456#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52456#(<= main_~i~0 19)} is VALID [2018-11-23 11:57:59,635 INFO L273 TraceCheckUtils]: 65: Hoare triple {52456#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {52457#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:59,635 INFO L273 TraceCheckUtils]: 66: Hoare triple {52457#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52457#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:59,636 INFO L273 TraceCheckUtils]: 67: Hoare triple {52457#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52457#(<= main_~i~0 20)} is VALID [2018-11-23 11:57:59,637 INFO L273 TraceCheckUtils]: 68: Hoare triple {52457#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {52458#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:59,637 INFO L273 TraceCheckUtils]: 69: Hoare triple {52458#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52458#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:59,637 INFO L273 TraceCheckUtils]: 70: Hoare triple {52458#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52458#(<= main_~i~0 21)} is VALID [2018-11-23 11:57:59,638 INFO L273 TraceCheckUtils]: 71: Hoare triple {52458#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {52459#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:59,639 INFO L273 TraceCheckUtils]: 72: Hoare triple {52459#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52459#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:59,639 INFO L273 TraceCheckUtils]: 73: Hoare triple {52459#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52459#(<= main_~i~0 22)} is VALID [2018-11-23 11:57:59,640 INFO L273 TraceCheckUtils]: 74: Hoare triple {52459#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {52460#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:59,640 INFO L273 TraceCheckUtils]: 75: Hoare triple {52460#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52460#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:59,641 INFO L273 TraceCheckUtils]: 76: Hoare triple {52460#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52460#(<= main_~i~0 23)} is VALID [2018-11-23 11:57:59,641 INFO L273 TraceCheckUtils]: 77: Hoare triple {52460#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {52461#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:59,642 INFO L273 TraceCheckUtils]: 78: Hoare triple {52461#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52461#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:59,642 INFO L273 TraceCheckUtils]: 79: Hoare triple {52461#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52461#(<= main_~i~0 24)} is VALID [2018-11-23 11:57:59,643 INFO L273 TraceCheckUtils]: 80: Hoare triple {52461#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {52462#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:59,643 INFO L273 TraceCheckUtils]: 81: Hoare triple {52462#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52462#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:59,644 INFO L273 TraceCheckUtils]: 82: Hoare triple {52462#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52462#(<= main_~i~0 25)} is VALID [2018-11-23 11:57:59,645 INFO L273 TraceCheckUtils]: 83: Hoare triple {52462#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {52463#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:59,645 INFO L273 TraceCheckUtils]: 84: Hoare triple {52463#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52463#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:59,645 INFO L273 TraceCheckUtils]: 85: Hoare triple {52463#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52463#(<= main_~i~0 26)} is VALID [2018-11-23 11:57:59,646 INFO L273 TraceCheckUtils]: 86: Hoare triple {52463#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {52464#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:59,647 INFO L273 TraceCheckUtils]: 87: Hoare triple {52464#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52464#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:59,647 INFO L273 TraceCheckUtils]: 88: Hoare triple {52464#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52464#(<= main_~i~0 27)} is VALID [2018-11-23 11:57:59,648 INFO L273 TraceCheckUtils]: 89: Hoare triple {52464#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {52465#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:59,648 INFO L273 TraceCheckUtils]: 90: Hoare triple {52465#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52465#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:59,649 INFO L273 TraceCheckUtils]: 91: Hoare triple {52465#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52465#(<= main_~i~0 28)} is VALID [2018-11-23 11:57:59,672 INFO L273 TraceCheckUtils]: 92: Hoare triple {52465#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {52466#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:59,673 INFO L273 TraceCheckUtils]: 93: Hoare triple {52466#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52466#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:59,673 INFO L273 TraceCheckUtils]: 94: Hoare triple {52466#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52466#(<= main_~i~0 29)} is VALID [2018-11-23 11:57:59,673 INFO L273 TraceCheckUtils]: 95: Hoare triple {52466#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {52467#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:59,674 INFO L273 TraceCheckUtils]: 96: Hoare triple {52467#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52467#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:59,674 INFO L273 TraceCheckUtils]: 97: Hoare triple {52467#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52467#(<= main_~i~0 30)} is VALID [2018-11-23 11:57:59,674 INFO L273 TraceCheckUtils]: 98: Hoare triple {52467#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {52468#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:59,675 INFO L273 TraceCheckUtils]: 99: Hoare triple {52468#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52468#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:59,675 INFO L273 TraceCheckUtils]: 100: Hoare triple {52468#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52468#(<= main_~i~0 31)} is VALID [2018-11-23 11:57:59,676 INFO L273 TraceCheckUtils]: 101: Hoare triple {52468#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {52469#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:59,676 INFO L273 TraceCheckUtils]: 102: Hoare triple {52469#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52469#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:59,676 INFO L273 TraceCheckUtils]: 103: Hoare triple {52469#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52469#(<= main_~i~0 32)} is VALID [2018-11-23 11:57:59,677 INFO L273 TraceCheckUtils]: 104: Hoare triple {52469#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {52470#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:59,678 INFO L273 TraceCheckUtils]: 105: Hoare triple {52470#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52470#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:59,678 INFO L273 TraceCheckUtils]: 106: Hoare triple {52470#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52470#(<= main_~i~0 33)} is VALID [2018-11-23 11:57:59,679 INFO L273 TraceCheckUtils]: 107: Hoare triple {52470#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {52471#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:59,679 INFO L273 TraceCheckUtils]: 108: Hoare triple {52471#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52471#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:59,680 INFO L273 TraceCheckUtils]: 109: Hoare triple {52471#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52471#(<= main_~i~0 34)} is VALID [2018-11-23 11:57:59,680 INFO L273 TraceCheckUtils]: 110: Hoare triple {52471#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {52472#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:59,681 INFO L273 TraceCheckUtils]: 111: Hoare triple {52472#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52472#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:59,681 INFO L273 TraceCheckUtils]: 112: Hoare triple {52472#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52472#(<= main_~i~0 35)} is VALID [2018-11-23 11:57:59,682 INFO L273 TraceCheckUtils]: 113: Hoare triple {52472#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {52473#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:59,682 INFO L273 TraceCheckUtils]: 114: Hoare triple {52473#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52473#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:59,683 INFO L273 TraceCheckUtils]: 115: Hoare triple {52473#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52473#(<= main_~i~0 36)} is VALID [2018-11-23 11:57:59,684 INFO L273 TraceCheckUtils]: 116: Hoare triple {52473#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {52474#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:59,684 INFO L273 TraceCheckUtils]: 117: Hoare triple {52474#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52474#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:59,685 INFO L273 TraceCheckUtils]: 118: Hoare triple {52474#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52474#(<= main_~i~0 37)} is VALID [2018-11-23 11:57:59,685 INFO L273 TraceCheckUtils]: 119: Hoare triple {52474#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {52475#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:59,686 INFO L273 TraceCheckUtils]: 120: Hoare triple {52475#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52475#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:59,686 INFO L273 TraceCheckUtils]: 121: Hoare triple {52475#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52475#(<= main_~i~0 38)} is VALID [2018-11-23 11:57:59,687 INFO L273 TraceCheckUtils]: 122: Hoare triple {52475#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {52476#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:59,687 INFO L273 TraceCheckUtils]: 123: Hoare triple {52476#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52476#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:59,688 INFO L273 TraceCheckUtils]: 124: Hoare triple {52476#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52476#(<= main_~i~0 39)} is VALID [2018-11-23 11:57:59,688 INFO L273 TraceCheckUtils]: 125: Hoare triple {52476#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {52477#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:59,689 INFO L273 TraceCheckUtils]: 126: Hoare triple {52477#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52477#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:59,689 INFO L273 TraceCheckUtils]: 127: Hoare triple {52477#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52477#(<= main_~i~0 40)} is VALID [2018-11-23 11:57:59,690 INFO L273 TraceCheckUtils]: 128: Hoare triple {52477#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {52478#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:59,690 INFO L273 TraceCheckUtils]: 129: Hoare triple {52478#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52478#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:59,691 INFO L273 TraceCheckUtils]: 130: Hoare triple {52478#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52478#(<= main_~i~0 41)} is VALID [2018-11-23 11:57:59,692 INFO L273 TraceCheckUtils]: 131: Hoare triple {52478#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {52479#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:59,692 INFO L273 TraceCheckUtils]: 132: Hoare triple {52479#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52479#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:59,692 INFO L273 TraceCheckUtils]: 133: Hoare triple {52479#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52479#(<= main_~i~0 42)} is VALID [2018-11-23 11:57:59,693 INFO L273 TraceCheckUtils]: 134: Hoare triple {52479#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {52480#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:59,694 INFO L273 TraceCheckUtils]: 135: Hoare triple {52480#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52480#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:59,694 INFO L273 TraceCheckUtils]: 136: Hoare triple {52480#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52480#(<= main_~i~0 43)} is VALID [2018-11-23 11:57:59,695 INFO L273 TraceCheckUtils]: 137: Hoare triple {52480#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {52481#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:59,695 INFO L273 TraceCheckUtils]: 138: Hoare triple {52481#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52481#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:59,696 INFO L273 TraceCheckUtils]: 139: Hoare triple {52481#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52481#(<= main_~i~0 44)} is VALID [2018-11-23 11:57:59,696 INFO L273 TraceCheckUtils]: 140: Hoare triple {52481#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {52482#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:59,697 INFO L273 TraceCheckUtils]: 141: Hoare triple {52482#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52482#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:59,697 INFO L273 TraceCheckUtils]: 142: Hoare triple {52482#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52482#(<= main_~i~0 45)} is VALID [2018-11-23 11:57:59,698 INFO L273 TraceCheckUtils]: 143: Hoare triple {52482#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {52483#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:59,698 INFO L273 TraceCheckUtils]: 144: Hoare triple {52483#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52483#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:59,699 INFO L273 TraceCheckUtils]: 145: Hoare triple {52483#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52483#(<= main_~i~0 46)} is VALID [2018-11-23 11:57:59,700 INFO L273 TraceCheckUtils]: 146: Hoare triple {52483#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {52484#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:59,700 INFO L273 TraceCheckUtils]: 147: Hoare triple {52484#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52484#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:59,700 INFO L273 TraceCheckUtils]: 148: Hoare triple {52484#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52484#(<= main_~i~0 47)} is VALID [2018-11-23 11:57:59,701 INFO L273 TraceCheckUtils]: 149: Hoare triple {52484#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {52485#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:59,702 INFO L273 TraceCheckUtils]: 150: Hoare triple {52485#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52485#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:59,702 INFO L273 TraceCheckUtils]: 151: Hoare triple {52485#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52485#(<= main_~i~0 48)} is VALID [2018-11-23 11:57:59,703 INFO L273 TraceCheckUtils]: 152: Hoare triple {52485#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {52486#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:59,703 INFO L273 TraceCheckUtils]: 153: Hoare triple {52486#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52486#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:59,704 INFO L273 TraceCheckUtils]: 154: Hoare triple {52486#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52486#(<= main_~i~0 49)} is VALID [2018-11-23 11:57:59,704 INFO L273 TraceCheckUtils]: 155: Hoare triple {52486#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {52487#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:59,705 INFO L273 TraceCheckUtils]: 156: Hoare triple {52487#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52487#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:59,705 INFO L273 TraceCheckUtils]: 157: Hoare triple {52487#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52487#(<= main_~i~0 50)} is VALID [2018-11-23 11:57:59,706 INFO L273 TraceCheckUtils]: 158: Hoare triple {52487#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {52488#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:59,706 INFO L273 TraceCheckUtils]: 159: Hoare triple {52488#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52488#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:59,707 INFO L273 TraceCheckUtils]: 160: Hoare triple {52488#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52488#(<= main_~i~0 51)} is VALID [2018-11-23 11:57:59,708 INFO L273 TraceCheckUtils]: 161: Hoare triple {52488#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {52489#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:59,708 INFO L273 TraceCheckUtils]: 162: Hoare triple {52489#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52489#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:59,708 INFO L273 TraceCheckUtils]: 163: Hoare triple {52489#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52489#(<= main_~i~0 52)} is VALID [2018-11-23 11:57:59,709 INFO L273 TraceCheckUtils]: 164: Hoare triple {52489#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {52490#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:59,710 INFO L273 TraceCheckUtils]: 165: Hoare triple {52490#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52490#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:59,710 INFO L273 TraceCheckUtils]: 166: Hoare triple {52490#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52490#(<= main_~i~0 53)} is VALID [2018-11-23 11:57:59,711 INFO L273 TraceCheckUtils]: 167: Hoare triple {52490#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {52491#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:59,711 INFO L273 TraceCheckUtils]: 168: Hoare triple {52491#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52491#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:59,712 INFO L273 TraceCheckUtils]: 169: Hoare triple {52491#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52491#(<= main_~i~0 54)} is VALID [2018-11-23 11:57:59,712 INFO L273 TraceCheckUtils]: 170: Hoare triple {52491#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {52492#(<= main_~i~0 55)} is VALID [2018-11-23 11:57:59,713 INFO L273 TraceCheckUtils]: 171: Hoare triple {52492#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52492#(<= main_~i~0 55)} is VALID [2018-11-23 11:57:59,713 INFO L273 TraceCheckUtils]: 172: Hoare triple {52492#(<= main_~i~0 55)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52492#(<= main_~i~0 55)} is VALID [2018-11-23 11:57:59,714 INFO L273 TraceCheckUtils]: 173: Hoare triple {52492#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {52493#(<= main_~i~0 56)} is VALID [2018-11-23 11:57:59,714 INFO L273 TraceCheckUtils]: 174: Hoare triple {52493#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52493#(<= main_~i~0 56)} is VALID [2018-11-23 11:57:59,715 INFO L273 TraceCheckUtils]: 175: Hoare triple {52493#(<= main_~i~0 56)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52493#(<= main_~i~0 56)} is VALID [2018-11-23 11:57:59,715 INFO L273 TraceCheckUtils]: 176: Hoare triple {52493#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {52494#(<= main_~i~0 57)} is VALID [2018-11-23 11:57:59,716 INFO L273 TraceCheckUtils]: 177: Hoare triple {52494#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52494#(<= main_~i~0 57)} is VALID [2018-11-23 11:57:59,716 INFO L273 TraceCheckUtils]: 178: Hoare triple {52494#(<= main_~i~0 57)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52494#(<= main_~i~0 57)} is VALID [2018-11-23 11:57:59,717 INFO L273 TraceCheckUtils]: 179: Hoare triple {52494#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {52495#(<= main_~i~0 58)} is VALID [2018-11-23 11:57:59,718 INFO L273 TraceCheckUtils]: 180: Hoare triple {52495#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52495#(<= main_~i~0 58)} is VALID [2018-11-23 11:57:59,718 INFO L273 TraceCheckUtils]: 181: Hoare triple {52495#(<= main_~i~0 58)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52495#(<= main_~i~0 58)} is VALID [2018-11-23 11:57:59,719 INFO L273 TraceCheckUtils]: 182: Hoare triple {52495#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {52496#(<= main_~i~0 59)} is VALID [2018-11-23 11:57:59,719 INFO L273 TraceCheckUtils]: 183: Hoare triple {52496#(<= main_~i~0 59)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52496#(<= main_~i~0 59)} is VALID [2018-11-23 11:57:59,720 INFO L273 TraceCheckUtils]: 184: Hoare triple {52496#(<= main_~i~0 59)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52496#(<= main_~i~0 59)} is VALID [2018-11-23 11:57:59,720 INFO L273 TraceCheckUtils]: 185: Hoare triple {52496#(<= main_~i~0 59)} ~i~0 := 1 + ~i~0; {52497#(<= main_~i~0 60)} is VALID [2018-11-23 11:57:59,721 INFO L273 TraceCheckUtils]: 186: Hoare triple {52497#(<= main_~i~0 60)} assume !(~i~0 < 100000); {52436#false} is VALID [2018-11-23 11:57:59,721 INFO L273 TraceCheckUtils]: 187: Hoare triple {52436#false} havoc ~x~0;~x~0 := 0; {52436#false} is VALID [2018-11-23 11:57:59,721 INFO L273 TraceCheckUtils]: 188: Hoare triple {52436#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {52436#false} is VALID [2018-11-23 11:57:59,721 INFO L256 TraceCheckUtils]: 189: Hoare triple {52436#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {52436#false} is VALID [2018-11-23 11:57:59,722 INFO L273 TraceCheckUtils]: 190: Hoare triple {52436#false} ~cond := #in~cond; {52436#false} is VALID [2018-11-23 11:57:59,722 INFO L273 TraceCheckUtils]: 191: Hoare triple {52436#false} assume 0 == ~cond; {52436#false} is VALID [2018-11-23 11:57:59,722 INFO L273 TraceCheckUtils]: 192: Hoare triple {52436#false} assume !false; {52436#false} is VALID [2018-11-23 11:57:59,747 INFO L134 CoverageAnalysis]: Checked inductivity of 5370 backedges. 0 proven. 5370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:59,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:59,747 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:59,756 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:57:59,926 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-11-23 11:57:59,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:57:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:59,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:00,336 INFO L256 TraceCheckUtils]: 0: Hoare triple {52435#true} call ULTIMATE.init(); {52435#true} is VALID [2018-11-23 11:58:00,336 INFO L273 TraceCheckUtils]: 1: Hoare triple {52435#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {52435#true} is VALID [2018-11-23 11:58:00,336 INFO L273 TraceCheckUtils]: 2: Hoare triple {52435#true} assume true; {52435#true} is VALID [2018-11-23 11:58:00,337 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {52435#true} {52435#true} #55#return; {52435#true} is VALID [2018-11-23 11:58:00,337 INFO L256 TraceCheckUtils]: 4: Hoare triple {52435#true} call #t~ret4 := main(); {52435#true} is VALID [2018-11-23 11:58:00,337 INFO L273 TraceCheckUtils]: 5: Hoare triple {52435#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {52516#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:00,338 INFO L273 TraceCheckUtils]: 6: Hoare triple {52516#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52516#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:00,338 INFO L273 TraceCheckUtils]: 7: Hoare triple {52516#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52516#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:00,339 INFO L273 TraceCheckUtils]: 8: Hoare triple {52516#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {52438#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:00,339 INFO L273 TraceCheckUtils]: 9: Hoare triple {52438#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52438#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:00,340 INFO L273 TraceCheckUtils]: 10: Hoare triple {52438#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52438#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:00,340 INFO L273 TraceCheckUtils]: 11: Hoare triple {52438#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {52439#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:00,340 INFO L273 TraceCheckUtils]: 12: Hoare triple {52439#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52439#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:00,341 INFO L273 TraceCheckUtils]: 13: Hoare triple {52439#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52439#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:00,341 INFO L273 TraceCheckUtils]: 14: Hoare triple {52439#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {52440#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:00,342 INFO L273 TraceCheckUtils]: 15: Hoare triple {52440#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52440#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:00,342 INFO L273 TraceCheckUtils]: 16: Hoare triple {52440#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52440#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:00,343 INFO L273 TraceCheckUtils]: 17: Hoare triple {52440#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {52441#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:00,344 INFO L273 TraceCheckUtils]: 18: Hoare triple {52441#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52441#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:00,344 INFO L273 TraceCheckUtils]: 19: Hoare triple {52441#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52441#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:00,345 INFO L273 TraceCheckUtils]: 20: Hoare triple {52441#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {52442#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:00,345 INFO L273 TraceCheckUtils]: 21: Hoare triple {52442#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52442#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:00,346 INFO L273 TraceCheckUtils]: 22: Hoare triple {52442#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52442#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:00,346 INFO L273 TraceCheckUtils]: 23: Hoare triple {52442#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {52443#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:00,347 INFO L273 TraceCheckUtils]: 24: Hoare triple {52443#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52443#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:00,348 INFO L273 TraceCheckUtils]: 25: Hoare triple {52443#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52443#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:00,348 INFO L273 TraceCheckUtils]: 26: Hoare triple {52443#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {52444#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:00,349 INFO L273 TraceCheckUtils]: 27: Hoare triple {52444#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52444#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:00,349 INFO L273 TraceCheckUtils]: 28: Hoare triple {52444#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52444#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:00,350 INFO L273 TraceCheckUtils]: 29: Hoare triple {52444#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {52445#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:00,350 INFO L273 TraceCheckUtils]: 30: Hoare triple {52445#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52445#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:00,351 INFO L273 TraceCheckUtils]: 31: Hoare triple {52445#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52445#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:00,352 INFO L273 TraceCheckUtils]: 32: Hoare triple {52445#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {52446#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:00,352 INFO L273 TraceCheckUtils]: 33: Hoare triple {52446#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52446#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:00,353 INFO L273 TraceCheckUtils]: 34: Hoare triple {52446#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52446#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:00,353 INFO L273 TraceCheckUtils]: 35: Hoare triple {52446#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {52447#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:00,354 INFO L273 TraceCheckUtils]: 36: Hoare triple {52447#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52447#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:00,354 INFO L273 TraceCheckUtils]: 37: Hoare triple {52447#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52447#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:00,355 INFO L273 TraceCheckUtils]: 38: Hoare triple {52447#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {52448#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:00,356 INFO L273 TraceCheckUtils]: 39: Hoare triple {52448#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52448#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:00,356 INFO L273 TraceCheckUtils]: 40: Hoare triple {52448#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52448#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:00,357 INFO L273 TraceCheckUtils]: 41: Hoare triple {52448#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {52449#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:00,357 INFO L273 TraceCheckUtils]: 42: Hoare triple {52449#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52449#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:00,358 INFO L273 TraceCheckUtils]: 43: Hoare triple {52449#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52449#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:00,359 INFO L273 TraceCheckUtils]: 44: Hoare triple {52449#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {52450#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:00,359 INFO L273 TraceCheckUtils]: 45: Hoare triple {52450#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52450#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:00,360 INFO L273 TraceCheckUtils]: 46: Hoare triple {52450#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52450#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:00,360 INFO L273 TraceCheckUtils]: 47: Hoare triple {52450#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {52451#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:00,361 INFO L273 TraceCheckUtils]: 48: Hoare triple {52451#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52451#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:00,361 INFO L273 TraceCheckUtils]: 49: Hoare triple {52451#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52451#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:00,362 INFO L273 TraceCheckUtils]: 50: Hoare triple {52451#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {52452#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:00,363 INFO L273 TraceCheckUtils]: 51: Hoare triple {52452#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52452#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:00,363 INFO L273 TraceCheckUtils]: 52: Hoare triple {52452#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52452#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:00,364 INFO L273 TraceCheckUtils]: 53: Hoare triple {52452#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {52453#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:00,364 INFO L273 TraceCheckUtils]: 54: Hoare triple {52453#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52453#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:00,365 INFO L273 TraceCheckUtils]: 55: Hoare triple {52453#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52453#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:00,365 INFO L273 TraceCheckUtils]: 56: Hoare triple {52453#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {52454#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:00,366 INFO L273 TraceCheckUtils]: 57: Hoare triple {52454#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52454#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:00,366 INFO L273 TraceCheckUtils]: 58: Hoare triple {52454#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52454#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:00,367 INFO L273 TraceCheckUtils]: 59: Hoare triple {52454#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {52455#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:00,368 INFO L273 TraceCheckUtils]: 60: Hoare triple {52455#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52455#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:00,368 INFO L273 TraceCheckUtils]: 61: Hoare triple {52455#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52455#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:00,369 INFO L273 TraceCheckUtils]: 62: Hoare triple {52455#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {52456#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:00,369 INFO L273 TraceCheckUtils]: 63: Hoare triple {52456#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52456#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:00,370 INFO L273 TraceCheckUtils]: 64: Hoare triple {52456#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52456#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:00,371 INFO L273 TraceCheckUtils]: 65: Hoare triple {52456#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {52457#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:00,371 INFO L273 TraceCheckUtils]: 66: Hoare triple {52457#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52457#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:00,372 INFO L273 TraceCheckUtils]: 67: Hoare triple {52457#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52457#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:00,372 INFO L273 TraceCheckUtils]: 68: Hoare triple {52457#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {52458#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:00,373 INFO L273 TraceCheckUtils]: 69: Hoare triple {52458#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52458#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:00,373 INFO L273 TraceCheckUtils]: 70: Hoare triple {52458#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52458#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:00,374 INFO L273 TraceCheckUtils]: 71: Hoare triple {52458#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {52459#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:00,375 INFO L273 TraceCheckUtils]: 72: Hoare triple {52459#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52459#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:00,375 INFO L273 TraceCheckUtils]: 73: Hoare triple {52459#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52459#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:00,376 INFO L273 TraceCheckUtils]: 74: Hoare triple {52459#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {52460#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:00,376 INFO L273 TraceCheckUtils]: 75: Hoare triple {52460#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52460#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:00,377 INFO L273 TraceCheckUtils]: 76: Hoare triple {52460#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52460#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:00,378 INFO L273 TraceCheckUtils]: 77: Hoare triple {52460#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {52461#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:00,378 INFO L273 TraceCheckUtils]: 78: Hoare triple {52461#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52461#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:00,379 INFO L273 TraceCheckUtils]: 79: Hoare triple {52461#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52461#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:00,379 INFO L273 TraceCheckUtils]: 80: Hoare triple {52461#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {52462#(<= main_~i~0 25)} is VALID [2018-11-23 11:58:00,380 INFO L273 TraceCheckUtils]: 81: Hoare triple {52462#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52462#(<= main_~i~0 25)} is VALID [2018-11-23 11:58:00,380 INFO L273 TraceCheckUtils]: 82: Hoare triple {52462#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52462#(<= main_~i~0 25)} is VALID [2018-11-23 11:58:00,381 INFO L273 TraceCheckUtils]: 83: Hoare triple {52462#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {52463#(<= main_~i~0 26)} is VALID [2018-11-23 11:58:00,382 INFO L273 TraceCheckUtils]: 84: Hoare triple {52463#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52463#(<= main_~i~0 26)} is VALID [2018-11-23 11:58:00,382 INFO L273 TraceCheckUtils]: 85: Hoare triple {52463#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52463#(<= main_~i~0 26)} is VALID [2018-11-23 11:58:00,383 INFO L273 TraceCheckUtils]: 86: Hoare triple {52463#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {52464#(<= main_~i~0 27)} is VALID [2018-11-23 11:58:00,383 INFO L273 TraceCheckUtils]: 87: Hoare triple {52464#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52464#(<= main_~i~0 27)} is VALID [2018-11-23 11:58:00,384 INFO L273 TraceCheckUtils]: 88: Hoare triple {52464#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52464#(<= main_~i~0 27)} is VALID [2018-11-23 11:58:00,384 INFO L273 TraceCheckUtils]: 89: Hoare triple {52464#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {52465#(<= main_~i~0 28)} is VALID [2018-11-23 11:58:00,385 INFO L273 TraceCheckUtils]: 90: Hoare triple {52465#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52465#(<= main_~i~0 28)} is VALID [2018-11-23 11:58:00,385 INFO L273 TraceCheckUtils]: 91: Hoare triple {52465#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52465#(<= main_~i~0 28)} is VALID [2018-11-23 11:58:00,386 INFO L273 TraceCheckUtils]: 92: Hoare triple {52465#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {52466#(<= main_~i~0 29)} is VALID [2018-11-23 11:58:00,387 INFO L273 TraceCheckUtils]: 93: Hoare triple {52466#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52466#(<= main_~i~0 29)} is VALID [2018-11-23 11:58:00,387 INFO L273 TraceCheckUtils]: 94: Hoare triple {52466#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52466#(<= main_~i~0 29)} is VALID [2018-11-23 11:58:00,388 INFO L273 TraceCheckUtils]: 95: Hoare triple {52466#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {52467#(<= main_~i~0 30)} is VALID [2018-11-23 11:58:00,388 INFO L273 TraceCheckUtils]: 96: Hoare triple {52467#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52467#(<= main_~i~0 30)} is VALID [2018-11-23 11:58:00,389 INFO L273 TraceCheckUtils]: 97: Hoare triple {52467#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52467#(<= main_~i~0 30)} is VALID [2018-11-23 11:58:00,390 INFO L273 TraceCheckUtils]: 98: Hoare triple {52467#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {52468#(<= main_~i~0 31)} is VALID [2018-11-23 11:58:00,390 INFO L273 TraceCheckUtils]: 99: Hoare triple {52468#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52468#(<= main_~i~0 31)} is VALID [2018-11-23 11:58:00,391 INFO L273 TraceCheckUtils]: 100: Hoare triple {52468#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52468#(<= main_~i~0 31)} is VALID [2018-11-23 11:58:00,391 INFO L273 TraceCheckUtils]: 101: Hoare triple {52468#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {52469#(<= main_~i~0 32)} is VALID [2018-11-23 11:58:00,392 INFO L273 TraceCheckUtils]: 102: Hoare triple {52469#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52469#(<= main_~i~0 32)} is VALID [2018-11-23 11:58:00,392 INFO L273 TraceCheckUtils]: 103: Hoare triple {52469#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52469#(<= main_~i~0 32)} is VALID [2018-11-23 11:58:00,393 INFO L273 TraceCheckUtils]: 104: Hoare triple {52469#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {52470#(<= main_~i~0 33)} is VALID [2018-11-23 11:58:00,393 INFO L273 TraceCheckUtils]: 105: Hoare triple {52470#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52470#(<= main_~i~0 33)} is VALID [2018-11-23 11:58:00,394 INFO L273 TraceCheckUtils]: 106: Hoare triple {52470#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52470#(<= main_~i~0 33)} is VALID [2018-11-23 11:58:00,395 INFO L273 TraceCheckUtils]: 107: Hoare triple {52470#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {52471#(<= main_~i~0 34)} is VALID [2018-11-23 11:58:00,395 INFO L273 TraceCheckUtils]: 108: Hoare triple {52471#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52471#(<= main_~i~0 34)} is VALID [2018-11-23 11:58:00,396 INFO L273 TraceCheckUtils]: 109: Hoare triple {52471#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52471#(<= main_~i~0 34)} is VALID [2018-11-23 11:58:00,396 INFO L273 TraceCheckUtils]: 110: Hoare triple {52471#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {52472#(<= main_~i~0 35)} is VALID [2018-11-23 11:58:00,397 INFO L273 TraceCheckUtils]: 111: Hoare triple {52472#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52472#(<= main_~i~0 35)} is VALID [2018-11-23 11:58:00,397 INFO L273 TraceCheckUtils]: 112: Hoare triple {52472#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52472#(<= main_~i~0 35)} is VALID [2018-11-23 11:58:00,398 INFO L273 TraceCheckUtils]: 113: Hoare triple {52472#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {52473#(<= main_~i~0 36)} is VALID [2018-11-23 11:58:00,399 INFO L273 TraceCheckUtils]: 114: Hoare triple {52473#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52473#(<= main_~i~0 36)} is VALID [2018-11-23 11:58:00,399 INFO L273 TraceCheckUtils]: 115: Hoare triple {52473#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52473#(<= main_~i~0 36)} is VALID [2018-11-23 11:58:00,400 INFO L273 TraceCheckUtils]: 116: Hoare triple {52473#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {52474#(<= main_~i~0 37)} is VALID [2018-11-23 11:58:00,400 INFO L273 TraceCheckUtils]: 117: Hoare triple {52474#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52474#(<= main_~i~0 37)} is VALID [2018-11-23 11:58:00,401 INFO L273 TraceCheckUtils]: 118: Hoare triple {52474#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52474#(<= main_~i~0 37)} is VALID [2018-11-23 11:58:00,402 INFO L273 TraceCheckUtils]: 119: Hoare triple {52474#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {52475#(<= main_~i~0 38)} is VALID [2018-11-23 11:58:00,402 INFO L273 TraceCheckUtils]: 120: Hoare triple {52475#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52475#(<= main_~i~0 38)} is VALID [2018-11-23 11:58:00,403 INFO L273 TraceCheckUtils]: 121: Hoare triple {52475#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52475#(<= main_~i~0 38)} is VALID [2018-11-23 11:58:00,403 INFO L273 TraceCheckUtils]: 122: Hoare triple {52475#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {52476#(<= main_~i~0 39)} is VALID [2018-11-23 11:58:00,404 INFO L273 TraceCheckUtils]: 123: Hoare triple {52476#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52476#(<= main_~i~0 39)} is VALID [2018-11-23 11:58:00,404 INFO L273 TraceCheckUtils]: 124: Hoare triple {52476#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52476#(<= main_~i~0 39)} is VALID [2018-11-23 11:58:00,405 INFO L273 TraceCheckUtils]: 125: Hoare triple {52476#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {52477#(<= main_~i~0 40)} is VALID [2018-11-23 11:58:00,405 INFO L273 TraceCheckUtils]: 126: Hoare triple {52477#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52477#(<= main_~i~0 40)} is VALID [2018-11-23 11:58:00,406 INFO L273 TraceCheckUtils]: 127: Hoare triple {52477#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52477#(<= main_~i~0 40)} is VALID [2018-11-23 11:58:00,407 INFO L273 TraceCheckUtils]: 128: Hoare triple {52477#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {52478#(<= main_~i~0 41)} is VALID [2018-11-23 11:58:00,407 INFO L273 TraceCheckUtils]: 129: Hoare triple {52478#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52478#(<= main_~i~0 41)} is VALID [2018-11-23 11:58:00,408 INFO L273 TraceCheckUtils]: 130: Hoare triple {52478#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52478#(<= main_~i~0 41)} is VALID [2018-11-23 11:58:00,408 INFO L273 TraceCheckUtils]: 131: Hoare triple {52478#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {52479#(<= main_~i~0 42)} is VALID [2018-11-23 11:58:00,409 INFO L273 TraceCheckUtils]: 132: Hoare triple {52479#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52479#(<= main_~i~0 42)} is VALID [2018-11-23 11:58:00,409 INFO L273 TraceCheckUtils]: 133: Hoare triple {52479#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52479#(<= main_~i~0 42)} is VALID [2018-11-23 11:58:00,410 INFO L273 TraceCheckUtils]: 134: Hoare triple {52479#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {52480#(<= main_~i~0 43)} is VALID [2018-11-23 11:58:00,411 INFO L273 TraceCheckUtils]: 135: Hoare triple {52480#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52480#(<= main_~i~0 43)} is VALID [2018-11-23 11:58:00,411 INFO L273 TraceCheckUtils]: 136: Hoare triple {52480#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52480#(<= main_~i~0 43)} is VALID [2018-11-23 11:58:00,412 INFO L273 TraceCheckUtils]: 137: Hoare triple {52480#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {52481#(<= main_~i~0 44)} is VALID [2018-11-23 11:58:00,412 INFO L273 TraceCheckUtils]: 138: Hoare triple {52481#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52481#(<= main_~i~0 44)} is VALID [2018-11-23 11:58:00,413 INFO L273 TraceCheckUtils]: 139: Hoare triple {52481#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52481#(<= main_~i~0 44)} is VALID [2018-11-23 11:58:00,413 INFO L273 TraceCheckUtils]: 140: Hoare triple {52481#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {52482#(<= main_~i~0 45)} is VALID [2018-11-23 11:58:00,414 INFO L273 TraceCheckUtils]: 141: Hoare triple {52482#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52482#(<= main_~i~0 45)} is VALID [2018-11-23 11:58:00,414 INFO L273 TraceCheckUtils]: 142: Hoare triple {52482#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52482#(<= main_~i~0 45)} is VALID [2018-11-23 11:58:00,415 INFO L273 TraceCheckUtils]: 143: Hoare triple {52482#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {52483#(<= main_~i~0 46)} is VALID [2018-11-23 11:58:00,416 INFO L273 TraceCheckUtils]: 144: Hoare triple {52483#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52483#(<= main_~i~0 46)} is VALID [2018-11-23 11:58:00,416 INFO L273 TraceCheckUtils]: 145: Hoare triple {52483#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52483#(<= main_~i~0 46)} is VALID [2018-11-23 11:58:00,417 INFO L273 TraceCheckUtils]: 146: Hoare triple {52483#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {52484#(<= main_~i~0 47)} is VALID [2018-11-23 11:58:00,417 INFO L273 TraceCheckUtils]: 147: Hoare triple {52484#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52484#(<= main_~i~0 47)} is VALID [2018-11-23 11:58:00,418 INFO L273 TraceCheckUtils]: 148: Hoare triple {52484#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52484#(<= main_~i~0 47)} is VALID [2018-11-23 11:58:00,419 INFO L273 TraceCheckUtils]: 149: Hoare triple {52484#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {52485#(<= main_~i~0 48)} is VALID [2018-11-23 11:58:00,419 INFO L273 TraceCheckUtils]: 150: Hoare triple {52485#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52485#(<= main_~i~0 48)} is VALID [2018-11-23 11:58:00,420 INFO L273 TraceCheckUtils]: 151: Hoare triple {52485#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52485#(<= main_~i~0 48)} is VALID [2018-11-23 11:58:00,420 INFO L273 TraceCheckUtils]: 152: Hoare triple {52485#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {52486#(<= main_~i~0 49)} is VALID [2018-11-23 11:58:00,421 INFO L273 TraceCheckUtils]: 153: Hoare triple {52486#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52486#(<= main_~i~0 49)} is VALID [2018-11-23 11:58:00,421 INFO L273 TraceCheckUtils]: 154: Hoare triple {52486#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52486#(<= main_~i~0 49)} is VALID [2018-11-23 11:58:00,422 INFO L273 TraceCheckUtils]: 155: Hoare triple {52486#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {52487#(<= main_~i~0 50)} is VALID [2018-11-23 11:58:00,423 INFO L273 TraceCheckUtils]: 156: Hoare triple {52487#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52487#(<= main_~i~0 50)} is VALID [2018-11-23 11:58:00,423 INFO L273 TraceCheckUtils]: 157: Hoare triple {52487#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52487#(<= main_~i~0 50)} is VALID [2018-11-23 11:58:00,424 INFO L273 TraceCheckUtils]: 158: Hoare triple {52487#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {52488#(<= main_~i~0 51)} is VALID [2018-11-23 11:58:00,424 INFO L273 TraceCheckUtils]: 159: Hoare triple {52488#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52488#(<= main_~i~0 51)} is VALID [2018-11-23 11:58:00,425 INFO L273 TraceCheckUtils]: 160: Hoare triple {52488#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52488#(<= main_~i~0 51)} is VALID [2018-11-23 11:58:00,425 INFO L273 TraceCheckUtils]: 161: Hoare triple {52488#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {52489#(<= main_~i~0 52)} is VALID [2018-11-23 11:58:00,426 INFO L273 TraceCheckUtils]: 162: Hoare triple {52489#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52489#(<= main_~i~0 52)} is VALID [2018-11-23 11:58:00,426 INFO L273 TraceCheckUtils]: 163: Hoare triple {52489#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52489#(<= main_~i~0 52)} is VALID [2018-11-23 11:58:00,427 INFO L273 TraceCheckUtils]: 164: Hoare triple {52489#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {52490#(<= main_~i~0 53)} is VALID [2018-11-23 11:58:00,428 INFO L273 TraceCheckUtils]: 165: Hoare triple {52490#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52490#(<= main_~i~0 53)} is VALID [2018-11-23 11:58:00,428 INFO L273 TraceCheckUtils]: 166: Hoare triple {52490#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52490#(<= main_~i~0 53)} is VALID [2018-11-23 11:58:00,429 INFO L273 TraceCheckUtils]: 167: Hoare triple {52490#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {52491#(<= main_~i~0 54)} is VALID [2018-11-23 11:58:00,429 INFO L273 TraceCheckUtils]: 168: Hoare triple {52491#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52491#(<= main_~i~0 54)} is VALID [2018-11-23 11:58:00,430 INFO L273 TraceCheckUtils]: 169: Hoare triple {52491#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52491#(<= main_~i~0 54)} is VALID [2018-11-23 11:58:00,431 INFO L273 TraceCheckUtils]: 170: Hoare triple {52491#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {52492#(<= main_~i~0 55)} is VALID [2018-11-23 11:58:00,431 INFO L273 TraceCheckUtils]: 171: Hoare triple {52492#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52492#(<= main_~i~0 55)} is VALID [2018-11-23 11:58:00,431 INFO L273 TraceCheckUtils]: 172: Hoare triple {52492#(<= main_~i~0 55)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52492#(<= main_~i~0 55)} is VALID [2018-11-23 11:58:00,432 INFO L273 TraceCheckUtils]: 173: Hoare triple {52492#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {52493#(<= main_~i~0 56)} is VALID [2018-11-23 11:58:00,433 INFO L273 TraceCheckUtils]: 174: Hoare triple {52493#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52493#(<= main_~i~0 56)} is VALID [2018-11-23 11:58:00,433 INFO L273 TraceCheckUtils]: 175: Hoare triple {52493#(<= main_~i~0 56)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52493#(<= main_~i~0 56)} is VALID [2018-11-23 11:58:00,434 INFO L273 TraceCheckUtils]: 176: Hoare triple {52493#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {52494#(<= main_~i~0 57)} is VALID [2018-11-23 11:58:00,434 INFO L273 TraceCheckUtils]: 177: Hoare triple {52494#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52494#(<= main_~i~0 57)} is VALID [2018-11-23 11:58:00,435 INFO L273 TraceCheckUtils]: 178: Hoare triple {52494#(<= main_~i~0 57)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52494#(<= main_~i~0 57)} is VALID [2018-11-23 11:58:00,436 INFO L273 TraceCheckUtils]: 179: Hoare triple {52494#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {52495#(<= main_~i~0 58)} is VALID [2018-11-23 11:58:00,436 INFO L273 TraceCheckUtils]: 180: Hoare triple {52495#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52495#(<= main_~i~0 58)} is VALID [2018-11-23 11:58:00,437 INFO L273 TraceCheckUtils]: 181: Hoare triple {52495#(<= main_~i~0 58)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52495#(<= main_~i~0 58)} is VALID [2018-11-23 11:58:00,437 INFO L273 TraceCheckUtils]: 182: Hoare triple {52495#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {52496#(<= main_~i~0 59)} is VALID [2018-11-23 11:58:00,438 INFO L273 TraceCheckUtils]: 183: Hoare triple {52496#(<= main_~i~0 59)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {52496#(<= main_~i~0 59)} is VALID [2018-11-23 11:58:00,438 INFO L273 TraceCheckUtils]: 184: Hoare triple {52496#(<= main_~i~0 59)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {52496#(<= main_~i~0 59)} is VALID [2018-11-23 11:58:00,439 INFO L273 TraceCheckUtils]: 185: Hoare triple {52496#(<= main_~i~0 59)} ~i~0 := 1 + ~i~0; {52497#(<= main_~i~0 60)} is VALID [2018-11-23 11:58:00,440 INFO L273 TraceCheckUtils]: 186: Hoare triple {52497#(<= main_~i~0 60)} assume !(~i~0 < 100000); {52436#false} is VALID [2018-11-23 11:58:00,440 INFO L273 TraceCheckUtils]: 187: Hoare triple {52436#false} havoc ~x~0;~x~0 := 0; {52436#false} is VALID [2018-11-23 11:58:00,440 INFO L273 TraceCheckUtils]: 188: Hoare triple {52436#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {52436#false} is VALID [2018-11-23 11:58:00,440 INFO L256 TraceCheckUtils]: 189: Hoare triple {52436#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {52436#false} is VALID [2018-11-23 11:58:00,440 INFO L273 TraceCheckUtils]: 190: Hoare triple {52436#false} ~cond := #in~cond; {52436#false} is VALID [2018-11-23 11:58:00,441 INFO L273 TraceCheckUtils]: 191: Hoare triple {52436#false} assume 0 == ~cond; {52436#false} is VALID [2018-11-23 11:58:00,441 INFO L273 TraceCheckUtils]: 192: Hoare triple {52436#false} assume !false; {52436#false} is VALID [2018-11-23 11:58:00,465 INFO L134 CoverageAnalysis]: Checked inductivity of 5370 backedges. 0 proven. 5370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:00,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:00,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 64 [2018-11-23 11:58:00,485 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 193 [2018-11-23 11:58:00,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:00,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states. [2018-11-23 11:58:00,682 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:00,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-11-23 11:58:00,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-11-23 11:58:00,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-11-23 11:58:00,684 INFO L87 Difference]: Start difference. First operand 198 states and 259 transitions. Second operand 64 states. [2018-11-23 11:58:01,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:01,738 INFO L93 Difference]: Finished difference Result 214 states and 278 transitions. [2018-11-23 11:58:01,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-11-23 11:58:01,738 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 193 [2018-11-23 11:58:01,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:01,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 11:58:01,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 278 transitions. [2018-11-23 11:58:01,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 11:58:01,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 278 transitions. [2018-11-23 11:58:01,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 63 states and 278 transitions. [2018-11-23 11:58:01,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 278 edges. 278 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:01,999 INFO L225 Difference]: With dead ends: 214 [2018-11-23 11:58:01,999 INFO L226 Difference]: Without dead ends: 203 [2018-11-23 11:58:02,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-11-23 11:58:02,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-11-23 11:58:02,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2018-11-23 11:58:02,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:02,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 203 states. Second operand 201 states. [2018-11-23 11:58:02,056 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand 201 states. [2018-11-23 11:58:02,056 INFO L87 Difference]: Start difference. First operand 203 states. Second operand 201 states. [2018-11-23 11:58:02,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:02,060 INFO L93 Difference]: Finished difference Result 203 states and 266 transitions. [2018-11-23 11:58:02,060 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 266 transitions. [2018-11-23 11:58:02,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:02,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:02,061 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand 203 states. [2018-11-23 11:58:02,061 INFO L87 Difference]: Start difference. First operand 201 states. Second operand 203 states. [2018-11-23 11:58:02,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:02,064 INFO L93 Difference]: Finished difference Result 203 states and 266 transitions. [2018-11-23 11:58:02,064 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 266 transitions. [2018-11-23 11:58:02,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:02,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:02,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:02,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:02,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-23 11:58:02,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 263 transitions. [2018-11-23 11:58:02,067 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 263 transitions. Word has length 193 [2018-11-23 11:58:02,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:02,067 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 263 transitions. [2018-11-23 11:58:02,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-11-23 11:58:02,067 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 263 transitions. [2018-11-23 11:58:02,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-23 11:58:02,068 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:02,068 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:02,068 INFO L423 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:02,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:02,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1171090333, now seen corresponding path program 61 times [2018-11-23 11:58:02,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:02,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:02,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:02,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:02,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:03,797 INFO L256 TraceCheckUtils]: 0: Hoare triple {54039#true} call ULTIMATE.init(); {54039#true} is VALID [2018-11-23 11:58:03,798 INFO L273 TraceCheckUtils]: 1: Hoare triple {54039#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {54039#true} is VALID [2018-11-23 11:58:03,798 INFO L273 TraceCheckUtils]: 2: Hoare triple {54039#true} assume true; {54039#true} is VALID [2018-11-23 11:58:03,798 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {54039#true} {54039#true} #55#return; {54039#true} is VALID [2018-11-23 11:58:03,798 INFO L256 TraceCheckUtils]: 4: Hoare triple {54039#true} call #t~ret4 := main(); {54039#true} is VALID [2018-11-23 11:58:03,799 INFO L273 TraceCheckUtils]: 5: Hoare triple {54039#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {54041#(= main_~i~0 0)} is VALID [2018-11-23 11:58:03,799 INFO L273 TraceCheckUtils]: 6: Hoare triple {54041#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54041#(= main_~i~0 0)} is VALID [2018-11-23 11:58:03,800 INFO L273 TraceCheckUtils]: 7: Hoare triple {54041#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54041#(= main_~i~0 0)} is VALID [2018-11-23 11:58:03,800 INFO L273 TraceCheckUtils]: 8: Hoare triple {54041#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {54042#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:03,801 INFO L273 TraceCheckUtils]: 9: Hoare triple {54042#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54042#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:03,801 INFO L273 TraceCheckUtils]: 10: Hoare triple {54042#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54042#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:03,802 INFO L273 TraceCheckUtils]: 11: Hoare triple {54042#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {54043#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:03,802 INFO L273 TraceCheckUtils]: 12: Hoare triple {54043#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54043#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:03,802 INFO L273 TraceCheckUtils]: 13: Hoare triple {54043#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54043#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:03,803 INFO L273 TraceCheckUtils]: 14: Hoare triple {54043#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {54044#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:03,803 INFO L273 TraceCheckUtils]: 15: Hoare triple {54044#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54044#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:03,803 INFO L273 TraceCheckUtils]: 16: Hoare triple {54044#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54044#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:03,804 INFO L273 TraceCheckUtils]: 17: Hoare triple {54044#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {54045#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:03,805 INFO L273 TraceCheckUtils]: 18: Hoare triple {54045#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54045#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:03,805 INFO L273 TraceCheckUtils]: 19: Hoare triple {54045#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54045#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:03,806 INFO L273 TraceCheckUtils]: 20: Hoare triple {54045#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {54046#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:03,806 INFO L273 TraceCheckUtils]: 21: Hoare triple {54046#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54046#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:03,807 INFO L273 TraceCheckUtils]: 22: Hoare triple {54046#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54046#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:03,808 INFO L273 TraceCheckUtils]: 23: Hoare triple {54046#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {54047#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:03,808 INFO L273 TraceCheckUtils]: 24: Hoare triple {54047#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54047#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:03,809 INFO L273 TraceCheckUtils]: 25: Hoare triple {54047#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54047#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:03,809 INFO L273 TraceCheckUtils]: 26: Hoare triple {54047#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {54048#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:03,810 INFO L273 TraceCheckUtils]: 27: Hoare triple {54048#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54048#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:03,810 INFO L273 TraceCheckUtils]: 28: Hoare triple {54048#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54048#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:03,811 INFO L273 TraceCheckUtils]: 29: Hoare triple {54048#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {54049#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:03,811 INFO L273 TraceCheckUtils]: 30: Hoare triple {54049#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54049#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:03,812 INFO L273 TraceCheckUtils]: 31: Hoare triple {54049#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54049#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:03,813 INFO L273 TraceCheckUtils]: 32: Hoare triple {54049#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {54050#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:03,813 INFO L273 TraceCheckUtils]: 33: Hoare triple {54050#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54050#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:03,814 INFO L273 TraceCheckUtils]: 34: Hoare triple {54050#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54050#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:03,814 INFO L273 TraceCheckUtils]: 35: Hoare triple {54050#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {54051#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:03,815 INFO L273 TraceCheckUtils]: 36: Hoare triple {54051#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54051#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:03,815 INFO L273 TraceCheckUtils]: 37: Hoare triple {54051#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54051#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:03,816 INFO L273 TraceCheckUtils]: 38: Hoare triple {54051#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {54052#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:03,817 INFO L273 TraceCheckUtils]: 39: Hoare triple {54052#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54052#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:03,817 INFO L273 TraceCheckUtils]: 40: Hoare triple {54052#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54052#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:03,818 INFO L273 TraceCheckUtils]: 41: Hoare triple {54052#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {54053#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:03,818 INFO L273 TraceCheckUtils]: 42: Hoare triple {54053#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54053#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:03,819 INFO L273 TraceCheckUtils]: 43: Hoare triple {54053#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54053#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:03,819 INFO L273 TraceCheckUtils]: 44: Hoare triple {54053#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {54054#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:03,820 INFO L273 TraceCheckUtils]: 45: Hoare triple {54054#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54054#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:03,820 INFO L273 TraceCheckUtils]: 46: Hoare triple {54054#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54054#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:03,821 INFO L273 TraceCheckUtils]: 47: Hoare triple {54054#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {54055#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:03,822 INFO L273 TraceCheckUtils]: 48: Hoare triple {54055#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54055#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:03,822 INFO L273 TraceCheckUtils]: 49: Hoare triple {54055#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54055#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:03,823 INFO L273 TraceCheckUtils]: 50: Hoare triple {54055#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {54056#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:03,823 INFO L273 TraceCheckUtils]: 51: Hoare triple {54056#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54056#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:03,824 INFO L273 TraceCheckUtils]: 52: Hoare triple {54056#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54056#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:03,825 INFO L273 TraceCheckUtils]: 53: Hoare triple {54056#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {54057#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:03,825 INFO L273 TraceCheckUtils]: 54: Hoare triple {54057#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54057#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:03,826 INFO L273 TraceCheckUtils]: 55: Hoare triple {54057#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54057#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:03,826 INFO L273 TraceCheckUtils]: 56: Hoare triple {54057#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {54058#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:03,827 INFO L273 TraceCheckUtils]: 57: Hoare triple {54058#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54058#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:03,827 INFO L273 TraceCheckUtils]: 58: Hoare triple {54058#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54058#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:03,828 INFO L273 TraceCheckUtils]: 59: Hoare triple {54058#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {54059#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:03,828 INFO L273 TraceCheckUtils]: 60: Hoare triple {54059#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54059#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:03,829 INFO L273 TraceCheckUtils]: 61: Hoare triple {54059#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54059#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:03,829 INFO L273 TraceCheckUtils]: 62: Hoare triple {54059#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {54060#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:03,830 INFO L273 TraceCheckUtils]: 63: Hoare triple {54060#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54060#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:03,830 INFO L273 TraceCheckUtils]: 64: Hoare triple {54060#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54060#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:03,831 INFO L273 TraceCheckUtils]: 65: Hoare triple {54060#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {54061#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:03,832 INFO L273 TraceCheckUtils]: 66: Hoare triple {54061#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54061#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:03,832 INFO L273 TraceCheckUtils]: 67: Hoare triple {54061#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54061#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:03,833 INFO L273 TraceCheckUtils]: 68: Hoare triple {54061#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {54062#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:03,833 INFO L273 TraceCheckUtils]: 69: Hoare triple {54062#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54062#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:03,834 INFO L273 TraceCheckUtils]: 70: Hoare triple {54062#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54062#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:03,834 INFO L273 TraceCheckUtils]: 71: Hoare triple {54062#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {54063#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:03,835 INFO L273 TraceCheckUtils]: 72: Hoare triple {54063#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54063#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:03,835 INFO L273 TraceCheckUtils]: 73: Hoare triple {54063#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54063#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:03,836 INFO L273 TraceCheckUtils]: 74: Hoare triple {54063#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {54064#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:03,836 INFO L273 TraceCheckUtils]: 75: Hoare triple {54064#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54064#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:03,837 INFO L273 TraceCheckUtils]: 76: Hoare triple {54064#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54064#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:03,837 INFO L273 TraceCheckUtils]: 77: Hoare triple {54064#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {54065#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:03,838 INFO L273 TraceCheckUtils]: 78: Hoare triple {54065#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54065#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:03,838 INFO L273 TraceCheckUtils]: 79: Hoare triple {54065#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54065#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:03,839 INFO L273 TraceCheckUtils]: 80: Hoare triple {54065#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {54066#(<= main_~i~0 25)} is VALID [2018-11-23 11:58:03,839 INFO L273 TraceCheckUtils]: 81: Hoare triple {54066#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54066#(<= main_~i~0 25)} is VALID [2018-11-23 11:58:03,840 INFO L273 TraceCheckUtils]: 82: Hoare triple {54066#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54066#(<= main_~i~0 25)} is VALID [2018-11-23 11:58:03,841 INFO L273 TraceCheckUtils]: 83: Hoare triple {54066#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {54067#(<= main_~i~0 26)} is VALID [2018-11-23 11:58:03,841 INFO L273 TraceCheckUtils]: 84: Hoare triple {54067#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54067#(<= main_~i~0 26)} is VALID [2018-11-23 11:58:03,842 INFO L273 TraceCheckUtils]: 85: Hoare triple {54067#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54067#(<= main_~i~0 26)} is VALID [2018-11-23 11:58:03,842 INFO L273 TraceCheckUtils]: 86: Hoare triple {54067#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {54068#(<= main_~i~0 27)} is VALID [2018-11-23 11:58:03,843 INFO L273 TraceCheckUtils]: 87: Hoare triple {54068#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54068#(<= main_~i~0 27)} is VALID [2018-11-23 11:58:03,843 INFO L273 TraceCheckUtils]: 88: Hoare triple {54068#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54068#(<= main_~i~0 27)} is VALID [2018-11-23 11:58:03,844 INFO L273 TraceCheckUtils]: 89: Hoare triple {54068#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {54069#(<= main_~i~0 28)} is VALID [2018-11-23 11:58:03,844 INFO L273 TraceCheckUtils]: 90: Hoare triple {54069#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54069#(<= main_~i~0 28)} is VALID [2018-11-23 11:58:03,845 INFO L273 TraceCheckUtils]: 91: Hoare triple {54069#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54069#(<= main_~i~0 28)} is VALID [2018-11-23 11:58:03,845 INFO L273 TraceCheckUtils]: 92: Hoare triple {54069#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {54070#(<= main_~i~0 29)} is VALID [2018-11-23 11:58:03,846 INFO L273 TraceCheckUtils]: 93: Hoare triple {54070#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54070#(<= main_~i~0 29)} is VALID [2018-11-23 11:58:03,846 INFO L273 TraceCheckUtils]: 94: Hoare triple {54070#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54070#(<= main_~i~0 29)} is VALID [2018-11-23 11:58:03,847 INFO L273 TraceCheckUtils]: 95: Hoare triple {54070#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {54071#(<= main_~i~0 30)} is VALID [2018-11-23 11:58:03,848 INFO L273 TraceCheckUtils]: 96: Hoare triple {54071#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54071#(<= main_~i~0 30)} is VALID [2018-11-23 11:58:03,848 INFO L273 TraceCheckUtils]: 97: Hoare triple {54071#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54071#(<= main_~i~0 30)} is VALID [2018-11-23 11:58:03,849 INFO L273 TraceCheckUtils]: 98: Hoare triple {54071#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {54072#(<= main_~i~0 31)} is VALID [2018-11-23 11:58:03,849 INFO L273 TraceCheckUtils]: 99: Hoare triple {54072#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54072#(<= main_~i~0 31)} is VALID [2018-11-23 11:58:03,850 INFO L273 TraceCheckUtils]: 100: Hoare triple {54072#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54072#(<= main_~i~0 31)} is VALID [2018-11-23 11:58:03,850 INFO L273 TraceCheckUtils]: 101: Hoare triple {54072#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {54073#(<= main_~i~0 32)} is VALID [2018-11-23 11:58:03,851 INFO L273 TraceCheckUtils]: 102: Hoare triple {54073#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54073#(<= main_~i~0 32)} is VALID [2018-11-23 11:58:03,851 INFO L273 TraceCheckUtils]: 103: Hoare triple {54073#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54073#(<= main_~i~0 32)} is VALID [2018-11-23 11:58:03,852 INFO L273 TraceCheckUtils]: 104: Hoare triple {54073#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {54074#(<= main_~i~0 33)} is VALID [2018-11-23 11:58:03,852 INFO L273 TraceCheckUtils]: 105: Hoare triple {54074#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54074#(<= main_~i~0 33)} is VALID [2018-11-23 11:58:03,853 INFO L273 TraceCheckUtils]: 106: Hoare triple {54074#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54074#(<= main_~i~0 33)} is VALID [2018-11-23 11:58:03,853 INFO L273 TraceCheckUtils]: 107: Hoare triple {54074#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {54075#(<= main_~i~0 34)} is VALID [2018-11-23 11:58:03,854 INFO L273 TraceCheckUtils]: 108: Hoare triple {54075#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54075#(<= main_~i~0 34)} is VALID [2018-11-23 11:58:03,854 INFO L273 TraceCheckUtils]: 109: Hoare triple {54075#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54075#(<= main_~i~0 34)} is VALID [2018-11-23 11:58:03,855 INFO L273 TraceCheckUtils]: 110: Hoare triple {54075#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {54076#(<= main_~i~0 35)} is VALID [2018-11-23 11:58:03,855 INFO L273 TraceCheckUtils]: 111: Hoare triple {54076#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54076#(<= main_~i~0 35)} is VALID [2018-11-23 11:58:03,856 INFO L273 TraceCheckUtils]: 112: Hoare triple {54076#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54076#(<= main_~i~0 35)} is VALID [2018-11-23 11:58:03,857 INFO L273 TraceCheckUtils]: 113: Hoare triple {54076#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {54077#(<= main_~i~0 36)} is VALID [2018-11-23 11:58:03,857 INFO L273 TraceCheckUtils]: 114: Hoare triple {54077#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54077#(<= main_~i~0 36)} is VALID [2018-11-23 11:58:03,858 INFO L273 TraceCheckUtils]: 115: Hoare triple {54077#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54077#(<= main_~i~0 36)} is VALID [2018-11-23 11:58:03,858 INFO L273 TraceCheckUtils]: 116: Hoare triple {54077#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {54078#(<= main_~i~0 37)} is VALID [2018-11-23 11:58:03,859 INFO L273 TraceCheckUtils]: 117: Hoare triple {54078#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54078#(<= main_~i~0 37)} is VALID [2018-11-23 11:58:03,859 INFO L273 TraceCheckUtils]: 118: Hoare triple {54078#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54078#(<= main_~i~0 37)} is VALID [2018-11-23 11:58:03,860 INFO L273 TraceCheckUtils]: 119: Hoare triple {54078#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {54079#(<= main_~i~0 38)} is VALID [2018-11-23 11:58:03,860 INFO L273 TraceCheckUtils]: 120: Hoare triple {54079#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54079#(<= main_~i~0 38)} is VALID [2018-11-23 11:58:03,861 INFO L273 TraceCheckUtils]: 121: Hoare triple {54079#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54079#(<= main_~i~0 38)} is VALID [2018-11-23 11:58:03,861 INFO L273 TraceCheckUtils]: 122: Hoare triple {54079#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {54080#(<= main_~i~0 39)} is VALID [2018-11-23 11:58:03,862 INFO L273 TraceCheckUtils]: 123: Hoare triple {54080#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54080#(<= main_~i~0 39)} is VALID [2018-11-23 11:58:03,862 INFO L273 TraceCheckUtils]: 124: Hoare triple {54080#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54080#(<= main_~i~0 39)} is VALID [2018-11-23 11:58:03,863 INFO L273 TraceCheckUtils]: 125: Hoare triple {54080#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {54081#(<= main_~i~0 40)} is VALID [2018-11-23 11:58:03,863 INFO L273 TraceCheckUtils]: 126: Hoare triple {54081#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54081#(<= main_~i~0 40)} is VALID [2018-11-23 11:58:03,864 INFO L273 TraceCheckUtils]: 127: Hoare triple {54081#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54081#(<= main_~i~0 40)} is VALID [2018-11-23 11:58:03,865 INFO L273 TraceCheckUtils]: 128: Hoare triple {54081#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {54082#(<= main_~i~0 41)} is VALID [2018-11-23 11:58:03,865 INFO L273 TraceCheckUtils]: 129: Hoare triple {54082#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54082#(<= main_~i~0 41)} is VALID [2018-11-23 11:58:03,866 INFO L273 TraceCheckUtils]: 130: Hoare triple {54082#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54082#(<= main_~i~0 41)} is VALID [2018-11-23 11:58:03,866 INFO L273 TraceCheckUtils]: 131: Hoare triple {54082#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {54083#(<= main_~i~0 42)} is VALID [2018-11-23 11:58:03,867 INFO L273 TraceCheckUtils]: 132: Hoare triple {54083#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54083#(<= main_~i~0 42)} is VALID [2018-11-23 11:58:03,867 INFO L273 TraceCheckUtils]: 133: Hoare triple {54083#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54083#(<= main_~i~0 42)} is VALID [2018-11-23 11:58:03,868 INFO L273 TraceCheckUtils]: 134: Hoare triple {54083#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {54084#(<= main_~i~0 43)} is VALID [2018-11-23 11:58:03,868 INFO L273 TraceCheckUtils]: 135: Hoare triple {54084#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54084#(<= main_~i~0 43)} is VALID [2018-11-23 11:58:03,869 INFO L273 TraceCheckUtils]: 136: Hoare triple {54084#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54084#(<= main_~i~0 43)} is VALID [2018-11-23 11:58:03,869 INFO L273 TraceCheckUtils]: 137: Hoare triple {54084#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {54085#(<= main_~i~0 44)} is VALID [2018-11-23 11:58:03,870 INFO L273 TraceCheckUtils]: 138: Hoare triple {54085#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54085#(<= main_~i~0 44)} is VALID [2018-11-23 11:58:03,870 INFO L273 TraceCheckUtils]: 139: Hoare triple {54085#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54085#(<= main_~i~0 44)} is VALID [2018-11-23 11:58:03,871 INFO L273 TraceCheckUtils]: 140: Hoare triple {54085#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {54086#(<= main_~i~0 45)} is VALID [2018-11-23 11:58:03,871 INFO L273 TraceCheckUtils]: 141: Hoare triple {54086#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54086#(<= main_~i~0 45)} is VALID [2018-11-23 11:58:03,872 INFO L273 TraceCheckUtils]: 142: Hoare triple {54086#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54086#(<= main_~i~0 45)} is VALID [2018-11-23 11:58:03,873 INFO L273 TraceCheckUtils]: 143: Hoare triple {54086#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {54087#(<= main_~i~0 46)} is VALID [2018-11-23 11:58:03,873 INFO L273 TraceCheckUtils]: 144: Hoare triple {54087#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54087#(<= main_~i~0 46)} is VALID [2018-11-23 11:58:03,874 INFO L273 TraceCheckUtils]: 145: Hoare triple {54087#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54087#(<= main_~i~0 46)} is VALID [2018-11-23 11:58:03,874 INFO L273 TraceCheckUtils]: 146: Hoare triple {54087#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {54088#(<= main_~i~0 47)} is VALID [2018-11-23 11:58:03,875 INFO L273 TraceCheckUtils]: 147: Hoare triple {54088#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54088#(<= main_~i~0 47)} is VALID [2018-11-23 11:58:03,875 INFO L273 TraceCheckUtils]: 148: Hoare triple {54088#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54088#(<= main_~i~0 47)} is VALID [2018-11-23 11:58:03,876 INFO L273 TraceCheckUtils]: 149: Hoare triple {54088#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {54089#(<= main_~i~0 48)} is VALID [2018-11-23 11:58:03,876 INFO L273 TraceCheckUtils]: 150: Hoare triple {54089#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54089#(<= main_~i~0 48)} is VALID [2018-11-23 11:58:03,877 INFO L273 TraceCheckUtils]: 151: Hoare triple {54089#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54089#(<= main_~i~0 48)} is VALID [2018-11-23 11:58:03,877 INFO L273 TraceCheckUtils]: 152: Hoare triple {54089#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {54090#(<= main_~i~0 49)} is VALID [2018-11-23 11:58:03,878 INFO L273 TraceCheckUtils]: 153: Hoare triple {54090#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54090#(<= main_~i~0 49)} is VALID [2018-11-23 11:58:03,878 INFO L273 TraceCheckUtils]: 154: Hoare triple {54090#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54090#(<= main_~i~0 49)} is VALID [2018-11-23 11:58:03,879 INFO L273 TraceCheckUtils]: 155: Hoare triple {54090#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {54091#(<= main_~i~0 50)} is VALID [2018-11-23 11:58:03,880 INFO L273 TraceCheckUtils]: 156: Hoare triple {54091#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54091#(<= main_~i~0 50)} is VALID [2018-11-23 11:58:03,880 INFO L273 TraceCheckUtils]: 157: Hoare triple {54091#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54091#(<= main_~i~0 50)} is VALID [2018-11-23 11:58:03,881 INFO L273 TraceCheckUtils]: 158: Hoare triple {54091#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {54092#(<= main_~i~0 51)} is VALID [2018-11-23 11:58:03,881 INFO L273 TraceCheckUtils]: 159: Hoare triple {54092#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54092#(<= main_~i~0 51)} is VALID [2018-11-23 11:58:03,882 INFO L273 TraceCheckUtils]: 160: Hoare triple {54092#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54092#(<= main_~i~0 51)} is VALID [2018-11-23 11:58:03,882 INFO L273 TraceCheckUtils]: 161: Hoare triple {54092#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {54093#(<= main_~i~0 52)} is VALID [2018-11-23 11:58:03,883 INFO L273 TraceCheckUtils]: 162: Hoare triple {54093#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54093#(<= main_~i~0 52)} is VALID [2018-11-23 11:58:03,883 INFO L273 TraceCheckUtils]: 163: Hoare triple {54093#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54093#(<= main_~i~0 52)} is VALID [2018-11-23 11:58:03,884 INFO L273 TraceCheckUtils]: 164: Hoare triple {54093#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {54094#(<= main_~i~0 53)} is VALID [2018-11-23 11:58:03,884 INFO L273 TraceCheckUtils]: 165: Hoare triple {54094#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54094#(<= main_~i~0 53)} is VALID [2018-11-23 11:58:03,885 INFO L273 TraceCheckUtils]: 166: Hoare triple {54094#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54094#(<= main_~i~0 53)} is VALID [2018-11-23 11:58:03,885 INFO L273 TraceCheckUtils]: 167: Hoare triple {54094#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {54095#(<= main_~i~0 54)} is VALID [2018-11-23 11:58:03,886 INFO L273 TraceCheckUtils]: 168: Hoare triple {54095#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54095#(<= main_~i~0 54)} is VALID [2018-11-23 11:58:03,886 INFO L273 TraceCheckUtils]: 169: Hoare triple {54095#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54095#(<= main_~i~0 54)} is VALID [2018-11-23 11:58:03,887 INFO L273 TraceCheckUtils]: 170: Hoare triple {54095#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {54096#(<= main_~i~0 55)} is VALID [2018-11-23 11:58:03,888 INFO L273 TraceCheckUtils]: 171: Hoare triple {54096#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54096#(<= main_~i~0 55)} is VALID [2018-11-23 11:58:03,888 INFO L273 TraceCheckUtils]: 172: Hoare triple {54096#(<= main_~i~0 55)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54096#(<= main_~i~0 55)} is VALID [2018-11-23 11:58:03,889 INFO L273 TraceCheckUtils]: 173: Hoare triple {54096#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {54097#(<= main_~i~0 56)} is VALID [2018-11-23 11:58:03,889 INFO L273 TraceCheckUtils]: 174: Hoare triple {54097#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54097#(<= main_~i~0 56)} is VALID [2018-11-23 11:58:03,890 INFO L273 TraceCheckUtils]: 175: Hoare triple {54097#(<= main_~i~0 56)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54097#(<= main_~i~0 56)} is VALID [2018-11-23 11:58:03,890 INFO L273 TraceCheckUtils]: 176: Hoare triple {54097#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {54098#(<= main_~i~0 57)} is VALID [2018-11-23 11:58:03,891 INFO L273 TraceCheckUtils]: 177: Hoare triple {54098#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54098#(<= main_~i~0 57)} is VALID [2018-11-23 11:58:03,891 INFO L273 TraceCheckUtils]: 178: Hoare triple {54098#(<= main_~i~0 57)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54098#(<= main_~i~0 57)} is VALID [2018-11-23 11:58:03,892 INFO L273 TraceCheckUtils]: 179: Hoare triple {54098#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {54099#(<= main_~i~0 58)} is VALID [2018-11-23 11:58:03,892 INFO L273 TraceCheckUtils]: 180: Hoare triple {54099#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54099#(<= main_~i~0 58)} is VALID [2018-11-23 11:58:03,893 INFO L273 TraceCheckUtils]: 181: Hoare triple {54099#(<= main_~i~0 58)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54099#(<= main_~i~0 58)} is VALID [2018-11-23 11:58:03,893 INFO L273 TraceCheckUtils]: 182: Hoare triple {54099#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {54100#(<= main_~i~0 59)} is VALID [2018-11-23 11:58:03,894 INFO L273 TraceCheckUtils]: 183: Hoare triple {54100#(<= main_~i~0 59)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54100#(<= main_~i~0 59)} is VALID [2018-11-23 11:58:03,894 INFO L273 TraceCheckUtils]: 184: Hoare triple {54100#(<= main_~i~0 59)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54100#(<= main_~i~0 59)} is VALID [2018-11-23 11:58:03,895 INFO L273 TraceCheckUtils]: 185: Hoare triple {54100#(<= main_~i~0 59)} ~i~0 := 1 + ~i~0; {54101#(<= main_~i~0 60)} is VALID [2018-11-23 11:58:03,896 INFO L273 TraceCheckUtils]: 186: Hoare triple {54101#(<= main_~i~0 60)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54101#(<= main_~i~0 60)} is VALID [2018-11-23 11:58:03,896 INFO L273 TraceCheckUtils]: 187: Hoare triple {54101#(<= main_~i~0 60)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54101#(<= main_~i~0 60)} is VALID [2018-11-23 11:58:03,897 INFO L273 TraceCheckUtils]: 188: Hoare triple {54101#(<= main_~i~0 60)} ~i~0 := 1 + ~i~0; {54102#(<= main_~i~0 61)} is VALID [2018-11-23 11:58:03,897 INFO L273 TraceCheckUtils]: 189: Hoare triple {54102#(<= main_~i~0 61)} assume !(~i~0 < 100000); {54040#false} is VALID [2018-11-23 11:58:03,898 INFO L273 TraceCheckUtils]: 190: Hoare triple {54040#false} havoc ~x~0;~x~0 := 0; {54040#false} is VALID [2018-11-23 11:58:03,898 INFO L273 TraceCheckUtils]: 191: Hoare triple {54040#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {54040#false} is VALID [2018-11-23 11:58:03,898 INFO L256 TraceCheckUtils]: 192: Hoare triple {54040#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {54040#false} is VALID [2018-11-23 11:58:03,898 INFO L273 TraceCheckUtils]: 193: Hoare triple {54040#false} ~cond := #in~cond; {54040#false} is VALID [2018-11-23 11:58:03,898 INFO L273 TraceCheckUtils]: 194: Hoare triple {54040#false} assume 0 == ~cond; {54040#false} is VALID [2018-11-23 11:58:03,898 INFO L273 TraceCheckUtils]: 195: Hoare triple {54040#false} assume !false; {54040#false} is VALID [2018-11-23 11:58:03,924 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 0 proven. 5551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:03,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:03,924 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:03,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:04,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:04,463 INFO L256 TraceCheckUtils]: 0: Hoare triple {54039#true} call ULTIMATE.init(); {54039#true} is VALID [2018-11-23 11:58:04,463 INFO L273 TraceCheckUtils]: 1: Hoare triple {54039#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {54039#true} is VALID [2018-11-23 11:58:04,463 INFO L273 TraceCheckUtils]: 2: Hoare triple {54039#true} assume true; {54039#true} is VALID [2018-11-23 11:58:04,463 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {54039#true} {54039#true} #55#return; {54039#true} is VALID [2018-11-23 11:58:04,464 INFO L256 TraceCheckUtils]: 4: Hoare triple {54039#true} call #t~ret4 := main(); {54039#true} is VALID [2018-11-23 11:58:04,464 INFO L273 TraceCheckUtils]: 5: Hoare triple {54039#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {54121#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:04,465 INFO L273 TraceCheckUtils]: 6: Hoare triple {54121#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54121#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:04,465 INFO L273 TraceCheckUtils]: 7: Hoare triple {54121#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54121#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:04,466 INFO L273 TraceCheckUtils]: 8: Hoare triple {54121#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {54042#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:04,466 INFO L273 TraceCheckUtils]: 9: Hoare triple {54042#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54042#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:04,467 INFO L273 TraceCheckUtils]: 10: Hoare triple {54042#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54042#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:04,467 INFO L273 TraceCheckUtils]: 11: Hoare triple {54042#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {54043#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:04,467 INFO L273 TraceCheckUtils]: 12: Hoare triple {54043#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54043#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:04,468 INFO L273 TraceCheckUtils]: 13: Hoare triple {54043#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54043#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:04,468 INFO L273 TraceCheckUtils]: 14: Hoare triple {54043#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {54044#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:04,469 INFO L273 TraceCheckUtils]: 15: Hoare triple {54044#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54044#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:04,469 INFO L273 TraceCheckUtils]: 16: Hoare triple {54044#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54044#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:04,470 INFO L273 TraceCheckUtils]: 17: Hoare triple {54044#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {54045#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:04,470 INFO L273 TraceCheckUtils]: 18: Hoare triple {54045#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54045#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:04,471 INFO L273 TraceCheckUtils]: 19: Hoare triple {54045#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54045#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:04,471 INFO L273 TraceCheckUtils]: 20: Hoare triple {54045#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {54046#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:04,472 INFO L273 TraceCheckUtils]: 21: Hoare triple {54046#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54046#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:04,472 INFO L273 TraceCheckUtils]: 22: Hoare triple {54046#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54046#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:04,473 INFO L273 TraceCheckUtils]: 23: Hoare triple {54046#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {54047#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:04,474 INFO L273 TraceCheckUtils]: 24: Hoare triple {54047#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54047#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:04,474 INFO L273 TraceCheckUtils]: 25: Hoare triple {54047#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54047#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:04,475 INFO L273 TraceCheckUtils]: 26: Hoare triple {54047#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {54048#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:04,475 INFO L273 TraceCheckUtils]: 27: Hoare triple {54048#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54048#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:04,476 INFO L273 TraceCheckUtils]: 28: Hoare triple {54048#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54048#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:04,477 INFO L273 TraceCheckUtils]: 29: Hoare triple {54048#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {54049#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:04,477 INFO L273 TraceCheckUtils]: 30: Hoare triple {54049#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54049#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:04,477 INFO L273 TraceCheckUtils]: 31: Hoare triple {54049#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54049#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:04,478 INFO L273 TraceCheckUtils]: 32: Hoare triple {54049#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {54050#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:04,479 INFO L273 TraceCheckUtils]: 33: Hoare triple {54050#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54050#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:04,479 INFO L273 TraceCheckUtils]: 34: Hoare triple {54050#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54050#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:04,480 INFO L273 TraceCheckUtils]: 35: Hoare triple {54050#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {54051#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:04,480 INFO L273 TraceCheckUtils]: 36: Hoare triple {54051#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54051#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:04,481 INFO L273 TraceCheckUtils]: 37: Hoare triple {54051#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54051#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:04,482 INFO L273 TraceCheckUtils]: 38: Hoare triple {54051#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {54052#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:04,482 INFO L273 TraceCheckUtils]: 39: Hoare triple {54052#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54052#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:04,483 INFO L273 TraceCheckUtils]: 40: Hoare triple {54052#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54052#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:04,483 INFO L273 TraceCheckUtils]: 41: Hoare triple {54052#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {54053#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:04,484 INFO L273 TraceCheckUtils]: 42: Hoare triple {54053#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54053#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:04,484 INFO L273 TraceCheckUtils]: 43: Hoare triple {54053#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54053#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:04,485 INFO L273 TraceCheckUtils]: 44: Hoare triple {54053#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {54054#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:04,486 INFO L273 TraceCheckUtils]: 45: Hoare triple {54054#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54054#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:04,486 INFO L273 TraceCheckUtils]: 46: Hoare triple {54054#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54054#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:04,487 INFO L273 TraceCheckUtils]: 47: Hoare triple {54054#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {54055#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:04,487 INFO L273 TraceCheckUtils]: 48: Hoare triple {54055#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54055#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:04,488 INFO L273 TraceCheckUtils]: 49: Hoare triple {54055#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54055#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:04,488 INFO L273 TraceCheckUtils]: 50: Hoare triple {54055#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {54056#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:04,489 INFO L273 TraceCheckUtils]: 51: Hoare triple {54056#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54056#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:04,489 INFO L273 TraceCheckUtils]: 52: Hoare triple {54056#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54056#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:04,490 INFO L273 TraceCheckUtils]: 53: Hoare triple {54056#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {54057#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:04,490 INFO L273 TraceCheckUtils]: 54: Hoare triple {54057#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54057#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:04,491 INFO L273 TraceCheckUtils]: 55: Hoare triple {54057#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54057#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:04,491 INFO L273 TraceCheckUtils]: 56: Hoare triple {54057#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {54058#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:04,492 INFO L273 TraceCheckUtils]: 57: Hoare triple {54058#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54058#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:04,492 INFO L273 TraceCheckUtils]: 58: Hoare triple {54058#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54058#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:04,493 INFO L273 TraceCheckUtils]: 59: Hoare triple {54058#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {54059#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:04,494 INFO L273 TraceCheckUtils]: 60: Hoare triple {54059#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54059#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:04,494 INFO L273 TraceCheckUtils]: 61: Hoare triple {54059#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54059#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:04,495 INFO L273 TraceCheckUtils]: 62: Hoare triple {54059#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {54060#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:04,495 INFO L273 TraceCheckUtils]: 63: Hoare triple {54060#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54060#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:04,496 INFO L273 TraceCheckUtils]: 64: Hoare triple {54060#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54060#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:04,496 INFO L273 TraceCheckUtils]: 65: Hoare triple {54060#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {54061#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:04,497 INFO L273 TraceCheckUtils]: 66: Hoare triple {54061#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54061#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:04,497 INFO L273 TraceCheckUtils]: 67: Hoare triple {54061#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54061#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:04,498 INFO L273 TraceCheckUtils]: 68: Hoare triple {54061#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {54062#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:04,498 INFO L273 TraceCheckUtils]: 69: Hoare triple {54062#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54062#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:04,499 INFO L273 TraceCheckUtils]: 70: Hoare triple {54062#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54062#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:04,500 INFO L273 TraceCheckUtils]: 71: Hoare triple {54062#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {54063#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:04,500 INFO L273 TraceCheckUtils]: 72: Hoare triple {54063#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54063#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:04,500 INFO L273 TraceCheckUtils]: 73: Hoare triple {54063#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54063#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:04,501 INFO L273 TraceCheckUtils]: 74: Hoare triple {54063#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {54064#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:04,502 INFO L273 TraceCheckUtils]: 75: Hoare triple {54064#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54064#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:04,502 INFO L273 TraceCheckUtils]: 76: Hoare triple {54064#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54064#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:04,503 INFO L273 TraceCheckUtils]: 77: Hoare triple {54064#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {54065#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:04,503 INFO L273 TraceCheckUtils]: 78: Hoare triple {54065#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54065#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:04,504 INFO L273 TraceCheckUtils]: 79: Hoare triple {54065#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54065#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:04,504 INFO L273 TraceCheckUtils]: 80: Hoare triple {54065#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {54066#(<= main_~i~0 25)} is VALID [2018-11-23 11:58:04,505 INFO L273 TraceCheckUtils]: 81: Hoare triple {54066#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54066#(<= main_~i~0 25)} is VALID [2018-11-23 11:58:04,505 INFO L273 TraceCheckUtils]: 82: Hoare triple {54066#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54066#(<= main_~i~0 25)} is VALID [2018-11-23 11:58:04,506 INFO L273 TraceCheckUtils]: 83: Hoare triple {54066#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {54067#(<= main_~i~0 26)} is VALID [2018-11-23 11:58:04,506 INFO L273 TraceCheckUtils]: 84: Hoare triple {54067#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54067#(<= main_~i~0 26)} is VALID [2018-11-23 11:58:04,507 INFO L273 TraceCheckUtils]: 85: Hoare triple {54067#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54067#(<= main_~i~0 26)} is VALID [2018-11-23 11:58:04,508 INFO L273 TraceCheckUtils]: 86: Hoare triple {54067#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {54068#(<= main_~i~0 27)} is VALID [2018-11-23 11:58:04,508 INFO L273 TraceCheckUtils]: 87: Hoare triple {54068#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54068#(<= main_~i~0 27)} is VALID [2018-11-23 11:58:04,509 INFO L273 TraceCheckUtils]: 88: Hoare triple {54068#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54068#(<= main_~i~0 27)} is VALID [2018-11-23 11:58:04,509 INFO L273 TraceCheckUtils]: 89: Hoare triple {54068#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {54069#(<= main_~i~0 28)} is VALID [2018-11-23 11:58:04,510 INFO L273 TraceCheckUtils]: 90: Hoare triple {54069#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54069#(<= main_~i~0 28)} is VALID [2018-11-23 11:58:04,510 INFO L273 TraceCheckUtils]: 91: Hoare triple {54069#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54069#(<= main_~i~0 28)} is VALID [2018-11-23 11:58:04,511 INFO L273 TraceCheckUtils]: 92: Hoare triple {54069#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {54070#(<= main_~i~0 29)} is VALID [2018-11-23 11:58:04,512 INFO L273 TraceCheckUtils]: 93: Hoare triple {54070#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54070#(<= main_~i~0 29)} is VALID [2018-11-23 11:58:04,512 INFO L273 TraceCheckUtils]: 94: Hoare triple {54070#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54070#(<= main_~i~0 29)} is VALID [2018-11-23 11:58:04,513 INFO L273 TraceCheckUtils]: 95: Hoare triple {54070#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {54071#(<= main_~i~0 30)} is VALID [2018-11-23 11:58:04,513 INFO L273 TraceCheckUtils]: 96: Hoare triple {54071#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54071#(<= main_~i~0 30)} is VALID [2018-11-23 11:58:04,514 INFO L273 TraceCheckUtils]: 97: Hoare triple {54071#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54071#(<= main_~i~0 30)} is VALID [2018-11-23 11:58:04,514 INFO L273 TraceCheckUtils]: 98: Hoare triple {54071#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {54072#(<= main_~i~0 31)} is VALID [2018-11-23 11:58:04,515 INFO L273 TraceCheckUtils]: 99: Hoare triple {54072#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54072#(<= main_~i~0 31)} is VALID [2018-11-23 11:58:04,515 INFO L273 TraceCheckUtils]: 100: Hoare triple {54072#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54072#(<= main_~i~0 31)} is VALID [2018-11-23 11:58:04,516 INFO L273 TraceCheckUtils]: 101: Hoare triple {54072#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {54073#(<= main_~i~0 32)} is VALID [2018-11-23 11:58:04,516 INFO L273 TraceCheckUtils]: 102: Hoare triple {54073#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54073#(<= main_~i~0 32)} is VALID [2018-11-23 11:58:04,517 INFO L273 TraceCheckUtils]: 103: Hoare triple {54073#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54073#(<= main_~i~0 32)} is VALID [2018-11-23 11:58:04,518 INFO L273 TraceCheckUtils]: 104: Hoare triple {54073#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {54074#(<= main_~i~0 33)} is VALID [2018-11-23 11:58:04,518 INFO L273 TraceCheckUtils]: 105: Hoare triple {54074#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54074#(<= main_~i~0 33)} is VALID [2018-11-23 11:58:04,518 INFO L273 TraceCheckUtils]: 106: Hoare triple {54074#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54074#(<= main_~i~0 33)} is VALID [2018-11-23 11:58:04,519 INFO L273 TraceCheckUtils]: 107: Hoare triple {54074#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {54075#(<= main_~i~0 34)} is VALID [2018-11-23 11:58:04,520 INFO L273 TraceCheckUtils]: 108: Hoare triple {54075#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54075#(<= main_~i~0 34)} is VALID [2018-11-23 11:58:04,520 INFO L273 TraceCheckUtils]: 109: Hoare triple {54075#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54075#(<= main_~i~0 34)} is VALID [2018-11-23 11:58:04,521 INFO L273 TraceCheckUtils]: 110: Hoare triple {54075#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {54076#(<= main_~i~0 35)} is VALID [2018-11-23 11:58:04,521 INFO L273 TraceCheckUtils]: 111: Hoare triple {54076#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54076#(<= main_~i~0 35)} is VALID [2018-11-23 11:58:04,522 INFO L273 TraceCheckUtils]: 112: Hoare triple {54076#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54076#(<= main_~i~0 35)} is VALID [2018-11-23 11:58:04,523 INFO L273 TraceCheckUtils]: 113: Hoare triple {54076#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {54077#(<= main_~i~0 36)} is VALID [2018-11-23 11:58:04,523 INFO L273 TraceCheckUtils]: 114: Hoare triple {54077#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54077#(<= main_~i~0 36)} is VALID [2018-11-23 11:58:04,524 INFO L273 TraceCheckUtils]: 115: Hoare triple {54077#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54077#(<= main_~i~0 36)} is VALID [2018-11-23 11:58:04,524 INFO L273 TraceCheckUtils]: 116: Hoare triple {54077#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {54078#(<= main_~i~0 37)} is VALID [2018-11-23 11:58:04,525 INFO L273 TraceCheckUtils]: 117: Hoare triple {54078#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54078#(<= main_~i~0 37)} is VALID [2018-11-23 11:58:04,525 INFO L273 TraceCheckUtils]: 118: Hoare triple {54078#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54078#(<= main_~i~0 37)} is VALID [2018-11-23 11:58:04,526 INFO L273 TraceCheckUtils]: 119: Hoare triple {54078#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {54079#(<= main_~i~0 38)} is VALID [2018-11-23 11:58:04,526 INFO L273 TraceCheckUtils]: 120: Hoare triple {54079#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54079#(<= main_~i~0 38)} is VALID [2018-11-23 11:58:04,527 INFO L273 TraceCheckUtils]: 121: Hoare triple {54079#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54079#(<= main_~i~0 38)} is VALID [2018-11-23 11:58:04,527 INFO L273 TraceCheckUtils]: 122: Hoare triple {54079#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {54080#(<= main_~i~0 39)} is VALID [2018-11-23 11:58:04,528 INFO L273 TraceCheckUtils]: 123: Hoare triple {54080#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54080#(<= main_~i~0 39)} is VALID [2018-11-23 11:58:04,528 INFO L273 TraceCheckUtils]: 124: Hoare triple {54080#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54080#(<= main_~i~0 39)} is VALID [2018-11-23 11:58:04,529 INFO L273 TraceCheckUtils]: 125: Hoare triple {54080#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {54081#(<= main_~i~0 40)} is VALID [2018-11-23 11:58:04,530 INFO L273 TraceCheckUtils]: 126: Hoare triple {54081#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54081#(<= main_~i~0 40)} is VALID [2018-11-23 11:58:04,530 INFO L273 TraceCheckUtils]: 127: Hoare triple {54081#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54081#(<= main_~i~0 40)} is VALID [2018-11-23 11:58:04,531 INFO L273 TraceCheckUtils]: 128: Hoare triple {54081#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {54082#(<= main_~i~0 41)} is VALID [2018-11-23 11:58:04,531 INFO L273 TraceCheckUtils]: 129: Hoare triple {54082#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54082#(<= main_~i~0 41)} is VALID [2018-11-23 11:58:04,532 INFO L273 TraceCheckUtils]: 130: Hoare triple {54082#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54082#(<= main_~i~0 41)} is VALID [2018-11-23 11:58:04,533 INFO L273 TraceCheckUtils]: 131: Hoare triple {54082#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {54083#(<= main_~i~0 42)} is VALID [2018-11-23 11:58:04,533 INFO L273 TraceCheckUtils]: 132: Hoare triple {54083#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54083#(<= main_~i~0 42)} is VALID [2018-11-23 11:58:04,534 INFO L273 TraceCheckUtils]: 133: Hoare triple {54083#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54083#(<= main_~i~0 42)} is VALID [2018-11-23 11:58:04,534 INFO L273 TraceCheckUtils]: 134: Hoare triple {54083#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {54084#(<= main_~i~0 43)} is VALID [2018-11-23 11:58:04,535 INFO L273 TraceCheckUtils]: 135: Hoare triple {54084#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54084#(<= main_~i~0 43)} is VALID [2018-11-23 11:58:04,535 INFO L273 TraceCheckUtils]: 136: Hoare triple {54084#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54084#(<= main_~i~0 43)} is VALID [2018-11-23 11:58:04,536 INFO L273 TraceCheckUtils]: 137: Hoare triple {54084#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {54085#(<= main_~i~0 44)} is VALID [2018-11-23 11:58:04,537 INFO L273 TraceCheckUtils]: 138: Hoare triple {54085#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54085#(<= main_~i~0 44)} is VALID [2018-11-23 11:58:04,537 INFO L273 TraceCheckUtils]: 139: Hoare triple {54085#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54085#(<= main_~i~0 44)} is VALID [2018-11-23 11:58:04,538 INFO L273 TraceCheckUtils]: 140: Hoare triple {54085#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {54086#(<= main_~i~0 45)} is VALID [2018-11-23 11:58:04,538 INFO L273 TraceCheckUtils]: 141: Hoare triple {54086#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54086#(<= main_~i~0 45)} is VALID [2018-11-23 11:58:04,539 INFO L273 TraceCheckUtils]: 142: Hoare triple {54086#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54086#(<= main_~i~0 45)} is VALID [2018-11-23 11:58:04,539 INFO L273 TraceCheckUtils]: 143: Hoare triple {54086#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {54087#(<= main_~i~0 46)} is VALID [2018-11-23 11:58:04,540 INFO L273 TraceCheckUtils]: 144: Hoare triple {54087#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54087#(<= main_~i~0 46)} is VALID [2018-11-23 11:58:04,540 INFO L273 TraceCheckUtils]: 145: Hoare triple {54087#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54087#(<= main_~i~0 46)} is VALID [2018-11-23 11:58:04,541 INFO L273 TraceCheckUtils]: 146: Hoare triple {54087#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {54088#(<= main_~i~0 47)} is VALID [2018-11-23 11:58:04,542 INFO L273 TraceCheckUtils]: 147: Hoare triple {54088#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54088#(<= main_~i~0 47)} is VALID [2018-11-23 11:58:04,542 INFO L273 TraceCheckUtils]: 148: Hoare triple {54088#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54088#(<= main_~i~0 47)} is VALID [2018-11-23 11:58:04,543 INFO L273 TraceCheckUtils]: 149: Hoare triple {54088#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {54089#(<= main_~i~0 48)} is VALID [2018-11-23 11:58:04,543 INFO L273 TraceCheckUtils]: 150: Hoare triple {54089#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54089#(<= main_~i~0 48)} is VALID [2018-11-23 11:58:04,544 INFO L273 TraceCheckUtils]: 151: Hoare triple {54089#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54089#(<= main_~i~0 48)} is VALID [2018-11-23 11:58:04,545 INFO L273 TraceCheckUtils]: 152: Hoare triple {54089#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {54090#(<= main_~i~0 49)} is VALID [2018-11-23 11:58:04,545 INFO L273 TraceCheckUtils]: 153: Hoare triple {54090#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54090#(<= main_~i~0 49)} is VALID [2018-11-23 11:58:04,546 INFO L273 TraceCheckUtils]: 154: Hoare triple {54090#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54090#(<= main_~i~0 49)} is VALID [2018-11-23 11:58:04,546 INFO L273 TraceCheckUtils]: 155: Hoare triple {54090#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {54091#(<= main_~i~0 50)} is VALID [2018-11-23 11:58:04,547 INFO L273 TraceCheckUtils]: 156: Hoare triple {54091#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54091#(<= main_~i~0 50)} is VALID [2018-11-23 11:58:04,547 INFO L273 TraceCheckUtils]: 157: Hoare triple {54091#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54091#(<= main_~i~0 50)} is VALID [2018-11-23 11:58:04,548 INFO L273 TraceCheckUtils]: 158: Hoare triple {54091#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {54092#(<= main_~i~0 51)} is VALID [2018-11-23 11:58:04,549 INFO L273 TraceCheckUtils]: 159: Hoare triple {54092#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54092#(<= main_~i~0 51)} is VALID [2018-11-23 11:58:04,549 INFO L273 TraceCheckUtils]: 160: Hoare triple {54092#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54092#(<= main_~i~0 51)} is VALID [2018-11-23 11:58:04,550 INFO L273 TraceCheckUtils]: 161: Hoare triple {54092#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {54093#(<= main_~i~0 52)} is VALID [2018-11-23 11:58:04,550 INFO L273 TraceCheckUtils]: 162: Hoare triple {54093#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54093#(<= main_~i~0 52)} is VALID [2018-11-23 11:58:04,551 INFO L273 TraceCheckUtils]: 163: Hoare triple {54093#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54093#(<= main_~i~0 52)} is VALID [2018-11-23 11:58:04,551 INFO L273 TraceCheckUtils]: 164: Hoare triple {54093#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {54094#(<= main_~i~0 53)} is VALID [2018-11-23 11:58:04,552 INFO L273 TraceCheckUtils]: 165: Hoare triple {54094#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54094#(<= main_~i~0 53)} is VALID [2018-11-23 11:58:04,552 INFO L273 TraceCheckUtils]: 166: Hoare triple {54094#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54094#(<= main_~i~0 53)} is VALID [2018-11-23 11:58:04,553 INFO L273 TraceCheckUtils]: 167: Hoare triple {54094#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {54095#(<= main_~i~0 54)} is VALID [2018-11-23 11:58:04,554 INFO L273 TraceCheckUtils]: 168: Hoare triple {54095#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54095#(<= main_~i~0 54)} is VALID [2018-11-23 11:58:04,554 INFO L273 TraceCheckUtils]: 169: Hoare triple {54095#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54095#(<= main_~i~0 54)} is VALID [2018-11-23 11:58:04,555 INFO L273 TraceCheckUtils]: 170: Hoare triple {54095#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {54096#(<= main_~i~0 55)} is VALID [2018-11-23 11:58:04,555 INFO L273 TraceCheckUtils]: 171: Hoare triple {54096#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54096#(<= main_~i~0 55)} is VALID [2018-11-23 11:58:04,556 INFO L273 TraceCheckUtils]: 172: Hoare triple {54096#(<= main_~i~0 55)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54096#(<= main_~i~0 55)} is VALID [2018-11-23 11:58:04,556 INFO L273 TraceCheckUtils]: 173: Hoare triple {54096#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {54097#(<= main_~i~0 56)} is VALID [2018-11-23 11:58:04,557 INFO L273 TraceCheckUtils]: 174: Hoare triple {54097#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54097#(<= main_~i~0 56)} is VALID [2018-11-23 11:58:04,557 INFO L273 TraceCheckUtils]: 175: Hoare triple {54097#(<= main_~i~0 56)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54097#(<= main_~i~0 56)} is VALID [2018-11-23 11:58:04,558 INFO L273 TraceCheckUtils]: 176: Hoare triple {54097#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {54098#(<= main_~i~0 57)} is VALID [2018-11-23 11:58:04,559 INFO L273 TraceCheckUtils]: 177: Hoare triple {54098#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54098#(<= main_~i~0 57)} is VALID [2018-11-23 11:58:04,559 INFO L273 TraceCheckUtils]: 178: Hoare triple {54098#(<= main_~i~0 57)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54098#(<= main_~i~0 57)} is VALID [2018-11-23 11:58:04,560 INFO L273 TraceCheckUtils]: 179: Hoare triple {54098#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {54099#(<= main_~i~0 58)} is VALID [2018-11-23 11:58:04,560 INFO L273 TraceCheckUtils]: 180: Hoare triple {54099#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54099#(<= main_~i~0 58)} is VALID [2018-11-23 11:58:04,561 INFO L273 TraceCheckUtils]: 181: Hoare triple {54099#(<= main_~i~0 58)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54099#(<= main_~i~0 58)} is VALID [2018-11-23 11:58:04,562 INFO L273 TraceCheckUtils]: 182: Hoare triple {54099#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {54100#(<= main_~i~0 59)} is VALID [2018-11-23 11:58:04,562 INFO L273 TraceCheckUtils]: 183: Hoare triple {54100#(<= main_~i~0 59)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54100#(<= main_~i~0 59)} is VALID [2018-11-23 11:58:04,563 INFO L273 TraceCheckUtils]: 184: Hoare triple {54100#(<= main_~i~0 59)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54100#(<= main_~i~0 59)} is VALID [2018-11-23 11:58:04,563 INFO L273 TraceCheckUtils]: 185: Hoare triple {54100#(<= main_~i~0 59)} ~i~0 := 1 + ~i~0; {54101#(<= main_~i~0 60)} is VALID [2018-11-23 11:58:04,564 INFO L273 TraceCheckUtils]: 186: Hoare triple {54101#(<= main_~i~0 60)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {54101#(<= main_~i~0 60)} is VALID [2018-11-23 11:58:04,564 INFO L273 TraceCheckUtils]: 187: Hoare triple {54101#(<= main_~i~0 60)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {54101#(<= main_~i~0 60)} is VALID [2018-11-23 11:58:04,565 INFO L273 TraceCheckUtils]: 188: Hoare triple {54101#(<= main_~i~0 60)} ~i~0 := 1 + ~i~0; {54102#(<= main_~i~0 61)} is VALID [2018-11-23 11:58:04,566 INFO L273 TraceCheckUtils]: 189: Hoare triple {54102#(<= main_~i~0 61)} assume !(~i~0 < 100000); {54040#false} is VALID [2018-11-23 11:58:04,566 INFO L273 TraceCheckUtils]: 190: Hoare triple {54040#false} havoc ~x~0;~x~0 := 0; {54040#false} is VALID [2018-11-23 11:58:04,566 INFO L273 TraceCheckUtils]: 191: Hoare triple {54040#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {54040#false} is VALID [2018-11-23 11:58:04,566 INFO L256 TraceCheckUtils]: 192: Hoare triple {54040#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {54040#false} is VALID [2018-11-23 11:58:04,566 INFO L273 TraceCheckUtils]: 193: Hoare triple {54040#false} ~cond := #in~cond; {54040#false} is VALID [2018-11-23 11:58:04,567 INFO L273 TraceCheckUtils]: 194: Hoare triple {54040#false} assume 0 == ~cond; {54040#false} is VALID [2018-11-23 11:58:04,567 INFO L273 TraceCheckUtils]: 195: Hoare triple {54040#false} assume !false; {54040#false} is VALID [2018-11-23 11:58:04,593 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 0 proven. 5551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:04,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:04,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 65 [2018-11-23 11:58:04,613 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 196 [2018-11-23 11:58:04,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:04,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 65 states. [2018-11-23 11:58:04,813 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:04,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-11-23 11:58:04,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-11-23 11:58:04,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-11-23 11:58:04,815 INFO L87 Difference]: Start difference. First operand 201 states and 263 transitions. Second operand 65 states. [2018-11-23 11:58:06,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:06,207 INFO L93 Difference]: Finished difference Result 217 states and 282 transitions. [2018-11-23 11:58:06,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-11-23 11:58:06,208 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 196 [2018-11-23 11:58:06,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:06,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 11:58:06,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 282 transitions. [2018-11-23 11:58:06,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 11:58:06,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 282 transitions. [2018-11-23 11:58:06,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states and 282 transitions. [2018-11-23 11:58:06,473 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 282 edges. 282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:06,477 INFO L225 Difference]: With dead ends: 217 [2018-11-23 11:58:06,478 INFO L226 Difference]: Without dead ends: 206 [2018-11-23 11:58:06,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-11-23 11:58:06,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-11-23 11:58:06,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2018-11-23 11:58:06,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:06,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand 204 states. [2018-11-23 11:58:06,724 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand 204 states. [2018-11-23 11:58:06,724 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 204 states. [2018-11-23 11:58:06,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:06,727 INFO L93 Difference]: Finished difference Result 206 states and 270 transitions. [2018-11-23 11:58:06,727 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 270 transitions. [2018-11-23 11:58:06,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:06,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:06,728 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand 206 states. [2018-11-23 11:58:06,728 INFO L87 Difference]: Start difference. First operand 204 states. Second operand 206 states. [2018-11-23 11:58:06,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:06,731 INFO L93 Difference]: Finished difference Result 206 states and 270 transitions. [2018-11-23 11:58:06,731 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 270 transitions. [2018-11-23 11:58:06,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:06,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:06,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:06,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:06,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-23 11:58:06,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 267 transitions. [2018-11-23 11:58:06,734 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 267 transitions. Word has length 196 [2018-11-23 11:58:06,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:06,734 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 267 transitions. [2018-11-23 11:58:06,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-11-23 11:58:06,734 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 267 transitions. [2018-11-23 11:58:06,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-23 11:58:06,735 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:06,735 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:06,736 INFO L423 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:06,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:06,736 INFO L82 PathProgramCache]: Analyzing trace with hash -887399175, now seen corresponding path program 62 times [2018-11-23 11:58:06,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:06,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:06,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:06,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:06,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:08,495 INFO L256 TraceCheckUtils]: 0: Hoare triple {55667#true} call ULTIMATE.init(); {55667#true} is VALID [2018-11-23 11:58:08,495 INFO L273 TraceCheckUtils]: 1: Hoare triple {55667#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {55667#true} is VALID [2018-11-23 11:58:08,496 INFO L273 TraceCheckUtils]: 2: Hoare triple {55667#true} assume true; {55667#true} is VALID [2018-11-23 11:58:08,496 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {55667#true} {55667#true} #55#return; {55667#true} is VALID [2018-11-23 11:58:08,496 INFO L256 TraceCheckUtils]: 4: Hoare triple {55667#true} call #t~ret4 := main(); {55667#true} is VALID [2018-11-23 11:58:08,496 INFO L273 TraceCheckUtils]: 5: Hoare triple {55667#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {55669#(= main_~i~0 0)} is VALID [2018-11-23 11:58:08,497 INFO L273 TraceCheckUtils]: 6: Hoare triple {55669#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55669#(= main_~i~0 0)} is VALID [2018-11-23 11:58:08,497 INFO L273 TraceCheckUtils]: 7: Hoare triple {55669#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55669#(= main_~i~0 0)} is VALID [2018-11-23 11:58:08,498 INFO L273 TraceCheckUtils]: 8: Hoare triple {55669#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {55670#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:08,498 INFO L273 TraceCheckUtils]: 9: Hoare triple {55670#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55670#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:08,499 INFO L273 TraceCheckUtils]: 10: Hoare triple {55670#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55670#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:08,499 INFO L273 TraceCheckUtils]: 11: Hoare triple {55670#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {55671#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:08,499 INFO L273 TraceCheckUtils]: 12: Hoare triple {55671#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55671#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:08,500 INFO L273 TraceCheckUtils]: 13: Hoare triple {55671#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55671#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:08,500 INFO L273 TraceCheckUtils]: 14: Hoare triple {55671#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {55672#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:08,500 INFO L273 TraceCheckUtils]: 15: Hoare triple {55672#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55672#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:08,501 INFO L273 TraceCheckUtils]: 16: Hoare triple {55672#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55672#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:08,501 INFO L273 TraceCheckUtils]: 17: Hoare triple {55672#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {55673#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:08,502 INFO L273 TraceCheckUtils]: 18: Hoare triple {55673#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55673#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:08,502 INFO L273 TraceCheckUtils]: 19: Hoare triple {55673#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55673#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:08,503 INFO L273 TraceCheckUtils]: 20: Hoare triple {55673#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {55674#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:08,503 INFO L273 TraceCheckUtils]: 21: Hoare triple {55674#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55674#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:08,504 INFO L273 TraceCheckUtils]: 22: Hoare triple {55674#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55674#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:08,504 INFO L273 TraceCheckUtils]: 23: Hoare triple {55674#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {55675#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:08,505 INFO L273 TraceCheckUtils]: 24: Hoare triple {55675#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55675#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:08,505 INFO L273 TraceCheckUtils]: 25: Hoare triple {55675#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55675#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:08,506 INFO L273 TraceCheckUtils]: 26: Hoare triple {55675#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {55676#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:08,506 INFO L273 TraceCheckUtils]: 27: Hoare triple {55676#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55676#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:08,507 INFO L273 TraceCheckUtils]: 28: Hoare triple {55676#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55676#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:08,507 INFO L273 TraceCheckUtils]: 29: Hoare triple {55676#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {55677#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:08,508 INFO L273 TraceCheckUtils]: 30: Hoare triple {55677#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55677#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:08,508 INFO L273 TraceCheckUtils]: 31: Hoare triple {55677#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55677#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:08,509 INFO L273 TraceCheckUtils]: 32: Hoare triple {55677#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {55678#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:08,510 INFO L273 TraceCheckUtils]: 33: Hoare triple {55678#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55678#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:08,510 INFO L273 TraceCheckUtils]: 34: Hoare triple {55678#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55678#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:08,511 INFO L273 TraceCheckUtils]: 35: Hoare triple {55678#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {55679#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:08,511 INFO L273 TraceCheckUtils]: 36: Hoare triple {55679#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55679#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:08,512 INFO L273 TraceCheckUtils]: 37: Hoare triple {55679#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55679#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:08,512 INFO L273 TraceCheckUtils]: 38: Hoare triple {55679#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {55680#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:08,513 INFO L273 TraceCheckUtils]: 39: Hoare triple {55680#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55680#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:08,513 INFO L273 TraceCheckUtils]: 40: Hoare triple {55680#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55680#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:08,514 INFO L273 TraceCheckUtils]: 41: Hoare triple {55680#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {55681#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:08,514 INFO L273 TraceCheckUtils]: 42: Hoare triple {55681#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55681#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:08,515 INFO L273 TraceCheckUtils]: 43: Hoare triple {55681#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55681#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:08,515 INFO L273 TraceCheckUtils]: 44: Hoare triple {55681#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {55682#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:08,516 INFO L273 TraceCheckUtils]: 45: Hoare triple {55682#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55682#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:08,516 INFO L273 TraceCheckUtils]: 46: Hoare triple {55682#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55682#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:08,517 INFO L273 TraceCheckUtils]: 47: Hoare triple {55682#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {55683#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:08,517 INFO L273 TraceCheckUtils]: 48: Hoare triple {55683#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55683#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:08,518 INFO L273 TraceCheckUtils]: 49: Hoare triple {55683#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55683#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:08,519 INFO L273 TraceCheckUtils]: 50: Hoare triple {55683#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {55684#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:08,519 INFO L273 TraceCheckUtils]: 51: Hoare triple {55684#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55684#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:08,520 INFO L273 TraceCheckUtils]: 52: Hoare triple {55684#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55684#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:08,520 INFO L273 TraceCheckUtils]: 53: Hoare triple {55684#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {55685#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:08,521 INFO L273 TraceCheckUtils]: 54: Hoare triple {55685#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55685#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:08,521 INFO L273 TraceCheckUtils]: 55: Hoare triple {55685#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55685#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:08,522 INFO L273 TraceCheckUtils]: 56: Hoare triple {55685#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {55686#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:08,522 INFO L273 TraceCheckUtils]: 57: Hoare triple {55686#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55686#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:08,523 INFO L273 TraceCheckUtils]: 58: Hoare triple {55686#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55686#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:08,523 INFO L273 TraceCheckUtils]: 59: Hoare triple {55686#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {55687#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:08,524 INFO L273 TraceCheckUtils]: 60: Hoare triple {55687#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55687#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:08,524 INFO L273 TraceCheckUtils]: 61: Hoare triple {55687#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55687#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:08,525 INFO L273 TraceCheckUtils]: 62: Hoare triple {55687#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {55688#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:08,525 INFO L273 TraceCheckUtils]: 63: Hoare triple {55688#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55688#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:08,526 INFO L273 TraceCheckUtils]: 64: Hoare triple {55688#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55688#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:08,527 INFO L273 TraceCheckUtils]: 65: Hoare triple {55688#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {55689#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:08,527 INFO L273 TraceCheckUtils]: 66: Hoare triple {55689#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55689#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:08,527 INFO L273 TraceCheckUtils]: 67: Hoare triple {55689#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55689#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:08,528 INFO L273 TraceCheckUtils]: 68: Hoare triple {55689#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {55690#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:08,529 INFO L273 TraceCheckUtils]: 69: Hoare triple {55690#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55690#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:08,529 INFO L273 TraceCheckUtils]: 70: Hoare triple {55690#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55690#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:08,530 INFO L273 TraceCheckUtils]: 71: Hoare triple {55690#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {55691#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:08,530 INFO L273 TraceCheckUtils]: 72: Hoare triple {55691#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55691#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:08,531 INFO L273 TraceCheckUtils]: 73: Hoare triple {55691#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55691#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:08,531 INFO L273 TraceCheckUtils]: 74: Hoare triple {55691#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {55692#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:08,532 INFO L273 TraceCheckUtils]: 75: Hoare triple {55692#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55692#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:08,532 INFO L273 TraceCheckUtils]: 76: Hoare triple {55692#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55692#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:08,533 INFO L273 TraceCheckUtils]: 77: Hoare triple {55692#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {55693#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:08,533 INFO L273 TraceCheckUtils]: 78: Hoare triple {55693#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55693#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:08,534 INFO L273 TraceCheckUtils]: 79: Hoare triple {55693#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55693#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:08,534 INFO L273 TraceCheckUtils]: 80: Hoare triple {55693#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {55694#(<= main_~i~0 25)} is VALID [2018-11-23 11:58:08,535 INFO L273 TraceCheckUtils]: 81: Hoare triple {55694#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55694#(<= main_~i~0 25)} is VALID [2018-11-23 11:58:08,535 INFO L273 TraceCheckUtils]: 82: Hoare triple {55694#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55694#(<= main_~i~0 25)} is VALID [2018-11-23 11:58:08,536 INFO L273 TraceCheckUtils]: 83: Hoare triple {55694#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {55695#(<= main_~i~0 26)} is VALID [2018-11-23 11:58:08,537 INFO L273 TraceCheckUtils]: 84: Hoare triple {55695#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55695#(<= main_~i~0 26)} is VALID [2018-11-23 11:58:08,537 INFO L273 TraceCheckUtils]: 85: Hoare triple {55695#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55695#(<= main_~i~0 26)} is VALID [2018-11-23 11:58:08,538 INFO L273 TraceCheckUtils]: 86: Hoare triple {55695#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {55696#(<= main_~i~0 27)} is VALID [2018-11-23 11:58:08,538 INFO L273 TraceCheckUtils]: 87: Hoare triple {55696#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55696#(<= main_~i~0 27)} is VALID [2018-11-23 11:58:08,539 INFO L273 TraceCheckUtils]: 88: Hoare triple {55696#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55696#(<= main_~i~0 27)} is VALID [2018-11-23 11:58:08,539 INFO L273 TraceCheckUtils]: 89: Hoare triple {55696#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {55697#(<= main_~i~0 28)} is VALID [2018-11-23 11:58:08,540 INFO L273 TraceCheckUtils]: 90: Hoare triple {55697#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55697#(<= main_~i~0 28)} is VALID [2018-11-23 11:58:08,540 INFO L273 TraceCheckUtils]: 91: Hoare triple {55697#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55697#(<= main_~i~0 28)} is VALID [2018-11-23 11:58:08,541 INFO L273 TraceCheckUtils]: 92: Hoare triple {55697#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {55698#(<= main_~i~0 29)} is VALID [2018-11-23 11:58:08,541 INFO L273 TraceCheckUtils]: 93: Hoare triple {55698#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55698#(<= main_~i~0 29)} is VALID [2018-11-23 11:58:08,542 INFO L273 TraceCheckUtils]: 94: Hoare triple {55698#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55698#(<= main_~i~0 29)} is VALID [2018-11-23 11:58:08,542 INFO L273 TraceCheckUtils]: 95: Hoare triple {55698#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {55699#(<= main_~i~0 30)} is VALID [2018-11-23 11:58:08,543 INFO L273 TraceCheckUtils]: 96: Hoare triple {55699#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55699#(<= main_~i~0 30)} is VALID [2018-11-23 11:58:08,543 INFO L273 TraceCheckUtils]: 97: Hoare triple {55699#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55699#(<= main_~i~0 30)} is VALID [2018-11-23 11:58:08,544 INFO L273 TraceCheckUtils]: 98: Hoare triple {55699#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {55700#(<= main_~i~0 31)} is VALID [2018-11-23 11:58:08,545 INFO L273 TraceCheckUtils]: 99: Hoare triple {55700#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55700#(<= main_~i~0 31)} is VALID [2018-11-23 11:58:08,545 INFO L273 TraceCheckUtils]: 100: Hoare triple {55700#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55700#(<= main_~i~0 31)} is VALID [2018-11-23 11:58:08,546 INFO L273 TraceCheckUtils]: 101: Hoare triple {55700#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {55701#(<= main_~i~0 32)} is VALID [2018-11-23 11:58:08,546 INFO L273 TraceCheckUtils]: 102: Hoare triple {55701#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55701#(<= main_~i~0 32)} is VALID [2018-11-23 11:58:08,547 INFO L273 TraceCheckUtils]: 103: Hoare triple {55701#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55701#(<= main_~i~0 32)} is VALID [2018-11-23 11:58:08,547 INFO L273 TraceCheckUtils]: 104: Hoare triple {55701#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {55702#(<= main_~i~0 33)} is VALID [2018-11-23 11:58:08,548 INFO L273 TraceCheckUtils]: 105: Hoare triple {55702#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55702#(<= main_~i~0 33)} is VALID [2018-11-23 11:58:08,548 INFO L273 TraceCheckUtils]: 106: Hoare triple {55702#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55702#(<= main_~i~0 33)} is VALID [2018-11-23 11:58:08,549 INFO L273 TraceCheckUtils]: 107: Hoare triple {55702#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {55703#(<= main_~i~0 34)} is VALID [2018-11-23 11:58:08,550 INFO L273 TraceCheckUtils]: 108: Hoare triple {55703#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55703#(<= main_~i~0 34)} is VALID [2018-11-23 11:58:08,550 INFO L273 TraceCheckUtils]: 109: Hoare triple {55703#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55703#(<= main_~i~0 34)} is VALID [2018-11-23 11:58:08,551 INFO L273 TraceCheckUtils]: 110: Hoare triple {55703#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {55704#(<= main_~i~0 35)} is VALID [2018-11-23 11:58:08,551 INFO L273 TraceCheckUtils]: 111: Hoare triple {55704#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55704#(<= main_~i~0 35)} is VALID [2018-11-23 11:58:08,552 INFO L273 TraceCheckUtils]: 112: Hoare triple {55704#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55704#(<= main_~i~0 35)} is VALID [2018-11-23 11:58:08,552 INFO L273 TraceCheckUtils]: 113: Hoare triple {55704#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {55705#(<= main_~i~0 36)} is VALID [2018-11-23 11:58:08,553 INFO L273 TraceCheckUtils]: 114: Hoare triple {55705#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55705#(<= main_~i~0 36)} is VALID [2018-11-23 11:58:08,553 INFO L273 TraceCheckUtils]: 115: Hoare triple {55705#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55705#(<= main_~i~0 36)} is VALID [2018-11-23 11:58:08,554 INFO L273 TraceCheckUtils]: 116: Hoare triple {55705#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {55706#(<= main_~i~0 37)} is VALID [2018-11-23 11:58:08,555 INFO L273 TraceCheckUtils]: 117: Hoare triple {55706#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55706#(<= main_~i~0 37)} is VALID [2018-11-23 11:58:08,555 INFO L273 TraceCheckUtils]: 118: Hoare triple {55706#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55706#(<= main_~i~0 37)} is VALID [2018-11-23 11:58:08,556 INFO L273 TraceCheckUtils]: 119: Hoare triple {55706#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {55707#(<= main_~i~0 38)} is VALID [2018-11-23 11:58:08,556 INFO L273 TraceCheckUtils]: 120: Hoare triple {55707#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55707#(<= main_~i~0 38)} is VALID [2018-11-23 11:58:08,557 INFO L273 TraceCheckUtils]: 121: Hoare triple {55707#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55707#(<= main_~i~0 38)} is VALID [2018-11-23 11:58:08,558 INFO L273 TraceCheckUtils]: 122: Hoare triple {55707#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {55708#(<= main_~i~0 39)} is VALID [2018-11-23 11:58:08,558 INFO L273 TraceCheckUtils]: 123: Hoare triple {55708#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55708#(<= main_~i~0 39)} is VALID [2018-11-23 11:58:08,559 INFO L273 TraceCheckUtils]: 124: Hoare triple {55708#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55708#(<= main_~i~0 39)} is VALID [2018-11-23 11:58:08,559 INFO L273 TraceCheckUtils]: 125: Hoare triple {55708#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {55709#(<= main_~i~0 40)} is VALID [2018-11-23 11:58:08,560 INFO L273 TraceCheckUtils]: 126: Hoare triple {55709#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55709#(<= main_~i~0 40)} is VALID [2018-11-23 11:58:08,560 INFO L273 TraceCheckUtils]: 127: Hoare triple {55709#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55709#(<= main_~i~0 40)} is VALID [2018-11-23 11:58:08,561 INFO L273 TraceCheckUtils]: 128: Hoare triple {55709#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {55710#(<= main_~i~0 41)} is VALID [2018-11-23 11:58:08,562 INFO L273 TraceCheckUtils]: 129: Hoare triple {55710#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55710#(<= main_~i~0 41)} is VALID [2018-11-23 11:58:08,562 INFO L273 TraceCheckUtils]: 130: Hoare triple {55710#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55710#(<= main_~i~0 41)} is VALID [2018-11-23 11:58:08,563 INFO L273 TraceCheckUtils]: 131: Hoare triple {55710#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {55711#(<= main_~i~0 42)} is VALID [2018-11-23 11:58:08,563 INFO L273 TraceCheckUtils]: 132: Hoare triple {55711#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55711#(<= main_~i~0 42)} is VALID [2018-11-23 11:58:08,564 INFO L273 TraceCheckUtils]: 133: Hoare triple {55711#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55711#(<= main_~i~0 42)} is VALID [2018-11-23 11:58:08,564 INFO L273 TraceCheckUtils]: 134: Hoare triple {55711#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {55712#(<= main_~i~0 43)} is VALID [2018-11-23 11:58:08,565 INFO L273 TraceCheckUtils]: 135: Hoare triple {55712#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55712#(<= main_~i~0 43)} is VALID [2018-11-23 11:58:08,565 INFO L273 TraceCheckUtils]: 136: Hoare triple {55712#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55712#(<= main_~i~0 43)} is VALID [2018-11-23 11:58:08,566 INFO L273 TraceCheckUtils]: 137: Hoare triple {55712#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {55713#(<= main_~i~0 44)} is VALID [2018-11-23 11:58:08,567 INFO L273 TraceCheckUtils]: 138: Hoare triple {55713#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55713#(<= main_~i~0 44)} is VALID [2018-11-23 11:58:08,567 INFO L273 TraceCheckUtils]: 139: Hoare triple {55713#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55713#(<= main_~i~0 44)} is VALID [2018-11-23 11:58:08,568 INFO L273 TraceCheckUtils]: 140: Hoare triple {55713#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {55714#(<= main_~i~0 45)} is VALID [2018-11-23 11:58:08,568 INFO L273 TraceCheckUtils]: 141: Hoare triple {55714#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55714#(<= main_~i~0 45)} is VALID [2018-11-23 11:58:08,569 INFO L273 TraceCheckUtils]: 142: Hoare triple {55714#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55714#(<= main_~i~0 45)} is VALID [2018-11-23 11:58:08,570 INFO L273 TraceCheckUtils]: 143: Hoare triple {55714#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {55715#(<= main_~i~0 46)} is VALID [2018-11-23 11:58:08,570 INFO L273 TraceCheckUtils]: 144: Hoare triple {55715#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55715#(<= main_~i~0 46)} is VALID [2018-11-23 11:58:08,571 INFO L273 TraceCheckUtils]: 145: Hoare triple {55715#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55715#(<= main_~i~0 46)} is VALID [2018-11-23 11:58:08,571 INFO L273 TraceCheckUtils]: 146: Hoare triple {55715#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {55716#(<= main_~i~0 47)} is VALID [2018-11-23 11:58:08,572 INFO L273 TraceCheckUtils]: 147: Hoare triple {55716#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55716#(<= main_~i~0 47)} is VALID [2018-11-23 11:58:08,572 INFO L273 TraceCheckUtils]: 148: Hoare triple {55716#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55716#(<= main_~i~0 47)} is VALID [2018-11-23 11:58:08,573 INFO L273 TraceCheckUtils]: 149: Hoare triple {55716#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {55717#(<= main_~i~0 48)} is VALID [2018-11-23 11:58:08,574 INFO L273 TraceCheckUtils]: 150: Hoare triple {55717#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55717#(<= main_~i~0 48)} is VALID [2018-11-23 11:58:08,574 INFO L273 TraceCheckUtils]: 151: Hoare triple {55717#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55717#(<= main_~i~0 48)} is VALID [2018-11-23 11:58:08,575 INFO L273 TraceCheckUtils]: 152: Hoare triple {55717#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {55718#(<= main_~i~0 49)} is VALID [2018-11-23 11:58:08,575 INFO L273 TraceCheckUtils]: 153: Hoare triple {55718#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55718#(<= main_~i~0 49)} is VALID [2018-11-23 11:58:08,576 INFO L273 TraceCheckUtils]: 154: Hoare triple {55718#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55718#(<= main_~i~0 49)} is VALID [2018-11-23 11:58:08,577 INFO L273 TraceCheckUtils]: 155: Hoare triple {55718#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {55719#(<= main_~i~0 50)} is VALID [2018-11-23 11:58:08,577 INFO L273 TraceCheckUtils]: 156: Hoare triple {55719#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55719#(<= main_~i~0 50)} is VALID [2018-11-23 11:58:08,577 INFO L273 TraceCheckUtils]: 157: Hoare triple {55719#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55719#(<= main_~i~0 50)} is VALID [2018-11-23 11:58:08,578 INFO L273 TraceCheckUtils]: 158: Hoare triple {55719#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {55720#(<= main_~i~0 51)} is VALID [2018-11-23 11:58:08,579 INFO L273 TraceCheckUtils]: 159: Hoare triple {55720#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55720#(<= main_~i~0 51)} is VALID [2018-11-23 11:58:08,579 INFO L273 TraceCheckUtils]: 160: Hoare triple {55720#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55720#(<= main_~i~0 51)} is VALID [2018-11-23 11:58:08,580 INFO L273 TraceCheckUtils]: 161: Hoare triple {55720#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {55721#(<= main_~i~0 52)} is VALID [2018-11-23 11:58:08,580 INFO L273 TraceCheckUtils]: 162: Hoare triple {55721#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55721#(<= main_~i~0 52)} is VALID [2018-11-23 11:58:08,581 INFO L273 TraceCheckUtils]: 163: Hoare triple {55721#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55721#(<= main_~i~0 52)} is VALID [2018-11-23 11:58:08,582 INFO L273 TraceCheckUtils]: 164: Hoare triple {55721#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {55722#(<= main_~i~0 53)} is VALID [2018-11-23 11:58:08,582 INFO L273 TraceCheckUtils]: 165: Hoare triple {55722#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55722#(<= main_~i~0 53)} is VALID [2018-11-23 11:58:08,583 INFO L273 TraceCheckUtils]: 166: Hoare triple {55722#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55722#(<= main_~i~0 53)} is VALID [2018-11-23 11:58:08,583 INFO L273 TraceCheckUtils]: 167: Hoare triple {55722#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {55723#(<= main_~i~0 54)} is VALID [2018-11-23 11:58:08,584 INFO L273 TraceCheckUtils]: 168: Hoare triple {55723#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55723#(<= main_~i~0 54)} is VALID [2018-11-23 11:58:08,584 INFO L273 TraceCheckUtils]: 169: Hoare triple {55723#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55723#(<= main_~i~0 54)} is VALID [2018-11-23 11:58:08,585 INFO L273 TraceCheckUtils]: 170: Hoare triple {55723#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {55724#(<= main_~i~0 55)} is VALID [2018-11-23 11:58:08,585 INFO L273 TraceCheckUtils]: 171: Hoare triple {55724#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55724#(<= main_~i~0 55)} is VALID [2018-11-23 11:58:08,586 INFO L273 TraceCheckUtils]: 172: Hoare triple {55724#(<= main_~i~0 55)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55724#(<= main_~i~0 55)} is VALID [2018-11-23 11:58:08,587 INFO L273 TraceCheckUtils]: 173: Hoare triple {55724#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {55725#(<= main_~i~0 56)} is VALID [2018-11-23 11:58:08,587 INFO L273 TraceCheckUtils]: 174: Hoare triple {55725#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55725#(<= main_~i~0 56)} is VALID [2018-11-23 11:58:08,588 INFO L273 TraceCheckUtils]: 175: Hoare triple {55725#(<= main_~i~0 56)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55725#(<= main_~i~0 56)} is VALID [2018-11-23 11:58:08,588 INFO L273 TraceCheckUtils]: 176: Hoare triple {55725#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {55726#(<= main_~i~0 57)} is VALID [2018-11-23 11:58:08,589 INFO L273 TraceCheckUtils]: 177: Hoare triple {55726#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55726#(<= main_~i~0 57)} is VALID [2018-11-23 11:58:08,589 INFO L273 TraceCheckUtils]: 178: Hoare triple {55726#(<= main_~i~0 57)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55726#(<= main_~i~0 57)} is VALID [2018-11-23 11:58:08,590 INFO L273 TraceCheckUtils]: 179: Hoare triple {55726#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {55727#(<= main_~i~0 58)} is VALID [2018-11-23 11:58:08,591 INFO L273 TraceCheckUtils]: 180: Hoare triple {55727#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55727#(<= main_~i~0 58)} is VALID [2018-11-23 11:58:08,591 INFO L273 TraceCheckUtils]: 181: Hoare triple {55727#(<= main_~i~0 58)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55727#(<= main_~i~0 58)} is VALID [2018-11-23 11:58:08,592 INFO L273 TraceCheckUtils]: 182: Hoare triple {55727#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {55728#(<= main_~i~0 59)} is VALID [2018-11-23 11:58:08,592 INFO L273 TraceCheckUtils]: 183: Hoare triple {55728#(<= main_~i~0 59)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55728#(<= main_~i~0 59)} is VALID [2018-11-23 11:58:08,593 INFO L273 TraceCheckUtils]: 184: Hoare triple {55728#(<= main_~i~0 59)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55728#(<= main_~i~0 59)} is VALID [2018-11-23 11:58:08,593 INFO L273 TraceCheckUtils]: 185: Hoare triple {55728#(<= main_~i~0 59)} ~i~0 := 1 + ~i~0; {55729#(<= main_~i~0 60)} is VALID [2018-11-23 11:58:08,594 INFO L273 TraceCheckUtils]: 186: Hoare triple {55729#(<= main_~i~0 60)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55729#(<= main_~i~0 60)} is VALID [2018-11-23 11:58:08,594 INFO L273 TraceCheckUtils]: 187: Hoare triple {55729#(<= main_~i~0 60)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55729#(<= main_~i~0 60)} is VALID [2018-11-23 11:58:08,595 INFO L273 TraceCheckUtils]: 188: Hoare triple {55729#(<= main_~i~0 60)} ~i~0 := 1 + ~i~0; {55730#(<= main_~i~0 61)} is VALID [2018-11-23 11:58:08,596 INFO L273 TraceCheckUtils]: 189: Hoare triple {55730#(<= main_~i~0 61)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55730#(<= main_~i~0 61)} is VALID [2018-11-23 11:58:08,596 INFO L273 TraceCheckUtils]: 190: Hoare triple {55730#(<= main_~i~0 61)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55730#(<= main_~i~0 61)} is VALID [2018-11-23 11:58:08,597 INFO L273 TraceCheckUtils]: 191: Hoare triple {55730#(<= main_~i~0 61)} ~i~0 := 1 + ~i~0; {55731#(<= main_~i~0 62)} is VALID [2018-11-23 11:58:08,597 INFO L273 TraceCheckUtils]: 192: Hoare triple {55731#(<= main_~i~0 62)} assume !(~i~0 < 100000); {55668#false} is VALID [2018-11-23 11:58:08,598 INFO L273 TraceCheckUtils]: 193: Hoare triple {55668#false} havoc ~x~0;~x~0 := 0; {55668#false} is VALID [2018-11-23 11:58:08,598 INFO L273 TraceCheckUtils]: 194: Hoare triple {55668#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {55668#false} is VALID [2018-11-23 11:58:08,598 INFO L256 TraceCheckUtils]: 195: Hoare triple {55668#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {55668#false} is VALID [2018-11-23 11:58:08,598 INFO L273 TraceCheckUtils]: 196: Hoare triple {55668#false} ~cond := #in~cond; {55668#false} is VALID [2018-11-23 11:58:08,598 INFO L273 TraceCheckUtils]: 197: Hoare triple {55668#false} assume 0 == ~cond; {55668#false} is VALID [2018-11-23 11:58:08,598 INFO L273 TraceCheckUtils]: 198: Hoare triple {55668#false} assume !false; {55668#false} is VALID [2018-11-23 11:58:08,625 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:08,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:08,625 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:08,634 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:58:08,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:58:08,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:08,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:09,226 INFO L256 TraceCheckUtils]: 0: Hoare triple {55667#true} call ULTIMATE.init(); {55667#true} is VALID [2018-11-23 11:58:09,226 INFO L273 TraceCheckUtils]: 1: Hoare triple {55667#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {55667#true} is VALID [2018-11-23 11:58:09,226 INFO L273 TraceCheckUtils]: 2: Hoare triple {55667#true} assume true; {55667#true} is VALID [2018-11-23 11:58:09,227 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {55667#true} {55667#true} #55#return; {55667#true} is VALID [2018-11-23 11:58:09,227 INFO L256 TraceCheckUtils]: 4: Hoare triple {55667#true} call #t~ret4 := main(); {55667#true} is VALID [2018-11-23 11:58:09,227 INFO L273 TraceCheckUtils]: 5: Hoare triple {55667#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {55750#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:09,228 INFO L273 TraceCheckUtils]: 6: Hoare triple {55750#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55750#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:09,228 INFO L273 TraceCheckUtils]: 7: Hoare triple {55750#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55750#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:09,228 INFO L273 TraceCheckUtils]: 8: Hoare triple {55750#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {55670#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:09,229 INFO L273 TraceCheckUtils]: 9: Hoare triple {55670#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55670#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:09,229 INFO L273 TraceCheckUtils]: 10: Hoare triple {55670#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55670#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:09,230 INFO L273 TraceCheckUtils]: 11: Hoare triple {55670#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {55671#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:09,230 INFO L273 TraceCheckUtils]: 12: Hoare triple {55671#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55671#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:09,231 INFO L273 TraceCheckUtils]: 13: Hoare triple {55671#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55671#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:09,231 INFO L273 TraceCheckUtils]: 14: Hoare triple {55671#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {55672#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:09,232 INFO L273 TraceCheckUtils]: 15: Hoare triple {55672#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55672#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:09,232 INFO L273 TraceCheckUtils]: 16: Hoare triple {55672#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55672#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:09,233 INFO L273 TraceCheckUtils]: 17: Hoare triple {55672#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {55673#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:09,233 INFO L273 TraceCheckUtils]: 18: Hoare triple {55673#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55673#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:09,234 INFO L273 TraceCheckUtils]: 19: Hoare triple {55673#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55673#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:09,235 INFO L273 TraceCheckUtils]: 20: Hoare triple {55673#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {55674#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:09,235 INFO L273 TraceCheckUtils]: 21: Hoare triple {55674#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55674#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:09,236 INFO L273 TraceCheckUtils]: 22: Hoare triple {55674#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55674#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:09,236 INFO L273 TraceCheckUtils]: 23: Hoare triple {55674#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {55675#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:09,237 INFO L273 TraceCheckUtils]: 24: Hoare triple {55675#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55675#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:09,237 INFO L273 TraceCheckUtils]: 25: Hoare triple {55675#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55675#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:09,238 INFO L273 TraceCheckUtils]: 26: Hoare triple {55675#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {55676#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:09,239 INFO L273 TraceCheckUtils]: 27: Hoare triple {55676#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55676#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:09,239 INFO L273 TraceCheckUtils]: 28: Hoare triple {55676#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55676#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:09,240 INFO L273 TraceCheckUtils]: 29: Hoare triple {55676#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {55677#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:09,240 INFO L273 TraceCheckUtils]: 30: Hoare triple {55677#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55677#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:09,241 INFO L273 TraceCheckUtils]: 31: Hoare triple {55677#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55677#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:09,241 INFO L273 TraceCheckUtils]: 32: Hoare triple {55677#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {55678#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:09,242 INFO L273 TraceCheckUtils]: 33: Hoare triple {55678#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55678#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:09,242 INFO L273 TraceCheckUtils]: 34: Hoare triple {55678#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55678#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:09,243 INFO L273 TraceCheckUtils]: 35: Hoare triple {55678#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {55679#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:09,244 INFO L273 TraceCheckUtils]: 36: Hoare triple {55679#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55679#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:09,244 INFO L273 TraceCheckUtils]: 37: Hoare triple {55679#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55679#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:09,245 INFO L273 TraceCheckUtils]: 38: Hoare triple {55679#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {55680#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:09,245 INFO L273 TraceCheckUtils]: 39: Hoare triple {55680#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55680#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:09,246 INFO L273 TraceCheckUtils]: 40: Hoare triple {55680#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55680#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:09,247 INFO L273 TraceCheckUtils]: 41: Hoare triple {55680#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {55681#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:09,247 INFO L273 TraceCheckUtils]: 42: Hoare triple {55681#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55681#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:09,248 INFO L273 TraceCheckUtils]: 43: Hoare triple {55681#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55681#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:09,248 INFO L273 TraceCheckUtils]: 44: Hoare triple {55681#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {55682#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:09,249 INFO L273 TraceCheckUtils]: 45: Hoare triple {55682#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55682#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:09,249 INFO L273 TraceCheckUtils]: 46: Hoare triple {55682#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55682#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:09,250 INFO L273 TraceCheckUtils]: 47: Hoare triple {55682#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {55683#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:09,250 INFO L273 TraceCheckUtils]: 48: Hoare triple {55683#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55683#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:09,251 INFO L273 TraceCheckUtils]: 49: Hoare triple {55683#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55683#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:09,252 INFO L273 TraceCheckUtils]: 50: Hoare triple {55683#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {55684#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:09,252 INFO L273 TraceCheckUtils]: 51: Hoare triple {55684#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55684#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:09,253 INFO L273 TraceCheckUtils]: 52: Hoare triple {55684#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55684#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:09,253 INFO L273 TraceCheckUtils]: 53: Hoare triple {55684#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {55685#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:09,254 INFO L273 TraceCheckUtils]: 54: Hoare triple {55685#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55685#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:09,254 INFO L273 TraceCheckUtils]: 55: Hoare triple {55685#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55685#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:09,255 INFO L273 TraceCheckUtils]: 56: Hoare triple {55685#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {55686#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:09,256 INFO L273 TraceCheckUtils]: 57: Hoare triple {55686#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55686#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:09,256 INFO L273 TraceCheckUtils]: 58: Hoare triple {55686#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55686#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:09,257 INFO L273 TraceCheckUtils]: 59: Hoare triple {55686#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {55687#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:09,257 INFO L273 TraceCheckUtils]: 60: Hoare triple {55687#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55687#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:09,258 INFO L273 TraceCheckUtils]: 61: Hoare triple {55687#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55687#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:09,258 INFO L273 TraceCheckUtils]: 62: Hoare triple {55687#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {55688#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:09,259 INFO L273 TraceCheckUtils]: 63: Hoare triple {55688#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55688#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:09,259 INFO L273 TraceCheckUtils]: 64: Hoare triple {55688#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55688#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:09,260 INFO L273 TraceCheckUtils]: 65: Hoare triple {55688#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {55689#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:09,261 INFO L273 TraceCheckUtils]: 66: Hoare triple {55689#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55689#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:09,261 INFO L273 TraceCheckUtils]: 67: Hoare triple {55689#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55689#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:09,262 INFO L273 TraceCheckUtils]: 68: Hoare triple {55689#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {55690#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:09,262 INFO L273 TraceCheckUtils]: 69: Hoare triple {55690#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55690#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:09,263 INFO L273 TraceCheckUtils]: 70: Hoare triple {55690#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55690#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:09,263 INFO L273 TraceCheckUtils]: 71: Hoare triple {55690#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {55691#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:09,264 INFO L273 TraceCheckUtils]: 72: Hoare triple {55691#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55691#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:09,264 INFO L273 TraceCheckUtils]: 73: Hoare triple {55691#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55691#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:09,265 INFO L273 TraceCheckUtils]: 74: Hoare triple {55691#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {55692#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:09,266 INFO L273 TraceCheckUtils]: 75: Hoare triple {55692#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55692#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:09,266 INFO L273 TraceCheckUtils]: 76: Hoare triple {55692#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55692#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:09,267 INFO L273 TraceCheckUtils]: 77: Hoare triple {55692#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {55693#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:09,267 INFO L273 TraceCheckUtils]: 78: Hoare triple {55693#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55693#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:09,268 INFO L273 TraceCheckUtils]: 79: Hoare triple {55693#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55693#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:09,269 INFO L273 TraceCheckUtils]: 80: Hoare triple {55693#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {55694#(<= main_~i~0 25)} is VALID [2018-11-23 11:58:09,269 INFO L273 TraceCheckUtils]: 81: Hoare triple {55694#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55694#(<= main_~i~0 25)} is VALID [2018-11-23 11:58:09,270 INFO L273 TraceCheckUtils]: 82: Hoare triple {55694#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55694#(<= main_~i~0 25)} is VALID [2018-11-23 11:58:09,270 INFO L273 TraceCheckUtils]: 83: Hoare triple {55694#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {55695#(<= main_~i~0 26)} is VALID [2018-11-23 11:58:09,271 INFO L273 TraceCheckUtils]: 84: Hoare triple {55695#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55695#(<= main_~i~0 26)} is VALID [2018-11-23 11:58:09,271 INFO L273 TraceCheckUtils]: 85: Hoare triple {55695#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55695#(<= main_~i~0 26)} is VALID [2018-11-23 11:58:09,272 INFO L273 TraceCheckUtils]: 86: Hoare triple {55695#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {55696#(<= main_~i~0 27)} is VALID [2018-11-23 11:58:09,272 INFO L273 TraceCheckUtils]: 87: Hoare triple {55696#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55696#(<= main_~i~0 27)} is VALID [2018-11-23 11:58:09,273 INFO L273 TraceCheckUtils]: 88: Hoare triple {55696#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55696#(<= main_~i~0 27)} is VALID [2018-11-23 11:58:09,274 INFO L273 TraceCheckUtils]: 89: Hoare triple {55696#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {55697#(<= main_~i~0 28)} is VALID [2018-11-23 11:58:09,274 INFO L273 TraceCheckUtils]: 90: Hoare triple {55697#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55697#(<= main_~i~0 28)} is VALID [2018-11-23 11:58:09,275 INFO L273 TraceCheckUtils]: 91: Hoare triple {55697#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55697#(<= main_~i~0 28)} is VALID [2018-11-23 11:58:09,275 INFO L273 TraceCheckUtils]: 92: Hoare triple {55697#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {55698#(<= main_~i~0 29)} is VALID [2018-11-23 11:58:09,276 INFO L273 TraceCheckUtils]: 93: Hoare triple {55698#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55698#(<= main_~i~0 29)} is VALID [2018-11-23 11:58:09,276 INFO L273 TraceCheckUtils]: 94: Hoare triple {55698#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55698#(<= main_~i~0 29)} is VALID [2018-11-23 11:58:09,277 INFO L273 TraceCheckUtils]: 95: Hoare triple {55698#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {55699#(<= main_~i~0 30)} is VALID [2018-11-23 11:58:09,278 INFO L273 TraceCheckUtils]: 96: Hoare triple {55699#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55699#(<= main_~i~0 30)} is VALID [2018-11-23 11:58:09,278 INFO L273 TraceCheckUtils]: 97: Hoare triple {55699#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55699#(<= main_~i~0 30)} is VALID [2018-11-23 11:58:09,279 INFO L273 TraceCheckUtils]: 98: Hoare triple {55699#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {55700#(<= main_~i~0 31)} is VALID [2018-11-23 11:58:09,279 INFO L273 TraceCheckUtils]: 99: Hoare triple {55700#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55700#(<= main_~i~0 31)} is VALID [2018-11-23 11:58:09,280 INFO L273 TraceCheckUtils]: 100: Hoare triple {55700#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55700#(<= main_~i~0 31)} is VALID [2018-11-23 11:58:09,280 INFO L273 TraceCheckUtils]: 101: Hoare triple {55700#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {55701#(<= main_~i~0 32)} is VALID [2018-11-23 11:58:09,281 INFO L273 TraceCheckUtils]: 102: Hoare triple {55701#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55701#(<= main_~i~0 32)} is VALID [2018-11-23 11:58:09,281 INFO L273 TraceCheckUtils]: 103: Hoare triple {55701#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55701#(<= main_~i~0 32)} is VALID [2018-11-23 11:58:09,282 INFO L273 TraceCheckUtils]: 104: Hoare triple {55701#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {55702#(<= main_~i~0 33)} is VALID [2018-11-23 11:58:09,283 INFO L273 TraceCheckUtils]: 105: Hoare triple {55702#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55702#(<= main_~i~0 33)} is VALID [2018-11-23 11:58:09,283 INFO L273 TraceCheckUtils]: 106: Hoare triple {55702#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55702#(<= main_~i~0 33)} is VALID [2018-11-23 11:58:09,284 INFO L273 TraceCheckUtils]: 107: Hoare triple {55702#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {55703#(<= main_~i~0 34)} is VALID [2018-11-23 11:58:09,284 INFO L273 TraceCheckUtils]: 108: Hoare triple {55703#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55703#(<= main_~i~0 34)} is VALID [2018-11-23 11:58:09,285 INFO L273 TraceCheckUtils]: 109: Hoare triple {55703#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55703#(<= main_~i~0 34)} is VALID [2018-11-23 11:58:09,286 INFO L273 TraceCheckUtils]: 110: Hoare triple {55703#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {55704#(<= main_~i~0 35)} is VALID [2018-11-23 11:58:09,286 INFO L273 TraceCheckUtils]: 111: Hoare triple {55704#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55704#(<= main_~i~0 35)} is VALID [2018-11-23 11:58:09,286 INFO L273 TraceCheckUtils]: 112: Hoare triple {55704#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55704#(<= main_~i~0 35)} is VALID [2018-11-23 11:58:09,287 INFO L273 TraceCheckUtils]: 113: Hoare triple {55704#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {55705#(<= main_~i~0 36)} is VALID [2018-11-23 11:58:09,288 INFO L273 TraceCheckUtils]: 114: Hoare triple {55705#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55705#(<= main_~i~0 36)} is VALID [2018-11-23 11:58:09,288 INFO L273 TraceCheckUtils]: 115: Hoare triple {55705#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55705#(<= main_~i~0 36)} is VALID [2018-11-23 11:58:09,289 INFO L273 TraceCheckUtils]: 116: Hoare triple {55705#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {55706#(<= main_~i~0 37)} is VALID [2018-11-23 11:58:09,289 INFO L273 TraceCheckUtils]: 117: Hoare triple {55706#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55706#(<= main_~i~0 37)} is VALID [2018-11-23 11:58:09,290 INFO L273 TraceCheckUtils]: 118: Hoare triple {55706#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55706#(<= main_~i~0 37)} is VALID [2018-11-23 11:58:09,291 INFO L273 TraceCheckUtils]: 119: Hoare triple {55706#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {55707#(<= main_~i~0 38)} is VALID [2018-11-23 11:58:09,291 INFO L273 TraceCheckUtils]: 120: Hoare triple {55707#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55707#(<= main_~i~0 38)} is VALID [2018-11-23 11:58:09,292 INFO L273 TraceCheckUtils]: 121: Hoare triple {55707#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55707#(<= main_~i~0 38)} is VALID [2018-11-23 11:58:09,292 INFO L273 TraceCheckUtils]: 122: Hoare triple {55707#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {55708#(<= main_~i~0 39)} is VALID [2018-11-23 11:58:09,293 INFO L273 TraceCheckUtils]: 123: Hoare triple {55708#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55708#(<= main_~i~0 39)} is VALID [2018-11-23 11:58:09,293 INFO L273 TraceCheckUtils]: 124: Hoare triple {55708#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55708#(<= main_~i~0 39)} is VALID [2018-11-23 11:58:09,294 INFO L273 TraceCheckUtils]: 125: Hoare triple {55708#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {55709#(<= main_~i~0 40)} is VALID [2018-11-23 11:58:09,295 INFO L273 TraceCheckUtils]: 126: Hoare triple {55709#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55709#(<= main_~i~0 40)} is VALID [2018-11-23 11:58:09,295 INFO L273 TraceCheckUtils]: 127: Hoare triple {55709#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55709#(<= main_~i~0 40)} is VALID [2018-11-23 11:58:09,296 INFO L273 TraceCheckUtils]: 128: Hoare triple {55709#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {55710#(<= main_~i~0 41)} is VALID [2018-11-23 11:58:09,296 INFO L273 TraceCheckUtils]: 129: Hoare triple {55710#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55710#(<= main_~i~0 41)} is VALID [2018-11-23 11:58:09,297 INFO L273 TraceCheckUtils]: 130: Hoare triple {55710#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55710#(<= main_~i~0 41)} is VALID [2018-11-23 11:58:09,297 INFO L273 TraceCheckUtils]: 131: Hoare triple {55710#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {55711#(<= main_~i~0 42)} is VALID [2018-11-23 11:58:09,298 INFO L273 TraceCheckUtils]: 132: Hoare triple {55711#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55711#(<= main_~i~0 42)} is VALID [2018-11-23 11:58:09,298 INFO L273 TraceCheckUtils]: 133: Hoare triple {55711#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55711#(<= main_~i~0 42)} is VALID [2018-11-23 11:58:09,299 INFO L273 TraceCheckUtils]: 134: Hoare triple {55711#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {55712#(<= main_~i~0 43)} is VALID [2018-11-23 11:58:09,300 INFO L273 TraceCheckUtils]: 135: Hoare triple {55712#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55712#(<= main_~i~0 43)} is VALID [2018-11-23 11:58:09,300 INFO L273 TraceCheckUtils]: 136: Hoare triple {55712#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55712#(<= main_~i~0 43)} is VALID [2018-11-23 11:58:09,301 INFO L273 TraceCheckUtils]: 137: Hoare triple {55712#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {55713#(<= main_~i~0 44)} is VALID [2018-11-23 11:58:09,301 INFO L273 TraceCheckUtils]: 138: Hoare triple {55713#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55713#(<= main_~i~0 44)} is VALID [2018-11-23 11:58:09,302 INFO L273 TraceCheckUtils]: 139: Hoare triple {55713#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55713#(<= main_~i~0 44)} is VALID [2018-11-23 11:58:09,303 INFO L273 TraceCheckUtils]: 140: Hoare triple {55713#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {55714#(<= main_~i~0 45)} is VALID [2018-11-23 11:58:09,303 INFO L273 TraceCheckUtils]: 141: Hoare triple {55714#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55714#(<= main_~i~0 45)} is VALID [2018-11-23 11:58:09,303 INFO L273 TraceCheckUtils]: 142: Hoare triple {55714#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55714#(<= main_~i~0 45)} is VALID [2018-11-23 11:58:09,304 INFO L273 TraceCheckUtils]: 143: Hoare triple {55714#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {55715#(<= main_~i~0 46)} is VALID [2018-11-23 11:58:09,305 INFO L273 TraceCheckUtils]: 144: Hoare triple {55715#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55715#(<= main_~i~0 46)} is VALID [2018-11-23 11:58:09,305 INFO L273 TraceCheckUtils]: 145: Hoare triple {55715#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55715#(<= main_~i~0 46)} is VALID [2018-11-23 11:58:09,306 INFO L273 TraceCheckUtils]: 146: Hoare triple {55715#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {55716#(<= main_~i~0 47)} is VALID [2018-11-23 11:58:09,306 INFO L273 TraceCheckUtils]: 147: Hoare triple {55716#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55716#(<= main_~i~0 47)} is VALID [2018-11-23 11:58:09,307 INFO L273 TraceCheckUtils]: 148: Hoare triple {55716#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55716#(<= main_~i~0 47)} is VALID [2018-11-23 11:58:09,308 INFO L273 TraceCheckUtils]: 149: Hoare triple {55716#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {55717#(<= main_~i~0 48)} is VALID [2018-11-23 11:58:09,308 INFO L273 TraceCheckUtils]: 150: Hoare triple {55717#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55717#(<= main_~i~0 48)} is VALID [2018-11-23 11:58:09,309 INFO L273 TraceCheckUtils]: 151: Hoare triple {55717#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55717#(<= main_~i~0 48)} is VALID [2018-11-23 11:58:09,309 INFO L273 TraceCheckUtils]: 152: Hoare triple {55717#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {55718#(<= main_~i~0 49)} is VALID [2018-11-23 11:58:09,310 INFO L273 TraceCheckUtils]: 153: Hoare triple {55718#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55718#(<= main_~i~0 49)} is VALID [2018-11-23 11:58:09,310 INFO L273 TraceCheckUtils]: 154: Hoare triple {55718#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55718#(<= main_~i~0 49)} is VALID [2018-11-23 11:58:09,311 INFO L273 TraceCheckUtils]: 155: Hoare triple {55718#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {55719#(<= main_~i~0 50)} is VALID [2018-11-23 11:58:09,311 INFO L273 TraceCheckUtils]: 156: Hoare triple {55719#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55719#(<= main_~i~0 50)} is VALID [2018-11-23 11:58:09,312 INFO L273 TraceCheckUtils]: 157: Hoare triple {55719#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55719#(<= main_~i~0 50)} is VALID [2018-11-23 11:58:09,313 INFO L273 TraceCheckUtils]: 158: Hoare triple {55719#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {55720#(<= main_~i~0 51)} is VALID [2018-11-23 11:58:09,313 INFO L273 TraceCheckUtils]: 159: Hoare triple {55720#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55720#(<= main_~i~0 51)} is VALID [2018-11-23 11:58:09,314 INFO L273 TraceCheckUtils]: 160: Hoare triple {55720#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55720#(<= main_~i~0 51)} is VALID [2018-11-23 11:58:09,314 INFO L273 TraceCheckUtils]: 161: Hoare triple {55720#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {55721#(<= main_~i~0 52)} is VALID [2018-11-23 11:58:09,315 INFO L273 TraceCheckUtils]: 162: Hoare triple {55721#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55721#(<= main_~i~0 52)} is VALID [2018-11-23 11:58:09,315 INFO L273 TraceCheckUtils]: 163: Hoare triple {55721#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55721#(<= main_~i~0 52)} is VALID [2018-11-23 11:58:09,316 INFO L273 TraceCheckUtils]: 164: Hoare triple {55721#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {55722#(<= main_~i~0 53)} is VALID [2018-11-23 11:58:09,317 INFO L273 TraceCheckUtils]: 165: Hoare triple {55722#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55722#(<= main_~i~0 53)} is VALID [2018-11-23 11:58:09,317 INFO L273 TraceCheckUtils]: 166: Hoare triple {55722#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55722#(<= main_~i~0 53)} is VALID [2018-11-23 11:58:09,318 INFO L273 TraceCheckUtils]: 167: Hoare triple {55722#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {55723#(<= main_~i~0 54)} is VALID [2018-11-23 11:58:09,318 INFO L273 TraceCheckUtils]: 168: Hoare triple {55723#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55723#(<= main_~i~0 54)} is VALID [2018-11-23 11:58:09,319 INFO L273 TraceCheckUtils]: 169: Hoare triple {55723#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55723#(<= main_~i~0 54)} is VALID [2018-11-23 11:58:09,319 INFO L273 TraceCheckUtils]: 170: Hoare triple {55723#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {55724#(<= main_~i~0 55)} is VALID [2018-11-23 11:58:09,320 INFO L273 TraceCheckUtils]: 171: Hoare triple {55724#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55724#(<= main_~i~0 55)} is VALID [2018-11-23 11:58:09,320 INFO L273 TraceCheckUtils]: 172: Hoare triple {55724#(<= main_~i~0 55)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55724#(<= main_~i~0 55)} is VALID [2018-11-23 11:58:09,321 INFO L273 TraceCheckUtils]: 173: Hoare triple {55724#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {55725#(<= main_~i~0 56)} is VALID [2018-11-23 11:58:09,322 INFO L273 TraceCheckUtils]: 174: Hoare triple {55725#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55725#(<= main_~i~0 56)} is VALID [2018-11-23 11:58:09,322 INFO L273 TraceCheckUtils]: 175: Hoare triple {55725#(<= main_~i~0 56)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55725#(<= main_~i~0 56)} is VALID [2018-11-23 11:58:09,323 INFO L273 TraceCheckUtils]: 176: Hoare triple {55725#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {55726#(<= main_~i~0 57)} is VALID [2018-11-23 11:58:09,323 INFO L273 TraceCheckUtils]: 177: Hoare triple {55726#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55726#(<= main_~i~0 57)} is VALID [2018-11-23 11:58:09,324 INFO L273 TraceCheckUtils]: 178: Hoare triple {55726#(<= main_~i~0 57)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55726#(<= main_~i~0 57)} is VALID [2018-11-23 11:58:09,324 INFO L273 TraceCheckUtils]: 179: Hoare triple {55726#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {55727#(<= main_~i~0 58)} is VALID [2018-11-23 11:58:09,325 INFO L273 TraceCheckUtils]: 180: Hoare triple {55727#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55727#(<= main_~i~0 58)} is VALID [2018-11-23 11:58:09,325 INFO L273 TraceCheckUtils]: 181: Hoare triple {55727#(<= main_~i~0 58)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55727#(<= main_~i~0 58)} is VALID [2018-11-23 11:58:09,326 INFO L273 TraceCheckUtils]: 182: Hoare triple {55727#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {55728#(<= main_~i~0 59)} is VALID [2018-11-23 11:58:09,327 INFO L273 TraceCheckUtils]: 183: Hoare triple {55728#(<= main_~i~0 59)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55728#(<= main_~i~0 59)} is VALID [2018-11-23 11:58:09,327 INFO L273 TraceCheckUtils]: 184: Hoare triple {55728#(<= main_~i~0 59)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55728#(<= main_~i~0 59)} is VALID [2018-11-23 11:58:09,328 INFO L273 TraceCheckUtils]: 185: Hoare triple {55728#(<= main_~i~0 59)} ~i~0 := 1 + ~i~0; {55729#(<= main_~i~0 60)} is VALID [2018-11-23 11:58:09,328 INFO L273 TraceCheckUtils]: 186: Hoare triple {55729#(<= main_~i~0 60)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55729#(<= main_~i~0 60)} is VALID [2018-11-23 11:58:09,329 INFO L273 TraceCheckUtils]: 187: Hoare triple {55729#(<= main_~i~0 60)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55729#(<= main_~i~0 60)} is VALID [2018-11-23 11:58:09,330 INFO L273 TraceCheckUtils]: 188: Hoare triple {55729#(<= main_~i~0 60)} ~i~0 := 1 + ~i~0; {55730#(<= main_~i~0 61)} is VALID [2018-11-23 11:58:09,330 INFO L273 TraceCheckUtils]: 189: Hoare triple {55730#(<= main_~i~0 61)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55730#(<= main_~i~0 61)} is VALID [2018-11-23 11:58:09,331 INFO L273 TraceCheckUtils]: 190: Hoare triple {55730#(<= main_~i~0 61)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {55730#(<= main_~i~0 61)} is VALID [2018-11-23 11:58:09,331 INFO L273 TraceCheckUtils]: 191: Hoare triple {55730#(<= main_~i~0 61)} ~i~0 := 1 + ~i~0; {55731#(<= main_~i~0 62)} is VALID [2018-11-23 11:58:09,332 INFO L273 TraceCheckUtils]: 192: Hoare triple {55731#(<= main_~i~0 62)} assume !(~i~0 < 100000); {55668#false} is VALID [2018-11-23 11:58:09,332 INFO L273 TraceCheckUtils]: 193: Hoare triple {55668#false} havoc ~x~0;~x~0 := 0; {55668#false} is VALID [2018-11-23 11:58:09,332 INFO L273 TraceCheckUtils]: 194: Hoare triple {55668#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {55668#false} is VALID [2018-11-23 11:58:09,332 INFO L256 TraceCheckUtils]: 195: Hoare triple {55668#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {55668#false} is VALID [2018-11-23 11:58:09,333 INFO L273 TraceCheckUtils]: 196: Hoare triple {55668#false} ~cond := #in~cond; {55668#false} is VALID [2018-11-23 11:58:09,333 INFO L273 TraceCheckUtils]: 197: Hoare triple {55668#false} assume 0 == ~cond; {55668#false} is VALID [2018-11-23 11:58:09,333 INFO L273 TraceCheckUtils]: 198: Hoare triple {55668#false} assume !false; {55668#false} is VALID [2018-11-23 11:58:09,359 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:09,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:09,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 66 [2018-11-23 11:58:09,378 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 199 [2018-11-23 11:58:09,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:09,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 66 states. [2018-11-23 11:58:09,578 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:09,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-11-23 11:58:09,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-11-23 11:58:09,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-11-23 11:58:09,580 INFO L87 Difference]: Start difference. First operand 204 states and 267 transitions. Second operand 66 states. [2018-11-23 11:58:10,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:10,872 INFO L93 Difference]: Finished difference Result 220 states and 286 transitions. [2018-11-23 11:58:10,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-11-23 11:58:10,872 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 199 [2018-11-23 11:58:10,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:10,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 11:58:10,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 286 transitions. [2018-11-23 11:58:10,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 11:58:10,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 286 transitions. [2018-11-23 11:58:10,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 65 states and 286 transitions. [2018-11-23 11:58:11,144 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 286 edges. 286 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:11,149 INFO L225 Difference]: With dead ends: 220 [2018-11-23 11:58:11,149 INFO L226 Difference]: Without dead ends: 209 [2018-11-23 11:58:11,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-11-23 11:58:11,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-11-23 11:58:11,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2018-11-23 11:58:11,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:11,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand 207 states. [2018-11-23 11:58:11,210 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand 207 states. [2018-11-23 11:58:11,210 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 207 states. [2018-11-23 11:58:11,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:11,214 INFO L93 Difference]: Finished difference Result 209 states and 274 transitions. [2018-11-23 11:58:11,214 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 274 transitions. [2018-11-23 11:58:11,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:11,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:11,214 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand 209 states. [2018-11-23 11:58:11,214 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 209 states. [2018-11-23 11:58:11,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:11,217 INFO L93 Difference]: Finished difference Result 209 states and 274 transitions. [2018-11-23 11:58:11,218 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 274 transitions. [2018-11-23 11:58:11,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:11,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:11,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:11,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:11,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-11-23 11:58:11,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 271 transitions. [2018-11-23 11:58:11,222 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 271 transitions. Word has length 199 [2018-11-23 11:58:11,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:11,222 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 271 transitions. [2018-11-23 11:58:11,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-11-23 11:58:11,222 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 271 transitions. [2018-11-23 11:58:11,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-23 11:58:11,223 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:11,223 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:11,223 INFO L423 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:11,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:11,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1939749725, now seen corresponding path program 63 times [2018-11-23 11:58:11,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:11,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:11,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:11,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:11,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:13,301 INFO L256 TraceCheckUtils]: 0: Hoare triple {57319#true} call ULTIMATE.init(); {57319#true} is VALID [2018-11-23 11:58:13,301 INFO L273 TraceCheckUtils]: 1: Hoare triple {57319#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {57319#true} is VALID [2018-11-23 11:58:13,301 INFO L273 TraceCheckUtils]: 2: Hoare triple {57319#true} assume true; {57319#true} is VALID [2018-11-23 11:58:13,301 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {57319#true} {57319#true} #55#return; {57319#true} is VALID [2018-11-23 11:58:13,301 INFO L256 TraceCheckUtils]: 4: Hoare triple {57319#true} call #t~ret4 := main(); {57319#true} is VALID [2018-11-23 11:58:13,302 INFO L273 TraceCheckUtils]: 5: Hoare triple {57319#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {57321#(= main_~i~0 0)} is VALID [2018-11-23 11:58:13,302 INFO L273 TraceCheckUtils]: 6: Hoare triple {57321#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57321#(= main_~i~0 0)} is VALID [2018-11-23 11:58:13,303 INFO L273 TraceCheckUtils]: 7: Hoare triple {57321#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57321#(= main_~i~0 0)} is VALID [2018-11-23 11:58:13,304 INFO L273 TraceCheckUtils]: 8: Hoare triple {57321#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {57322#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:13,304 INFO L273 TraceCheckUtils]: 9: Hoare triple {57322#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57322#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:13,304 INFO L273 TraceCheckUtils]: 10: Hoare triple {57322#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57322#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:13,305 INFO L273 TraceCheckUtils]: 11: Hoare triple {57322#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {57323#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:13,305 INFO L273 TraceCheckUtils]: 12: Hoare triple {57323#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57323#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:13,305 INFO L273 TraceCheckUtils]: 13: Hoare triple {57323#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57323#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:13,306 INFO L273 TraceCheckUtils]: 14: Hoare triple {57323#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {57324#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:13,306 INFO L273 TraceCheckUtils]: 15: Hoare triple {57324#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57324#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:13,307 INFO L273 TraceCheckUtils]: 16: Hoare triple {57324#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57324#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:13,307 INFO L273 TraceCheckUtils]: 17: Hoare triple {57324#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {57325#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:13,308 INFO L273 TraceCheckUtils]: 18: Hoare triple {57325#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57325#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:13,308 INFO L273 TraceCheckUtils]: 19: Hoare triple {57325#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57325#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:13,309 INFO L273 TraceCheckUtils]: 20: Hoare triple {57325#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {57326#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:13,309 INFO L273 TraceCheckUtils]: 21: Hoare triple {57326#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57326#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:13,310 INFO L273 TraceCheckUtils]: 22: Hoare triple {57326#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57326#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:13,311 INFO L273 TraceCheckUtils]: 23: Hoare triple {57326#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {57327#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:13,311 INFO L273 TraceCheckUtils]: 24: Hoare triple {57327#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57327#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:13,312 INFO L273 TraceCheckUtils]: 25: Hoare triple {57327#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57327#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:13,312 INFO L273 TraceCheckUtils]: 26: Hoare triple {57327#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {57328#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:13,313 INFO L273 TraceCheckUtils]: 27: Hoare triple {57328#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57328#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:13,313 INFO L273 TraceCheckUtils]: 28: Hoare triple {57328#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57328#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:13,314 INFO L273 TraceCheckUtils]: 29: Hoare triple {57328#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {57329#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:13,314 INFO L273 TraceCheckUtils]: 30: Hoare triple {57329#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57329#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:13,315 INFO L273 TraceCheckUtils]: 31: Hoare triple {57329#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57329#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:13,315 INFO L273 TraceCheckUtils]: 32: Hoare triple {57329#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {57330#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:13,316 INFO L273 TraceCheckUtils]: 33: Hoare triple {57330#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57330#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:13,316 INFO L273 TraceCheckUtils]: 34: Hoare triple {57330#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57330#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:13,317 INFO L273 TraceCheckUtils]: 35: Hoare triple {57330#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {57331#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:13,318 INFO L273 TraceCheckUtils]: 36: Hoare triple {57331#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57331#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:13,318 INFO L273 TraceCheckUtils]: 37: Hoare triple {57331#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57331#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:13,319 INFO L273 TraceCheckUtils]: 38: Hoare triple {57331#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {57332#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:13,319 INFO L273 TraceCheckUtils]: 39: Hoare triple {57332#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57332#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:13,320 INFO L273 TraceCheckUtils]: 40: Hoare triple {57332#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57332#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:13,320 INFO L273 TraceCheckUtils]: 41: Hoare triple {57332#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {57333#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:13,321 INFO L273 TraceCheckUtils]: 42: Hoare triple {57333#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57333#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:13,321 INFO L273 TraceCheckUtils]: 43: Hoare triple {57333#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57333#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:13,322 INFO L273 TraceCheckUtils]: 44: Hoare triple {57333#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {57334#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:13,322 INFO L273 TraceCheckUtils]: 45: Hoare triple {57334#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57334#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:13,323 INFO L273 TraceCheckUtils]: 46: Hoare triple {57334#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57334#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:13,324 INFO L273 TraceCheckUtils]: 47: Hoare triple {57334#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {57335#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:13,324 INFO L273 TraceCheckUtils]: 48: Hoare triple {57335#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57335#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:13,325 INFO L273 TraceCheckUtils]: 49: Hoare triple {57335#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57335#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:13,325 INFO L273 TraceCheckUtils]: 50: Hoare triple {57335#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {57336#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:13,326 INFO L273 TraceCheckUtils]: 51: Hoare triple {57336#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57336#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:13,326 INFO L273 TraceCheckUtils]: 52: Hoare triple {57336#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57336#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:13,327 INFO L273 TraceCheckUtils]: 53: Hoare triple {57336#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {57337#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:13,327 INFO L273 TraceCheckUtils]: 54: Hoare triple {57337#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57337#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:13,328 INFO L273 TraceCheckUtils]: 55: Hoare triple {57337#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57337#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:13,329 INFO L273 TraceCheckUtils]: 56: Hoare triple {57337#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {57338#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:13,329 INFO L273 TraceCheckUtils]: 57: Hoare triple {57338#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57338#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:13,330 INFO L273 TraceCheckUtils]: 58: Hoare triple {57338#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57338#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:13,330 INFO L273 TraceCheckUtils]: 59: Hoare triple {57338#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {57339#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:13,331 INFO L273 TraceCheckUtils]: 60: Hoare triple {57339#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57339#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:13,331 INFO L273 TraceCheckUtils]: 61: Hoare triple {57339#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57339#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:13,332 INFO L273 TraceCheckUtils]: 62: Hoare triple {57339#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {57340#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:13,332 INFO L273 TraceCheckUtils]: 63: Hoare triple {57340#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57340#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:13,333 INFO L273 TraceCheckUtils]: 64: Hoare triple {57340#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57340#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:13,333 INFO L273 TraceCheckUtils]: 65: Hoare triple {57340#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {57341#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:13,334 INFO L273 TraceCheckUtils]: 66: Hoare triple {57341#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57341#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:13,334 INFO L273 TraceCheckUtils]: 67: Hoare triple {57341#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57341#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:13,335 INFO L273 TraceCheckUtils]: 68: Hoare triple {57341#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {57342#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:13,336 INFO L273 TraceCheckUtils]: 69: Hoare triple {57342#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57342#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:13,336 INFO L273 TraceCheckUtils]: 70: Hoare triple {57342#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57342#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:13,337 INFO L273 TraceCheckUtils]: 71: Hoare triple {57342#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {57343#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:13,337 INFO L273 TraceCheckUtils]: 72: Hoare triple {57343#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57343#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:13,338 INFO L273 TraceCheckUtils]: 73: Hoare triple {57343#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57343#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:13,338 INFO L273 TraceCheckUtils]: 74: Hoare triple {57343#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {57344#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:13,339 INFO L273 TraceCheckUtils]: 75: Hoare triple {57344#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57344#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:13,339 INFO L273 TraceCheckUtils]: 76: Hoare triple {57344#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57344#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:13,340 INFO L273 TraceCheckUtils]: 77: Hoare triple {57344#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {57345#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:13,340 INFO L273 TraceCheckUtils]: 78: Hoare triple {57345#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57345#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:13,341 INFO L273 TraceCheckUtils]: 79: Hoare triple {57345#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57345#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:13,341 INFO L273 TraceCheckUtils]: 80: Hoare triple {57345#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {57346#(<= main_~i~0 25)} is VALID [2018-11-23 11:58:13,342 INFO L273 TraceCheckUtils]: 81: Hoare triple {57346#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57346#(<= main_~i~0 25)} is VALID [2018-11-23 11:58:13,342 INFO L273 TraceCheckUtils]: 82: Hoare triple {57346#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57346#(<= main_~i~0 25)} is VALID [2018-11-23 11:58:13,343 INFO L273 TraceCheckUtils]: 83: Hoare triple {57346#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {57347#(<= main_~i~0 26)} is VALID [2018-11-23 11:58:13,344 INFO L273 TraceCheckUtils]: 84: Hoare triple {57347#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57347#(<= main_~i~0 26)} is VALID [2018-11-23 11:58:13,344 INFO L273 TraceCheckUtils]: 85: Hoare triple {57347#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57347#(<= main_~i~0 26)} is VALID [2018-11-23 11:58:13,345 INFO L273 TraceCheckUtils]: 86: Hoare triple {57347#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {57348#(<= main_~i~0 27)} is VALID [2018-11-23 11:58:13,345 INFO L273 TraceCheckUtils]: 87: Hoare triple {57348#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57348#(<= main_~i~0 27)} is VALID [2018-11-23 11:58:13,346 INFO L273 TraceCheckUtils]: 88: Hoare triple {57348#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57348#(<= main_~i~0 27)} is VALID [2018-11-23 11:58:13,346 INFO L273 TraceCheckUtils]: 89: Hoare triple {57348#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {57349#(<= main_~i~0 28)} is VALID [2018-11-23 11:58:13,347 INFO L273 TraceCheckUtils]: 90: Hoare triple {57349#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57349#(<= main_~i~0 28)} is VALID [2018-11-23 11:58:13,347 INFO L273 TraceCheckUtils]: 91: Hoare triple {57349#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57349#(<= main_~i~0 28)} is VALID [2018-11-23 11:58:13,348 INFO L273 TraceCheckUtils]: 92: Hoare triple {57349#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {57350#(<= main_~i~0 29)} is VALID [2018-11-23 11:58:13,349 INFO L273 TraceCheckUtils]: 93: Hoare triple {57350#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57350#(<= main_~i~0 29)} is VALID [2018-11-23 11:58:13,349 INFO L273 TraceCheckUtils]: 94: Hoare triple {57350#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57350#(<= main_~i~0 29)} is VALID [2018-11-23 11:58:13,350 INFO L273 TraceCheckUtils]: 95: Hoare triple {57350#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {57351#(<= main_~i~0 30)} is VALID [2018-11-23 11:58:13,350 INFO L273 TraceCheckUtils]: 96: Hoare triple {57351#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57351#(<= main_~i~0 30)} is VALID [2018-11-23 11:58:13,351 INFO L273 TraceCheckUtils]: 97: Hoare triple {57351#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57351#(<= main_~i~0 30)} is VALID [2018-11-23 11:58:13,351 INFO L273 TraceCheckUtils]: 98: Hoare triple {57351#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {57352#(<= main_~i~0 31)} is VALID [2018-11-23 11:58:13,352 INFO L273 TraceCheckUtils]: 99: Hoare triple {57352#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57352#(<= main_~i~0 31)} is VALID [2018-11-23 11:58:13,352 INFO L273 TraceCheckUtils]: 100: Hoare triple {57352#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57352#(<= main_~i~0 31)} is VALID [2018-11-23 11:58:13,353 INFO L273 TraceCheckUtils]: 101: Hoare triple {57352#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {57353#(<= main_~i~0 32)} is VALID [2018-11-23 11:58:13,354 INFO L273 TraceCheckUtils]: 102: Hoare triple {57353#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57353#(<= main_~i~0 32)} is VALID [2018-11-23 11:58:13,354 INFO L273 TraceCheckUtils]: 103: Hoare triple {57353#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57353#(<= main_~i~0 32)} is VALID [2018-11-23 11:58:13,355 INFO L273 TraceCheckUtils]: 104: Hoare triple {57353#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {57354#(<= main_~i~0 33)} is VALID [2018-11-23 11:58:13,355 INFO L273 TraceCheckUtils]: 105: Hoare triple {57354#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57354#(<= main_~i~0 33)} is VALID [2018-11-23 11:58:13,356 INFO L273 TraceCheckUtils]: 106: Hoare triple {57354#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57354#(<= main_~i~0 33)} is VALID [2018-11-23 11:58:13,356 INFO L273 TraceCheckUtils]: 107: Hoare triple {57354#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {57355#(<= main_~i~0 34)} is VALID [2018-11-23 11:58:13,357 INFO L273 TraceCheckUtils]: 108: Hoare triple {57355#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57355#(<= main_~i~0 34)} is VALID [2018-11-23 11:58:13,357 INFO L273 TraceCheckUtils]: 109: Hoare triple {57355#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57355#(<= main_~i~0 34)} is VALID [2018-11-23 11:58:13,358 INFO L273 TraceCheckUtils]: 110: Hoare triple {57355#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {57356#(<= main_~i~0 35)} is VALID [2018-11-23 11:58:13,358 INFO L273 TraceCheckUtils]: 111: Hoare triple {57356#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57356#(<= main_~i~0 35)} is VALID [2018-11-23 11:58:13,359 INFO L273 TraceCheckUtils]: 112: Hoare triple {57356#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57356#(<= main_~i~0 35)} is VALID [2018-11-23 11:58:13,360 INFO L273 TraceCheckUtils]: 113: Hoare triple {57356#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {57357#(<= main_~i~0 36)} is VALID [2018-11-23 11:58:13,360 INFO L273 TraceCheckUtils]: 114: Hoare triple {57357#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57357#(<= main_~i~0 36)} is VALID [2018-11-23 11:58:13,360 INFO L273 TraceCheckUtils]: 115: Hoare triple {57357#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57357#(<= main_~i~0 36)} is VALID [2018-11-23 11:58:13,361 INFO L273 TraceCheckUtils]: 116: Hoare triple {57357#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {57358#(<= main_~i~0 37)} is VALID [2018-11-23 11:58:13,362 INFO L273 TraceCheckUtils]: 117: Hoare triple {57358#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57358#(<= main_~i~0 37)} is VALID [2018-11-23 11:58:13,362 INFO L273 TraceCheckUtils]: 118: Hoare triple {57358#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57358#(<= main_~i~0 37)} is VALID [2018-11-23 11:58:13,363 INFO L273 TraceCheckUtils]: 119: Hoare triple {57358#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {57359#(<= main_~i~0 38)} is VALID [2018-11-23 11:58:13,363 INFO L273 TraceCheckUtils]: 120: Hoare triple {57359#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57359#(<= main_~i~0 38)} is VALID [2018-11-23 11:58:13,364 INFO L273 TraceCheckUtils]: 121: Hoare triple {57359#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57359#(<= main_~i~0 38)} is VALID [2018-11-23 11:58:13,364 INFO L273 TraceCheckUtils]: 122: Hoare triple {57359#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {57360#(<= main_~i~0 39)} is VALID [2018-11-23 11:58:13,365 INFO L273 TraceCheckUtils]: 123: Hoare triple {57360#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57360#(<= main_~i~0 39)} is VALID [2018-11-23 11:58:13,365 INFO L273 TraceCheckUtils]: 124: Hoare triple {57360#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57360#(<= main_~i~0 39)} is VALID [2018-11-23 11:58:13,366 INFO L273 TraceCheckUtils]: 125: Hoare triple {57360#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {57361#(<= main_~i~0 40)} is VALID [2018-11-23 11:58:13,366 INFO L273 TraceCheckUtils]: 126: Hoare triple {57361#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57361#(<= main_~i~0 40)} is VALID [2018-11-23 11:58:13,367 INFO L273 TraceCheckUtils]: 127: Hoare triple {57361#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57361#(<= main_~i~0 40)} is VALID [2018-11-23 11:58:13,368 INFO L273 TraceCheckUtils]: 128: Hoare triple {57361#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {57362#(<= main_~i~0 41)} is VALID [2018-11-23 11:58:13,368 INFO L273 TraceCheckUtils]: 129: Hoare triple {57362#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57362#(<= main_~i~0 41)} is VALID [2018-11-23 11:58:13,369 INFO L273 TraceCheckUtils]: 130: Hoare triple {57362#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57362#(<= main_~i~0 41)} is VALID [2018-11-23 11:58:13,369 INFO L273 TraceCheckUtils]: 131: Hoare triple {57362#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {57363#(<= main_~i~0 42)} is VALID [2018-11-23 11:58:13,370 INFO L273 TraceCheckUtils]: 132: Hoare triple {57363#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57363#(<= main_~i~0 42)} is VALID [2018-11-23 11:58:13,370 INFO L273 TraceCheckUtils]: 133: Hoare triple {57363#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57363#(<= main_~i~0 42)} is VALID [2018-11-23 11:58:13,371 INFO L273 TraceCheckUtils]: 134: Hoare triple {57363#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {57364#(<= main_~i~0 43)} is VALID [2018-11-23 11:58:13,371 INFO L273 TraceCheckUtils]: 135: Hoare triple {57364#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57364#(<= main_~i~0 43)} is VALID [2018-11-23 11:58:13,372 INFO L273 TraceCheckUtils]: 136: Hoare triple {57364#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57364#(<= main_~i~0 43)} is VALID [2018-11-23 11:58:13,372 INFO L273 TraceCheckUtils]: 137: Hoare triple {57364#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {57365#(<= main_~i~0 44)} is VALID [2018-11-23 11:58:13,373 INFO L273 TraceCheckUtils]: 138: Hoare triple {57365#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57365#(<= main_~i~0 44)} is VALID [2018-11-23 11:58:13,373 INFO L273 TraceCheckUtils]: 139: Hoare triple {57365#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57365#(<= main_~i~0 44)} is VALID [2018-11-23 11:58:13,374 INFO L273 TraceCheckUtils]: 140: Hoare triple {57365#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {57366#(<= main_~i~0 45)} is VALID [2018-11-23 11:58:13,375 INFO L273 TraceCheckUtils]: 141: Hoare triple {57366#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57366#(<= main_~i~0 45)} is VALID [2018-11-23 11:58:13,375 INFO L273 TraceCheckUtils]: 142: Hoare triple {57366#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57366#(<= main_~i~0 45)} is VALID [2018-11-23 11:58:13,376 INFO L273 TraceCheckUtils]: 143: Hoare triple {57366#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {57367#(<= main_~i~0 46)} is VALID [2018-11-23 11:58:13,376 INFO L273 TraceCheckUtils]: 144: Hoare triple {57367#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57367#(<= main_~i~0 46)} is VALID [2018-11-23 11:58:13,377 INFO L273 TraceCheckUtils]: 145: Hoare triple {57367#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57367#(<= main_~i~0 46)} is VALID [2018-11-23 11:58:13,377 INFO L273 TraceCheckUtils]: 146: Hoare triple {57367#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {57368#(<= main_~i~0 47)} is VALID [2018-11-23 11:58:13,378 INFO L273 TraceCheckUtils]: 147: Hoare triple {57368#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57368#(<= main_~i~0 47)} is VALID [2018-11-23 11:58:13,378 INFO L273 TraceCheckUtils]: 148: Hoare triple {57368#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57368#(<= main_~i~0 47)} is VALID [2018-11-23 11:58:13,379 INFO L273 TraceCheckUtils]: 149: Hoare triple {57368#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {57369#(<= main_~i~0 48)} is VALID [2018-11-23 11:58:13,379 INFO L273 TraceCheckUtils]: 150: Hoare triple {57369#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57369#(<= main_~i~0 48)} is VALID [2018-11-23 11:58:13,380 INFO L273 TraceCheckUtils]: 151: Hoare triple {57369#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57369#(<= main_~i~0 48)} is VALID [2018-11-23 11:58:13,381 INFO L273 TraceCheckUtils]: 152: Hoare triple {57369#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {57370#(<= main_~i~0 49)} is VALID [2018-11-23 11:58:13,381 INFO L273 TraceCheckUtils]: 153: Hoare triple {57370#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57370#(<= main_~i~0 49)} is VALID [2018-11-23 11:58:13,382 INFO L273 TraceCheckUtils]: 154: Hoare triple {57370#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57370#(<= main_~i~0 49)} is VALID [2018-11-23 11:58:13,382 INFO L273 TraceCheckUtils]: 155: Hoare triple {57370#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {57371#(<= main_~i~0 50)} is VALID [2018-11-23 11:58:13,383 INFO L273 TraceCheckUtils]: 156: Hoare triple {57371#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57371#(<= main_~i~0 50)} is VALID [2018-11-23 11:58:13,383 INFO L273 TraceCheckUtils]: 157: Hoare triple {57371#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57371#(<= main_~i~0 50)} is VALID [2018-11-23 11:58:13,384 INFO L273 TraceCheckUtils]: 158: Hoare triple {57371#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {57372#(<= main_~i~0 51)} is VALID [2018-11-23 11:58:13,384 INFO L273 TraceCheckUtils]: 159: Hoare triple {57372#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57372#(<= main_~i~0 51)} is VALID [2018-11-23 11:58:13,385 INFO L273 TraceCheckUtils]: 160: Hoare triple {57372#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57372#(<= main_~i~0 51)} is VALID [2018-11-23 11:58:13,386 INFO L273 TraceCheckUtils]: 161: Hoare triple {57372#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {57373#(<= main_~i~0 52)} is VALID [2018-11-23 11:58:13,386 INFO L273 TraceCheckUtils]: 162: Hoare triple {57373#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57373#(<= main_~i~0 52)} is VALID [2018-11-23 11:58:13,387 INFO L273 TraceCheckUtils]: 163: Hoare triple {57373#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57373#(<= main_~i~0 52)} is VALID [2018-11-23 11:58:13,387 INFO L273 TraceCheckUtils]: 164: Hoare triple {57373#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {57374#(<= main_~i~0 53)} is VALID [2018-11-23 11:58:13,388 INFO L273 TraceCheckUtils]: 165: Hoare triple {57374#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57374#(<= main_~i~0 53)} is VALID [2018-11-23 11:58:13,388 INFO L273 TraceCheckUtils]: 166: Hoare triple {57374#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57374#(<= main_~i~0 53)} is VALID [2018-11-23 11:58:13,389 INFO L273 TraceCheckUtils]: 167: Hoare triple {57374#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {57375#(<= main_~i~0 54)} is VALID [2018-11-23 11:58:13,389 INFO L273 TraceCheckUtils]: 168: Hoare triple {57375#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57375#(<= main_~i~0 54)} is VALID [2018-11-23 11:58:13,390 INFO L273 TraceCheckUtils]: 169: Hoare triple {57375#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57375#(<= main_~i~0 54)} is VALID [2018-11-23 11:58:13,391 INFO L273 TraceCheckUtils]: 170: Hoare triple {57375#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {57376#(<= main_~i~0 55)} is VALID [2018-11-23 11:58:13,391 INFO L273 TraceCheckUtils]: 171: Hoare triple {57376#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57376#(<= main_~i~0 55)} is VALID [2018-11-23 11:58:13,392 INFO L273 TraceCheckUtils]: 172: Hoare triple {57376#(<= main_~i~0 55)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57376#(<= main_~i~0 55)} is VALID [2018-11-23 11:58:13,392 INFO L273 TraceCheckUtils]: 173: Hoare triple {57376#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {57377#(<= main_~i~0 56)} is VALID [2018-11-23 11:58:13,393 INFO L273 TraceCheckUtils]: 174: Hoare triple {57377#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57377#(<= main_~i~0 56)} is VALID [2018-11-23 11:58:13,393 INFO L273 TraceCheckUtils]: 175: Hoare triple {57377#(<= main_~i~0 56)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57377#(<= main_~i~0 56)} is VALID [2018-11-23 11:58:13,394 INFO L273 TraceCheckUtils]: 176: Hoare triple {57377#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {57378#(<= main_~i~0 57)} is VALID [2018-11-23 11:58:13,394 INFO L273 TraceCheckUtils]: 177: Hoare triple {57378#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57378#(<= main_~i~0 57)} is VALID [2018-11-23 11:58:13,395 INFO L273 TraceCheckUtils]: 178: Hoare triple {57378#(<= main_~i~0 57)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57378#(<= main_~i~0 57)} is VALID [2018-11-23 11:58:13,395 INFO L273 TraceCheckUtils]: 179: Hoare triple {57378#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {57379#(<= main_~i~0 58)} is VALID [2018-11-23 11:58:13,396 INFO L273 TraceCheckUtils]: 180: Hoare triple {57379#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57379#(<= main_~i~0 58)} is VALID [2018-11-23 11:58:13,396 INFO L273 TraceCheckUtils]: 181: Hoare triple {57379#(<= main_~i~0 58)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57379#(<= main_~i~0 58)} is VALID [2018-11-23 11:58:13,397 INFO L273 TraceCheckUtils]: 182: Hoare triple {57379#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {57380#(<= main_~i~0 59)} is VALID [2018-11-23 11:58:13,398 INFO L273 TraceCheckUtils]: 183: Hoare triple {57380#(<= main_~i~0 59)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57380#(<= main_~i~0 59)} is VALID [2018-11-23 11:58:13,398 INFO L273 TraceCheckUtils]: 184: Hoare triple {57380#(<= main_~i~0 59)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57380#(<= main_~i~0 59)} is VALID [2018-11-23 11:58:13,399 INFO L273 TraceCheckUtils]: 185: Hoare triple {57380#(<= main_~i~0 59)} ~i~0 := 1 + ~i~0; {57381#(<= main_~i~0 60)} is VALID [2018-11-23 11:58:13,399 INFO L273 TraceCheckUtils]: 186: Hoare triple {57381#(<= main_~i~0 60)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57381#(<= main_~i~0 60)} is VALID [2018-11-23 11:58:13,400 INFO L273 TraceCheckUtils]: 187: Hoare triple {57381#(<= main_~i~0 60)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57381#(<= main_~i~0 60)} is VALID [2018-11-23 11:58:13,400 INFO L273 TraceCheckUtils]: 188: Hoare triple {57381#(<= main_~i~0 60)} ~i~0 := 1 + ~i~0; {57382#(<= main_~i~0 61)} is VALID [2018-11-23 11:58:13,401 INFO L273 TraceCheckUtils]: 189: Hoare triple {57382#(<= main_~i~0 61)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57382#(<= main_~i~0 61)} is VALID [2018-11-23 11:58:13,401 INFO L273 TraceCheckUtils]: 190: Hoare triple {57382#(<= main_~i~0 61)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57382#(<= main_~i~0 61)} is VALID [2018-11-23 11:58:13,402 INFO L273 TraceCheckUtils]: 191: Hoare triple {57382#(<= main_~i~0 61)} ~i~0 := 1 + ~i~0; {57383#(<= main_~i~0 62)} is VALID [2018-11-23 11:58:13,403 INFO L273 TraceCheckUtils]: 192: Hoare triple {57383#(<= main_~i~0 62)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57383#(<= main_~i~0 62)} is VALID [2018-11-23 11:58:13,403 INFO L273 TraceCheckUtils]: 193: Hoare triple {57383#(<= main_~i~0 62)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57383#(<= main_~i~0 62)} is VALID [2018-11-23 11:58:13,404 INFO L273 TraceCheckUtils]: 194: Hoare triple {57383#(<= main_~i~0 62)} ~i~0 := 1 + ~i~0; {57384#(<= main_~i~0 63)} is VALID [2018-11-23 11:58:13,404 INFO L273 TraceCheckUtils]: 195: Hoare triple {57384#(<= main_~i~0 63)} assume !(~i~0 < 100000); {57320#false} is VALID [2018-11-23 11:58:13,405 INFO L273 TraceCheckUtils]: 196: Hoare triple {57320#false} havoc ~x~0;~x~0 := 0; {57320#false} is VALID [2018-11-23 11:58:13,405 INFO L273 TraceCheckUtils]: 197: Hoare triple {57320#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {57320#false} is VALID [2018-11-23 11:58:13,405 INFO L256 TraceCheckUtils]: 198: Hoare triple {57320#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {57320#false} is VALID [2018-11-23 11:58:13,405 INFO L273 TraceCheckUtils]: 199: Hoare triple {57320#false} ~cond := #in~cond; {57320#false} is VALID [2018-11-23 11:58:13,405 INFO L273 TraceCheckUtils]: 200: Hoare triple {57320#false} assume 0 == ~cond; {57320#false} is VALID [2018-11-23 11:58:13,405 INFO L273 TraceCheckUtils]: 201: Hoare triple {57320#false} assume !false; {57320#false} is VALID [2018-11-23 11:58:13,433 INFO L134 CoverageAnalysis]: Checked inductivity of 5922 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:13,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:13,433 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:13,443 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:58:13,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-11-23 11:58:13,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:13,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:14,061 INFO L256 TraceCheckUtils]: 0: Hoare triple {57319#true} call ULTIMATE.init(); {57319#true} is VALID [2018-11-23 11:58:14,062 INFO L273 TraceCheckUtils]: 1: Hoare triple {57319#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {57319#true} is VALID [2018-11-23 11:58:14,062 INFO L273 TraceCheckUtils]: 2: Hoare triple {57319#true} assume true; {57319#true} is VALID [2018-11-23 11:58:14,062 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {57319#true} {57319#true} #55#return; {57319#true} is VALID [2018-11-23 11:58:14,062 INFO L256 TraceCheckUtils]: 4: Hoare triple {57319#true} call #t~ret4 := main(); {57319#true} is VALID [2018-11-23 11:58:14,063 INFO L273 TraceCheckUtils]: 5: Hoare triple {57319#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {57403#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:14,063 INFO L273 TraceCheckUtils]: 6: Hoare triple {57403#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57403#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:14,064 INFO L273 TraceCheckUtils]: 7: Hoare triple {57403#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57403#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:14,065 INFO L273 TraceCheckUtils]: 8: Hoare triple {57403#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {57322#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:14,065 INFO L273 TraceCheckUtils]: 9: Hoare triple {57322#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57322#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:14,066 INFO L273 TraceCheckUtils]: 10: Hoare triple {57322#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57322#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:14,066 INFO L273 TraceCheckUtils]: 11: Hoare triple {57322#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {57323#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:14,067 INFO L273 TraceCheckUtils]: 12: Hoare triple {57323#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57323#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:14,067 INFO L273 TraceCheckUtils]: 13: Hoare triple {57323#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57323#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:14,068 INFO L273 TraceCheckUtils]: 14: Hoare triple {57323#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {57324#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:14,068 INFO L273 TraceCheckUtils]: 15: Hoare triple {57324#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57324#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:14,069 INFO L273 TraceCheckUtils]: 16: Hoare triple {57324#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57324#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:14,069 INFO L273 TraceCheckUtils]: 17: Hoare triple {57324#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {57325#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:14,070 INFO L273 TraceCheckUtils]: 18: Hoare triple {57325#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57325#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:14,070 INFO L273 TraceCheckUtils]: 19: Hoare triple {57325#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57325#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:14,071 INFO L273 TraceCheckUtils]: 20: Hoare triple {57325#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {57326#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:14,071 INFO L273 TraceCheckUtils]: 21: Hoare triple {57326#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57326#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:14,072 INFO L273 TraceCheckUtils]: 22: Hoare triple {57326#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57326#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:14,073 INFO L273 TraceCheckUtils]: 23: Hoare triple {57326#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {57327#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:14,073 INFO L273 TraceCheckUtils]: 24: Hoare triple {57327#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57327#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:14,074 INFO L273 TraceCheckUtils]: 25: Hoare triple {57327#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57327#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:14,074 INFO L273 TraceCheckUtils]: 26: Hoare triple {57327#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {57328#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:14,075 INFO L273 TraceCheckUtils]: 27: Hoare triple {57328#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57328#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:14,075 INFO L273 TraceCheckUtils]: 28: Hoare triple {57328#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57328#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:14,076 INFO L273 TraceCheckUtils]: 29: Hoare triple {57328#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {57329#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:14,076 INFO L273 TraceCheckUtils]: 30: Hoare triple {57329#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57329#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:14,077 INFO L273 TraceCheckUtils]: 31: Hoare triple {57329#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57329#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:14,077 INFO L273 TraceCheckUtils]: 32: Hoare triple {57329#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {57330#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:14,078 INFO L273 TraceCheckUtils]: 33: Hoare triple {57330#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57330#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:14,078 INFO L273 TraceCheckUtils]: 34: Hoare triple {57330#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57330#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:14,079 INFO L273 TraceCheckUtils]: 35: Hoare triple {57330#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {57331#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:14,080 INFO L273 TraceCheckUtils]: 36: Hoare triple {57331#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57331#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:14,080 INFO L273 TraceCheckUtils]: 37: Hoare triple {57331#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57331#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:14,081 INFO L273 TraceCheckUtils]: 38: Hoare triple {57331#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {57332#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:14,081 INFO L273 TraceCheckUtils]: 39: Hoare triple {57332#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57332#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:14,082 INFO L273 TraceCheckUtils]: 40: Hoare triple {57332#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57332#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:14,082 INFO L273 TraceCheckUtils]: 41: Hoare triple {57332#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {57333#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:14,083 INFO L273 TraceCheckUtils]: 42: Hoare triple {57333#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57333#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:14,083 INFO L273 TraceCheckUtils]: 43: Hoare triple {57333#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57333#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:14,084 INFO L273 TraceCheckUtils]: 44: Hoare triple {57333#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {57334#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:14,084 INFO L273 TraceCheckUtils]: 45: Hoare triple {57334#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57334#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:14,085 INFO L273 TraceCheckUtils]: 46: Hoare triple {57334#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57334#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:14,086 INFO L273 TraceCheckUtils]: 47: Hoare triple {57334#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {57335#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:14,086 INFO L273 TraceCheckUtils]: 48: Hoare triple {57335#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57335#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:14,087 INFO L273 TraceCheckUtils]: 49: Hoare triple {57335#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57335#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:14,087 INFO L273 TraceCheckUtils]: 50: Hoare triple {57335#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {57336#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:14,088 INFO L273 TraceCheckUtils]: 51: Hoare triple {57336#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57336#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:14,088 INFO L273 TraceCheckUtils]: 52: Hoare triple {57336#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57336#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:14,089 INFO L273 TraceCheckUtils]: 53: Hoare triple {57336#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {57337#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:14,089 INFO L273 TraceCheckUtils]: 54: Hoare triple {57337#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57337#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:14,090 INFO L273 TraceCheckUtils]: 55: Hoare triple {57337#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57337#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:14,090 INFO L273 TraceCheckUtils]: 56: Hoare triple {57337#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {57338#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:14,091 INFO L273 TraceCheckUtils]: 57: Hoare triple {57338#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57338#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:14,091 INFO L273 TraceCheckUtils]: 58: Hoare triple {57338#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57338#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:14,092 INFO L273 TraceCheckUtils]: 59: Hoare triple {57338#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {57339#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:14,093 INFO L273 TraceCheckUtils]: 60: Hoare triple {57339#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57339#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:14,093 INFO L273 TraceCheckUtils]: 61: Hoare triple {57339#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57339#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:14,094 INFO L273 TraceCheckUtils]: 62: Hoare triple {57339#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {57340#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:14,094 INFO L273 TraceCheckUtils]: 63: Hoare triple {57340#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57340#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:14,095 INFO L273 TraceCheckUtils]: 64: Hoare triple {57340#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57340#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:14,095 INFO L273 TraceCheckUtils]: 65: Hoare triple {57340#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {57341#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:14,096 INFO L273 TraceCheckUtils]: 66: Hoare triple {57341#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57341#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:14,096 INFO L273 TraceCheckUtils]: 67: Hoare triple {57341#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57341#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:14,097 INFO L273 TraceCheckUtils]: 68: Hoare triple {57341#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {57342#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:14,098 INFO L273 TraceCheckUtils]: 69: Hoare triple {57342#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57342#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:14,098 INFO L273 TraceCheckUtils]: 70: Hoare triple {57342#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57342#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:14,099 INFO L273 TraceCheckUtils]: 71: Hoare triple {57342#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {57343#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:14,099 INFO L273 TraceCheckUtils]: 72: Hoare triple {57343#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57343#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:14,100 INFO L273 TraceCheckUtils]: 73: Hoare triple {57343#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57343#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:14,100 INFO L273 TraceCheckUtils]: 74: Hoare triple {57343#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {57344#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:14,101 INFO L273 TraceCheckUtils]: 75: Hoare triple {57344#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57344#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:14,101 INFO L273 TraceCheckUtils]: 76: Hoare triple {57344#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57344#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:14,102 INFO L273 TraceCheckUtils]: 77: Hoare triple {57344#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {57345#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:14,103 INFO L273 TraceCheckUtils]: 78: Hoare triple {57345#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57345#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:14,103 INFO L273 TraceCheckUtils]: 79: Hoare triple {57345#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57345#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:14,104 INFO L273 TraceCheckUtils]: 80: Hoare triple {57345#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {57346#(<= main_~i~0 25)} is VALID [2018-11-23 11:58:14,104 INFO L273 TraceCheckUtils]: 81: Hoare triple {57346#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57346#(<= main_~i~0 25)} is VALID [2018-11-23 11:58:14,105 INFO L273 TraceCheckUtils]: 82: Hoare triple {57346#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57346#(<= main_~i~0 25)} is VALID [2018-11-23 11:58:14,106 INFO L273 TraceCheckUtils]: 83: Hoare triple {57346#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {57347#(<= main_~i~0 26)} is VALID [2018-11-23 11:58:14,106 INFO L273 TraceCheckUtils]: 84: Hoare triple {57347#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57347#(<= main_~i~0 26)} is VALID [2018-11-23 11:58:14,106 INFO L273 TraceCheckUtils]: 85: Hoare triple {57347#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57347#(<= main_~i~0 26)} is VALID [2018-11-23 11:58:14,107 INFO L273 TraceCheckUtils]: 86: Hoare triple {57347#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {57348#(<= main_~i~0 27)} is VALID [2018-11-23 11:58:14,108 INFO L273 TraceCheckUtils]: 87: Hoare triple {57348#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57348#(<= main_~i~0 27)} is VALID [2018-11-23 11:58:14,108 INFO L273 TraceCheckUtils]: 88: Hoare triple {57348#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57348#(<= main_~i~0 27)} is VALID [2018-11-23 11:58:14,109 INFO L273 TraceCheckUtils]: 89: Hoare triple {57348#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {57349#(<= main_~i~0 28)} is VALID [2018-11-23 11:58:14,109 INFO L273 TraceCheckUtils]: 90: Hoare triple {57349#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57349#(<= main_~i~0 28)} is VALID [2018-11-23 11:58:14,110 INFO L273 TraceCheckUtils]: 91: Hoare triple {57349#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57349#(<= main_~i~0 28)} is VALID [2018-11-23 11:58:14,110 INFO L273 TraceCheckUtils]: 92: Hoare triple {57349#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {57350#(<= main_~i~0 29)} is VALID [2018-11-23 11:58:14,111 INFO L273 TraceCheckUtils]: 93: Hoare triple {57350#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57350#(<= main_~i~0 29)} is VALID [2018-11-23 11:58:14,111 INFO L273 TraceCheckUtils]: 94: Hoare triple {57350#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57350#(<= main_~i~0 29)} is VALID [2018-11-23 11:58:14,112 INFO L273 TraceCheckUtils]: 95: Hoare triple {57350#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {57351#(<= main_~i~0 30)} is VALID [2018-11-23 11:58:14,113 INFO L273 TraceCheckUtils]: 96: Hoare triple {57351#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57351#(<= main_~i~0 30)} is VALID [2018-11-23 11:58:14,113 INFO L273 TraceCheckUtils]: 97: Hoare triple {57351#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57351#(<= main_~i~0 30)} is VALID [2018-11-23 11:58:14,114 INFO L273 TraceCheckUtils]: 98: Hoare triple {57351#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {57352#(<= main_~i~0 31)} is VALID [2018-11-23 11:58:14,114 INFO L273 TraceCheckUtils]: 99: Hoare triple {57352#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57352#(<= main_~i~0 31)} is VALID [2018-11-23 11:58:14,115 INFO L273 TraceCheckUtils]: 100: Hoare triple {57352#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57352#(<= main_~i~0 31)} is VALID [2018-11-23 11:58:14,115 INFO L273 TraceCheckUtils]: 101: Hoare triple {57352#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {57353#(<= main_~i~0 32)} is VALID [2018-11-23 11:58:14,116 INFO L273 TraceCheckUtils]: 102: Hoare triple {57353#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57353#(<= main_~i~0 32)} is VALID [2018-11-23 11:58:14,116 INFO L273 TraceCheckUtils]: 103: Hoare triple {57353#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57353#(<= main_~i~0 32)} is VALID [2018-11-23 11:58:14,117 INFO L273 TraceCheckUtils]: 104: Hoare triple {57353#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {57354#(<= main_~i~0 33)} is VALID [2018-11-23 11:58:14,117 INFO L273 TraceCheckUtils]: 105: Hoare triple {57354#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57354#(<= main_~i~0 33)} is VALID [2018-11-23 11:58:14,118 INFO L273 TraceCheckUtils]: 106: Hoare triple {57354#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57354#(<= main_~i~0 33)} is VALID [2018-11-23 11:58:14,119 INFO L273 TraceCheckUtils]: 107: Hoare triple {57354#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {57355#(<= main_~i~0 34)} is VALID [2018-11-23 11:58:14,119 INFO L273 TraceCheckUtils]: 108: Hoare triple {57355#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57355#(<= main_~i~0 34)} is VALID [2018-11-23 11:58:14,120 INFO L273 TraceCheckUtils]: 109: Hoare triple {57355#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57355#(<= main_~i~0 34)} is VALID [2018-11-23 11:58:14,120 INFO L273 TraceCheckUtils]: 110: Hoare triple {57355#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {57356#(<= main_~i~0 35)} is VALID [2018-11-23 11:58:14,121 INFO L273 TraceCheckUtils]: 111: Hoare triple {57356#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57356#(<= main_~i~0 35)} is VALID [2018-11-23 11:58:14,121 INFO L273 TraceCheckUtils]: 112: Hoare triple {57356#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57356#(<= main_~i~0 35)} is VALID [2018-11-23 11:58:14,122 INFO L273 TraceCheckUtils]: 113: Hoare triple {57356#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {57357#(<= main_~i~0 36)} is VALID [2018-11-23 11:58:14,122 INFO L273 TraceCheckUtils]: 114: Hoare triple {57357#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57357#(<= main_~i~0 36)} is VALID [2018-11-23 11:58:14,123 INFO L273 TraceCheckUtils]: 115: Hoare triple {57357#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57357#(<= main_~i~0 36)} is VALID [2018-11-23 11:58:14,124 INFO L273 TraceCheckUtils]: 116: Hoare triple {57357#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {57358#(<= main_~i~0 37)} is VALID [2018-11-23 11:58:14,124 INFO L273 TraceCheckUtils]: 117: Hoare triple {57358#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57358#(<= main_~i~0 37)} is VALID [2018-11-23 11:58:14,124 INFO L273 TraceCheckUtils]: 118: Hoare triple {57358#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57358#(<= main_~i~0 37)} is VALID [2018-11-23 11:58:14,125 INFO L273 TraceCheckUtils]: 119: Hoare triple {57358#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {57359#(<= main_~i~0 38)} is VALID [2018-11-23 11:58:14,126 INFO L273 TraceCheckUtils]: 120: Hoare triple {57359#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57359#(<= main_~i~0 38)} is VALID [2018-11-23 11:58:14,126 INFO L273 TraceCheckUtils]: 121: Hoare triple {57359#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57359#(<= main_~i~0 38)} is VALID [2018-11-23 11:58:14,127 INFO L273 TraceCheckUtils]: 122: Hoare triple {57359#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {57360#(<= main_~i~0 39)} is VALID [2018-11-23 11:58:14,127 INFO L273 TraceCheckUtils]: 123: Hoare triple {57360#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57360#(<= main_~i~0 39)} is VALID [2018-11-23 11:58:14,128 INFO L273 TraceCheckUtils]: 124: Hoare triple {57360#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57360#(<= main_~i~0 39)} is VALID [2018-11-23 11:58:14,128 INFO L273 TraceCheckUtils]: 125: Hoare triple {57360#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {57361#(<= main_~i~0 40)} is VALID [2018-11-23 11:58:14,129 INFO L273 TraceCheckUtils]: 126: Hoare triple {57361#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57361#(<= main_~i~0 40)} is VALID [2018-11-23 11:58:14,129 INFO L273 TraceCheckUtils]: 127: Hoare triple {57361#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57361#(<= main_~i~0 40)} is VALID [2018-11-23 11:58:14,130 INFO L273 TraceCheckUtils]: 128: Hoare triple {57361#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {57362#(<= main_~i~0 41)} is VALID [2018-11-23 11:58:14,131 INFO L273 TraceCheckUtils]: 129: Hoare triple {57362#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57362#(<= main_~i~0 41)} is VALID [2018-11-23 11:58:14,131 INFO L273 TraceCheckUtils]: 130: Hoare triple {57362#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57362#(<= main_~i~0 41)} is VALID [2018-11-23 11:58:14,132 INFO L273 TraceCheckUtils]: 131: Hoare triple {57362#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {57363#(<= main_~i~0 42)} is VALID [2018-11-23 11:58:14,132 INFO L273 TraceCheckUtils]: 132: Hoare triple {57363#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57363#(<= main_~i~0 42)} is VALID [2018-11-23 11:58:14,133 INFO L273 TraceCheckUtils]: 133: Hoare triple {57363#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57363#(<= main_~i~0 42)} is VALID [2018-11-23 11:58:14,134 INFO L273 TraceCheckUtils]: 134: Hoare triple {57363#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {57364#(<= main_~i~0 43)} is VALID [2018-11-23 11:58:14,134 INFO L273 TraceCheckUtils]: 135: Hoare triple {57364#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57364#(<= main_~i~0 43)} is VALID [2018-11-23 11:58:14,135 INFO L273 TraceCheckUtils]: 136: Hoare triple {57364#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57364#(<= main_~i~0 43)} is VALID [2018-11-23 11:58:14,135 INFO L273 TraceCheckUtils]: 137: Hoare triple {57364#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {57365#(<= main_~i~0 44)} is VALID [2018-11-23 11:58:14,136 INFO L273 TraceCheckUtils]: 138: Hoare triple {57365#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57365#(<= main_~i~0 44)} is VALID [2018-11-23 11:58:14,136 INFO L273 TraceCheckUtils]: 139: Hoare triple {57365#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57365#(<= main_~i~0 44)} is VALID [2018-11-23 11:58:14,137 INFO L273 TraceCheckUtils]: 140: Hoare triple {57365#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {57366#(<= main_~i~0 45)} is VALID [2018-11-23 11:58:14,137 INFO L273 TraceCheckUtils]: 141: Hoare triple {57366#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57366#(<= main_~i~0 45)} is VALID [2018-11-23 11:58:14,138 INFO L273 TraceCheckUtils]: 142: Hoare triple {57366#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57366#(<= main_~i~0 45)} is VALID [2018-11-23 11:58:14,139 INFO L273 TraceCheckUtils]: 143: Hoare triple {57366#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {57367#(<= main_~i~0 46)} is VALID [2018-11-23 11:58:14,139 INFO L273 TraceCheckUtils]: 144: Hoare triple {57367#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57367#(<= main_~i~0 46)} is VALID [2018-11-23 11:58:14,140 INFO L273 TraceCheckUtils]: 145: Hoare triple {57367#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57367#(<= main_~i~0 46)} is VALID [2018-11-23 11:58:14,140 INFO L273 TraceCheckUtils]: 146: Hoare triple {57367#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {57368#(<= main_~i~0 47)} is VALID [2018-11-23 11:58:14,141 INFO L273 TraceCheckUtils]: 147: Hoare triple {57368#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57368#(<= main_~i~0 47)} is VALID [2018-11-23 11:58:14,141 INFO L273 TraceCheckUtils]: 148: Hoare triple {57368#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57368#(<= main_~i~0 47)} is VALID [2018-11-23 11:58:14,142 INFO L273 TraceCheckUtils]: 149: Hoare triple {57368#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {57369#(<= main_~i~0 48)} is VALID [2018-11-23 11:58:14,143 INFO L273 TraceCheckUtils]: 150: Hoare triple {57369#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57369#(<= main_~i~0 48)} is VALID [2018-11-23 11:58:14,143 INFO L273 TraceCheckUtils]: 151: Hoare triple {57369#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57369#(<= main_~i~0 48)} is VALID [2018-11-23 11:58:14,144 INFO L273 TraceCheckUtils]: 152: Hoare triple {57369#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {57370#(<= main_~i~0 49)} is VALID [2018-11-23 11:58:14,144 INFO L273 TraceCheckUtils]: 153: Hoare triple {57370#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57370#(<= main_~i~0 49)} is VALID [2018-11-23 11:58:14,145 INFO L273 TraceCheckUtils]: 154: Hoare triple {57370#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57370#(<= main_~i~0 49)} is VALID [2018-11-23 11:58:14,145 INFO L273 TraceCheckUtils]: 155: Hoare triple {57370#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {57371#(<= main_~i~0 50)} is VALID [2018-11-23 11:58:14,146 INFO L273 TraceCheckUtils]: 156: Hoare triple {57371#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57371#(<= main_~i~0 50)} is VALID [2018-11-23 11:58:14,146 INFO L273 TraceCheckUtils]: 157: Hoare triple {57371#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57371#(<= main_~i~0 50)} is VALID [2018-11-23 11:58:14,147 INFO L273 TraceCheckUtils]: 158: Hoare triple {57371#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {57372#(<= main_~i~0 51)} is VALID [2018-11-23 11:58:14,148 INFO L273 TraceCheckUtils]: 159: Hoare triple {57372#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57372#(<= main_~i~0 51)} is VALID [2018-11-23 11:58:14,148 INFO L273 TraceCheckUtils]: 160: Hoare triple {57372#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57372#(<= main_~i~0 51)} is VALID [2018-11-23 11:58:14,149 INFO L273 TraceCheckUtils]: 161: Hoare triple {57372#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {57373#(<= main_~i~0 52)} is VALID [2018-11-23 11:58:14,149 INFO L273 TraceCheckUtils]: 162: Hoare triple {57373#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57373#(<= main_~i~0 52)} is VALID [2018-11-23 11:58:14,150 INFO L273 TraceCheckUtils]: 163: Hoare triple {57373#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57373#(<= main_~i~0 52)} is VALID [2018-11-23 11:58:14,151 INFO L273 TraceCheckUtils]: 164: Hoare triple {57373#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {57374#(<= main_~i~0 53)} is VALID [2018-11-23 11:58:14,151 INFO L273 TraceCheckUtils]: 165: Hoare triple {57374#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57374#(<= main_~i~0 53)} is VALID [2018-11-23 11:58:14,152 INFO L273 TraceCheckUtils]: 166: Hoare triple {57374#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57374#(<= main_~i~0 53)} is VALID [2018-11-23 11:58:14,152 INFO L273 TraceCheckUtils]: 167: Hoare triple {57374#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {57375#(<= main_~i~0 54)} is VALID [2018-11-23 11:58:14,153 INFO L273 TraceCheckUtils]: 168: Hoare triple {57375#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57375#(<= main_~i~0 54)} is VALID [2018-11-23 11:58:14,153 INFO L273 TraceCheckUtils]: 169: Hoare triple {57375#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57375#(<= main_~i~0 54)} is VALID [2018-11-23 11:58:14,154 INFO L273 TraceCheckUtils]: 170: Hoare triple {57375#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {57376#(<= main_~i~0 55)} is VALID [2018-11-23 11:58:14,154 INFO L273 TraceCheckUtils]: 171: Hoare triple {57376#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57376#(<= main_~i~0 55)} is VALID [2018-11-23 11:58:14,155 INFO L273 TraceCheckUtils]: 172: Hoare triple {57376#(<= main_~i~0 55)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57376#(<= main_~i~0 55)} is VALID [2018-11-23 11:58:14,155 INFO L273 TraceCheckUtils]: 173: Hoare triple {57376#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {57377#(<= main_~i~0 56)} is VALID [2018-11-23 11:58:14,156 INFO L273 TraceCheckUtils]: 174: Hoare triple {57377#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57377#(<= main_~i~0 56)} is VALID [2018-11-23 11:58:14,156 INFO L273 TraceCheckUtils]: 175: Hoare triple {57377#(<= main_~i~0 56)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57377#(<= main_~i~0 56)} is VALID [2018-11-23 11:58:14,157 INFO L273 TraceCheckUtils]: 176: Hoare triple {57377#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {57378#(<= main_~i~0 57)} is VALID [2018-11-23 11:58:14,157 INFO L273 TraceCheckUtils]: 177: Hoare triple {57378#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57378#(<= main_~i~0 57)} is VALID [2018-11-23 11:58:14,158 INFO L273 TraceCheckUtils]: 178: Hoare triple {57378#(<= main_~i~0 57)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57378#(<= main_~i~0 57)} is VALID [2018-11-23 11:58:14,159 INFO L273 TraceCheckUtils]: 179: Hoare triple {57378#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {57379#(<= main_~i~0 58)} is VALID [2018-11-23 11:58:14,159 INFO L273 TraceCheckUtils]: 180: Hoare triple {57379#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57379#(<= main_~i~0 58)} is VALID [2018-11-23 11:58:14,160 INFO L273 TraceCheckUtils]: 181: Hoare triple {57379#(<= main_~i~0 58)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57379#(<= main_~i~0 58)} is VALID [2018-11-23 11:58:14,160 INFO L273 TraceCheckUtils]: 182: Hoare triple {57379#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {57380#(<= main_~i~0 59)} is VALID [2018-11-23 11:58:14,161 INFO L273 TraceCheckUtils]: 183: Hoare triple {57380#(<= main_~i~0 59)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57380#(<= main_~i~0 59)} is VALID [2018-11-23 11:58:14,161 INFO L273 TraceCheckUtils]: 184: Hoare triple {57380#(<= main_~i~0 59)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57380#(<= main_~i~0 59)} is VALID [2018-11-23 11:58:14,162 INFO L273 TraceCheckUtils]: 185: Hoare triple {57380#(<= main_~i~0 59)} ~i~0 := 1 + ~i~0; {57381#(<= main_~i~0 60)} is VALID [2018-11-23 11:58:14,162 INFO L273 TraceCheckUtils]: 186: Hoare triple {57381#(<= main_~i~0 60)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57381#(<= main_~i~0 60)} is VALID [2018-11-23 11:58:14,163 INFO L273 TraceCheckUtils]: 187: Hoare triple {57381#(<= main_~i~0 60)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57381#(<= main_~i~0 60)} is VALID [2018-11-23 11:58:14,163 INFO L273 TraceCheckUtils]: 188: Hoare triple {57381#(<= main_~i~0 60)} ~i~0 := 1 + ~i~0; {57382#(<= main_~i~0 61)} is VALID [2018-11-23 11:58:14,164 INFO L273 TraceCheckUtils]: 189: Hoare triple {57382#(<= main_~i~0 61)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57382#(<= main_~i~0 61)} is VALID [2018-11-23 11:58:14,164 INFO L273 TraceCheckUtils]: 190: Hoare triple {57382#(<= main_~i~0 61)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57382#(<= main_~i~0 61)} is VALID [2018-11-23 11:58:14,165 INFO L273 TraceCheckUtils]: 191: Hoare triple {57382#(<= main_~i~0 61)} ~i~0 := 1 + ~i~0; {57383#(<= main_~i~0 62)} is VALID [2018-11-23 11:58:14,166 INFO L273 TraceCheckUtils]: 192: Hoare triple {57383#(<= main_~i~0 62)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57383#(<= main_~i~0 62)} is VALID [2018-11-23 11:58:14,166 INFO L273 TraceCheckUtils]: 193: Hoare triple {57383#(<= main_~i~0 62)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {57383#(<= main_~i~0 62)} is VALID [2018-11-23 11:58:14,167 INFO L273 TraceCheckUtils]: 194: Hoare triple {57383#(<= main_~i~0 62)} ~i~0 := 1 + ~i~0; {57384#(<= main_~i~0 63)} is VALID [2018-11-23 11:58:14,167 INFO L273 TraceCheckUtils]: 195: Hoare triple {57384#(<= main_~i~0 63)} assume !(~i~0 < 100000); {57320#false} is VALID [2018-11-23 11:58:14,168 INFO L273 TraceCheckUtils]: 196: Hoare triple {57320#false} havoc ~x~0;~x~0 := 0; {57320#false} is VALID [2018-11-23 11:58:14,168 INFO L273 TraceCheckUtils]: 197: Hoare triple {57320#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {57320#false} is VALID [2018-11-23 11:58:14,168 INFO L256 TraceCheckUtils]: 198: Hoare triple {57320#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {57320#false} is VALID [2018-11-23 11:58:14,168 INFO L273 TraceCheckUtils]: 199: Hoare triple {57320#false} ~cond := #in~cond; {57320#false} is VALID [2018-11-23 11:58:14,168 INFO L273 TraceCheckUtils]: 200: Hoare triple {57320#false} assume 0 == ~cond; {57320#false} is VALID [2018-11-23 11:58:14,168 INFO L273 TraceCheckUtils]: 201: Hoare triple {57320#false} assume !false; {57320#false} is VALID [2018-11-23 11:58:14,196 INFO L134 CoverageAnalysis]: Checked inductivity of 5922 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:14,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:14,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 67 [2018-11-23 11:58:14,216 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 202 [2018-11-23 11:58:14,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:14,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 67 states. [2018-11-23 11:58:14,418 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:14,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-11-23 11:58:14,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-11-23 11:58:14,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-11-23 11:58:14,420 INFO L87 Difference]: Start difference. First operand 207 states and 271 transitions. Second operand 67 states. [2018-11-23 11:58:15,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:15,584 INFO L93 Difference]: Finished difference Result 223 states and 290 transitions. [2018-11-23 11:58:15,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-11-23 11:58:15,584 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 202 [2018-11-23 11:58:15,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:15,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 11:58:15,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 290 transitions. [2018-11-23 11:58:15,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 11:58:15,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 290 transitions. [2018-11-23 11:58:15,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 66 states and 290 transitions. [2018-11-23 11:58:15,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 290 edges. 290 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:15,855 INFO L225 Difference]: With dead ends: 223 [2018-11-23 11:58:15,855 INFO L226 Difference]: Without dead ends: 212 [2018-11-23 11:58:15,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-11-23 11:58:15,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-11-23 11:58:15,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2018-11-23 11:58:15,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:15,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand 210 states. [2018-11-23 11:58:15,903 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand 210 states. [2018-11-23 11:58:15,903 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 210 states. [2018-11-23 11:58:15,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:15,908 INFO L93 Difference]: Finished difference Result 212 states and 278 transitions. [2018-11-23 11:58:15,908 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 278 transitions. [2018-11-23 11:58:15,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:15,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:15,909 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand 212 states. [2018-11-23 11:58:15,909 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 212 states. [2018-11-23 11:58:15,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:15,912 INFO L93 Difference]: Finished difference Result 212 states and 278 transitions. [2018-11-23 11:58:15,912 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 278 transitions. [2018-11-23 11:58:15,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:15,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:15,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:15,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:15,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-23 11:58:15,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 275 transitions. [2018-11-23 11:58:15,917 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 275 transitions. Word has length 202 [2018-11-23 11:58:15,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:15,918 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 275 transitions. [2018-11-23 11:58:15,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-11-23 11:58:15,918 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 275 transitions. [2018-11-23 11:58:15,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-23 11:58:15,919 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:15,919 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:15,919 INFO L423 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:15,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:15,920 INFO L82 PathProgramCache]: Analyzing trace with hash 746276025, now seen corresponding path program 64 times [2018-11-23 11:58:15,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:15,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:15,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:15,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:15,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:18,041 INFO L256 TraceCheckUtils]: 0: Hoare triple {58995#true} call ULTIMATE.init(); {58995#true} is VALID [2018-11-23 11:58:18,041 INFO L273 TraceCheckUtils]: 1: Hoare triple {58995#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {58995#true} is VALID [2018-11-23 11:58:18,041 INFO L273 TraceCheckUtils]: 2: Hoare triple {58995#true} assume true; {58995#true} is VALID [2018-11-23 11:58:18,041 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {58995#true} {58995#true} #55#return; {58995#true} is VALID [2018-11-23 11:58:18,042 INFO L256 TraceCheckUtils]: 4: Hoare triple {58995#true} call #t~ret4 := main(); {58995#true} is VALID [2018-11-23 11:58:18,042 INFO L273 TraceCheckUtils]: 5: Hoare triple {58995#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {58997#(= main_~i~0 0)} is VALID [2018-11-23 11:58:18,043 INFO L273 TraceCheckUtils]: 6: Hoare triple {58997#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58997#(= main_~i~0 0)} is VALID [2018-11-23 11:58:18,043 INFO L273 TraceCheckUtils]: 7: Hoare triple {58997#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {58997#(= main_~i~0 0)} is VALID [2018-11-23 11:58:18,044 INFO L273 TraceCheckUtils]: 8: Hoare triple {58997#(= main_~i~0 0)} ~i~0 := 1 + ~i~0; {58998#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:18,044 INFO L273 TraceCheckUtils]: 9: Hoare triple {58998#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58998#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:18,045 INFO L273 TraceCheckUtils]: 10: Hoare triple {58998#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {58998#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:18,045 INFO L273 TraceCheckUtils]: 11: Hoare triple {58998#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {58999#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:18,046 INFO L273 TraceCheckUtils]: 12: Hoare triple {58999#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58999#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:18,046 INFO L273 TraceCheckUtils]: 13: Hoare triple {58999#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {58999#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:18,047 INFO L273 TraceCheckUtils]: 14: Hoare triple {58999#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {59000#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:18,047 INFO L273 TraceCheckUtils]: 15: Hoare triple {59000#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59000#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:18,048 INFO L273 TraceCheckUtils]: 16: Hoare triple {59000#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59000#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:18,049 INFO L273 TraceCheckUtils]: 17: Hoare triple {59000#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {59001#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:18,049 INFO L273 TraceCheckUtils]: 18: Hoare triple {59001#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59001#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:18,050 INFO L273 TraceCheckUtils]: 19: Hoare triple {59001#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59001#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:18,050 INFO L273 TraceCheckUtils]: 20: Hoare triple {59001#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {59002#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:18,051 INFO L273 TraceCheckUtils]: 21: Hoare triple {59002#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59002#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:18,051 INFO L273 TraceCheckUtils]: 22: Hoare triple {59002#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59002#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:18,052 INFO L273 TraceCheckUtils]: 23: Hoare triple {59002#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {59003#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:18,052 INFO L273 TraceCheckUtils]: 24: Hoare triple {59003#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59003#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:18,053 INFO L273 TraceCheckUtils]: 25: Hoare triple {59003#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59003#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:18,053 INFO L273 TraceCheckUtils]: 26: Hoare triple {59003#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {59004#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:18,054 INFO L273 TraceCheckUtils]: 27: Hoare triple {59004#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59004#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:18,054 INFO L273 TraceCheckUtils]: 28: Hoare triple {59004#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59004#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:18,055 INFO L273 TraceCheckUtils]: 29: Hoare triple {59004#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {59005#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:18,056 INFO L273 TraceCheckUtils]: 30: Hoare triple {59005#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59005#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:18,056 INFO L273 TraceCheckUtils]: 31: Hoare triple {59005#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59005#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:18,057 INFO L273 TraceCheckUtils]: 32: Hoare triple {59005#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {59006#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:18,057 INFO L273 TraceCheckUtils]: 33: Hoare triple {59006#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59006#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:18,058 INFO L273 TraceCheckUtils]: 34: Hoare triple {59006#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59006#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:18,058 INFO L273 TraceCheckUtils]: 35: Hoare triple {59006#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {59007#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:18,059 INFO L273 TraceCheckUtils]: 36: Hoare triple {59007#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59007#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:18,059 INFO L273 TraceCheckUtils]: 37: Hoare triple {59007#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59007#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:18,060 INFO L273 TraceCheckUtils]: 38: Hoare triple {59007#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {59008#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:18,060 INFO L273 TraceCheckUtils]: 39: Hoare triple {59008#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59008#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:18,061 INFO L273 TraceCheckUtils]: 40: Hoare triple {59008#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59008#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:18,062 INFO L273 TraceCheckUtils]: 41: Hoare triple {59008#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {59009#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:18,062 INFO L273 TraceCheckUtils]: 42: Hoare triple {59009#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59009#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:18,063 INFO L273 TraceCheckUtils]: 43: Hoare triple {59009#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59009#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:18,063 INFO L273 TraceCheckUtils]: 44: Hoare triple {59009#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {59010#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:18,064 INFO L273 TraceCheckUtils]: 45: Hoare triple {59010#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59010#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:18,064 INFO L273 TraceCheckUtils]: 46: Hoare triple {59010#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59010#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:18,065 INFO L273 TraceCheckUtils]: 47: Hoare triple {59010#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {59011#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:18,065 INFO L273 TraceCheckUtils]: 48: Hoare triple {59011#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59011#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:18,066 INFO L273 TraceCheckUtils]: 49: Hoare triple {59011#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59011#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:18,067 INFO L273 TraceCheckUtils]: 50: Hoare triple {59011#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {59012#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:18,067 INFO L273 TraceCheckUtils]: 51: Hoare triple {59012#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59012#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:18,068 INFO L273 TraceCheckUtils]: 52: Hoare triple {59012#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59012#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:18,068 INFO L273 TraceCheckUtils]: 53: Hoare triple {59012#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {59013#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:18,069 INFO L273 TraceCheckUtils]: 54: Hoare triple {59013#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59013#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:18,069 INFO L273 TraceCheckUtils]: 55: Hoare triple {59013#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59013#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:18,070 INFO L273 TraceCheckUtils]: 56: Hoare triple {59013#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {59014#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:18,070 INFO L273 TraceCheckUtils]: 57: Hoare triple {59014#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59014#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:18,071 INFO L273 TraceCheckUtils]: 58: Hoare triple {59014#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59014#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:18,071 INFO L273 TraceCheckUtils]: 59: Hoare triple {59014#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {59015#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:18,072 INFO L273 TraceCheckUtils]: 60: Hoare triple {59015#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59015#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:18,072 INFO L273 TraceCheckUtils]: 61: Hoare triple {59015#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59015#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:18,073 INFO L273 TraceCheckUtils]: 62: Hoare triple {59015#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {59016#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:18,074 INFO L273 TraceCheckUtils]: 63: Hoare triple {59016#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59016#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:18,074 INFO L273 TraceCheckUtils]: 64: Hoare triple {59016#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59016#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:18,075 INFO L273 TraceCheckUtils]: 65: Hoare triple {59016#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {59017#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:18,075 INFO L273 TraceCheckUtils]: 66: Hoare triple {59017#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59017#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:18,076 INFO L273 TraceCheckUtils]: 67: Hoare triple {59017#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59017#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:18,076 INFO L273 TraceCheckUtils]: 68: Hoare triple {59017#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {59018#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:18,077 INFO L273 TraceCheckUtils]: 69: Hoare triple {59018#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59018#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:18,077 INFO L273 TraceCheckUtils]: 70: Hoare triple {59018#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59018#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:18,078 INFO L273 TraceCheckUtils]: 71: Hoare triple {59018#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {59019#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:18,079 INFO L273 TraceCheckUtils]: 72: Hoare triple {59019#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59019#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:18,079 INFO L273 TraceCheckUtils]: 73: Hoare triple {59019#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59019#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:18,080 INFO L273 TraceCheckUtils]: 74: Hoare triple {59019#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {59020#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:18,080 INFO L273 TraceCheckUtils]: 75: Hoare triple {59020#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59020#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:18,081 INFO L273 TraceCheckUtils]: 76: Hoare triple {59020#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59020#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:18,081 INFO L273 TraceCheckUtils]: 77: Hoare triple {59020#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {59021#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:18,082 INFO L273 TraceCheckUtils]: 78: Hoare triple {59021#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59021#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:18,082 INFO L273 TraceCheckUtils]: 79: Hoare triple {59021#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59021#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:18,083 INFO L273 TraceCheckUtils]: 80: Hoare triple {59021#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {59022#(<= main_~i~0 25)} is VALID [2018-11-23 11:58:18,084 INFO L273 TraceCheckUtils]: 81: Hoare triple {59022#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59022#(<= main_~i~0 25)} is VALID [2018-11-23 11:58:18,084 INFO L273 TraceCheckUtils]: 82: Hoare triple {59022#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59022#(<= main_~i~0 25)} is VALID [2018-11-23 11:58:18,085 INFO L273 TraceCheckUtils]: 83: Hoare triple {59022#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {59023#(<= main_~i~0 26)} is VALID [2018-11-23 11:58:18,085 INFO L273 TraceCheckUtils]: 84: Hoare triple {59023#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59023#(<= main_~i~0 26)} is VALID [2018-11-23 11:58:18,086 INFO L273 TraceCheckUtils]: 85: Hoare triple {59023#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59023#(<= main_~i~0 26)} is VALID [2018-11-23 11:58:18,086 INFO L273 TraceCheckUtils]: 86: Hoare triple {59023#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {59024#(<= main_~i~0 27)} is VALID [2018-11-23 11:58:18,087 INFO L273 TraceCheckUtils]: 87: Hoare triple {59024#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59024#(<= main_~i~0 27)} is VALID [2018-11-23 11:58:18,087 INFO L273 TraceCheckUtils]: 88: Hoare triple {59024#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59024#(<= main_~i~0 27)} is VALID [2018-11-23 11:58:18,088 INFO L273 TraceCheckUtils]: 89: Hoare triple {59024#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {59025#(<= main_~i~0 28)} is VALID [2018-11-23 11:58:18,089 INFO L273 TraceCheckUtils]: 90: Hoare triple {59025#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59025#(<= main_~i~0 28)} is VALID [2018-11-23 11:58:18,089 INFO L273 TraceCheckUtils]: 91: Hoare triple {59025#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59025#(<= main_~i~0 28)} is VALID [2018-11-23 11:58:18,090 INFO L273 TraceCheckUtils]: 92: Hoare triple {59025#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {59026#(<= main_~i~0 29)} is VALID [2018-11-23 11:58:18,090 INFO L273 TraceCheckUtils]: 93: Hoare triple {59026#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59026#(<= main_~i~0 29)} is VALID [2018-11-23 11:58:18,091 INFO L273 TraceCheckUtils]: 94: Hoare triple {59026#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59026#(<= main_~i~0 29)} is VALID [2018-11-23 11:58:18,091 INFO L273 TraceCheckUtils]: 95: Hoare triple {59026#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {59027#(<= main_~i~0 30)} is VALID [2018-11-23 11:58:18,092 INFO L273 TraceCheckUtils]: 96: Hoare triple {59027#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59027#(<= main_~i~0 30)} is VALID [2018-11-23 11:58:18,092 INFO L273 TraceCheckUtils]: 97: Hoare triple {59027#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59027#(<= main_~i~0 30)} is VALID [2018-11-23 11:58:18,093 INFO L273 TraceCheckUtils]: 98: Hoare triple {59027#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {59028#(<= main_~i~0 31)} is VALID [2018-11-23 11:58:18,094 INFO L273 TraceCheckUtils]: 99: Hoare triple {59028#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59028#(<= main_~i~0 31)} is VALID [2018-11-23 11:58:18,094 INFO L273 TraceCheckUtils]: 100: Hoare triple {59028#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59028#(<= main_~i~0 31)} is VALID [2018-11-23 11:58:18,095 INFO L273 TraceCheckUtils]: 101: Hoare triple {59028#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {59029#(<= main_~i~0 32)} is VALID [2018-11-23 11:58:18,095 INFO L273 TraceCheckUtils]: 102: Hoare triple {59029#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59029#(<= main_~i~0 32)} is VALID [2018-11-23 11:58:18,096 INFO L273 TraceCheckUtils]: 103: Hoare triple {59029#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59029#(<= main_~i~0 32)} is VALID [2018-11-23 11:58:18,097 INFO L273 TraceCheckUtils]: 104: Hoare triple {59029#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {59030#(<= main_~i~0 33)} is VALID [2018-11-23 11:58:18,097 INFO L273 TraceCheckUtils]: 105: Hoare triple {59030#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59030#(<= main_~i~0 33)} is VALID [2018-11-23 11:58:18,098 INFO L273 TraceCheckUtils]: 106: Hoare triple {59030#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59030#(<= main_~i~0 33)} is VALID [2018-11-23 11:58:18,098 INFO L273 TraceCheckUtils]: 107: Hoare triple {59030#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {59031#(<= main_~i~0 34)} is VALID [2018-11-23 11:58:18,099 INFO L273 TraceCheckUtils]: 108: Hoare triple {59031#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59031#(<= main_~i~0 34)} is VALID [2018-11-23 11:58:18,099 INFO L273 TraceCheckUtils]: 109: Hoare triple {59031#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59031#(<= main_~i~0 34)} is VALID [2018-11-23 11:58:18,100 INFO L273 TraceCheckUtils]: 110: Hoare triple {59031#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {59032#(<= main_~i~0 35)} is VALID [2018-11-23 11:58:18,100 INFO L273 TraceCheckUtils]: 111: Hoare triple {59032#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59032#(<= main_~i~0 35)} is VALID [2018-11-23 11:58:18,101 INFO L273 TraceCheckUtils]: 112: Hoare triple {59032#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59032#(<= main_~i~0 35)} is VALID [2018-11-23 11:58:18,101 INFO L273 TraceCheckUtils]: 113: Hoare triple {59032#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {59033#(<= main_~i~0 36)} is VALID [2018-11-23 11:58:18,102 INFO L273 TraceCheckUtils]: 114: Hoare triple {59033#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59033#(<= main_~i~0 36)} is VALID [2018-11-23 11:58:18,102 INFO L273 TraceCheckUtils]: 115: Hoare triple {59033#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59033#(<= main_~i~0 36)} is VALID [2018-11-23 11:58:18,103 INFO L273 TraceCheckUtils]: 116: Hoare triple {59033#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {59034#(<= main_~i~0 37)} is VALID [2018-11-23 11:58:18,104 INFO L273 TraceCheckUtils]: 117: Hoare triple {59034#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59034#(<= main_~i~0 37)} is VALID [2018-11-23 11:58:18,104 INFO L273 TraceCheckUtils]: 118: Hoare triple {59034#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59034#(<= main_~i~0 37)} is VALID [2018-11-23 11:58:18,105 INFO L273 TraceCheckUtils]: 119: Hoare triple {59034#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {59035#(<= main_~i~0 38)} is VALID [2018-11-23 11:58:18,105 INFO L273 TraceCheckUtils]: 120: Hoare triple {59035#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59035#(<= main_~i~0 38)} is VALID [2018-11-23 11:58:18,106 INFO L273 TraceCheckUtils]: 121: Hoare triple {59035#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59035#(<= main_~i~0 38)} is VALID [2018-11-23 11:58:18,107 INFO L273 TraceCheckUtils]: 122: Hoare triple {59035#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {59036#(<= main_~i~0 39)} is VALID [2018-11-23 11:58:18,107 INFO L273 TraceCheckUtils]: 123: Hoare triple {59036#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59036#(<= main_~i~0 39)} is VALID [2018-11-23 11:58:18,108 INFO L273 TraceCheckUtils]: 124: Hoare triple {59036#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59036#(<= main_~i~0 39)} is VALID [2018-11-23 11:58:18,108 INFO L273 TraceCheckUtils]: 125: Hoare triple {59036#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {59037#(<= main_~i~0 40)} is VALID [2018-11-23 11:58:18,109 INFO L273 TraceCheckUtils]: 126: Hoare triple {59037#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59037#(<= main_~i~0 40)} is VALID [2018-11-23 11:58:18,109 INFO L273 TraceCheckUtils]: 127: Hoare triple {59037#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59037#(<= main_~i~0 40)} is VALID [2018-11-23 11:58:18,110 INFO L273 TraceCheckUtils]: 128: Hoare triple {59037#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {59038#(<= main_~i~0 41)} is VALID [2018-11-23 11:58:18,110 INFO L273 TraceCheckUtils]: 129: Hoare triple {59038#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59038#(<= main_~i~0 41)} is VALID [2018-11-23 11:58:18,111 INFO L273 TraceCheckUtils]: 130: Hoare triple {59038#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59038#(<= main_~i~0 41)} is VALID [2018-11-23 11:58:18,111 INFO L273 TraceCheckUtils]: 131: Hoare triple {59038#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {59039#(<= main_~i~0 42)} is VALID [2018-11-23 11:58:18,112 INFO L273 TraceCheckUtils]: 132: Hoare triple {59039#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59039#(<= main_~i~0 42)} is VALID [2018-11-23 11:58:18,112 INFO L273 TraceCheckUtils]: 133: Hoare triple {59039#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59039#(<= main_~i~0 42)} is VALID [2018-11-23 11:58:18,113 INFO L273 TraceCheckUtils]: 134: Hoare triple {59039#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {59040#(<= main_~i~0 43)} is VALID [2018-11-23 11:58:18,114 INFO L273 TraceCheckUtils]: 135: Hoare triple {59040#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59040#(<= main_~i~0 43)} is VALID [2018-11-23 11:58:18,114 INFO L273 TraceCheckUtils]: 136: Hoare triple {59040#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59040#(<= main_~i~0 43)} is VALID [2018-11-23 11:58:18,115 INFO L273 TraceCheckUtils]: 137: Hoare triple {59040#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {59041#(<= main_~i~0 44)} is VALID [2018-11-23 11:58:18,115 INFO L273 TraceCheckUtils]: 138: Hoare triple {59041#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59041#(<= main_~i~0 44)} is VALID [2018-11-23 11:58:18,116 INFO L273 TraceCheckUtils]: 139: Hoare triple {59041#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59041#(<= main_~i~0 44)} is VALID [2018-11-23 11:58:18,116 INFO L273 TraceCheckUtils]: 140: Hoare triple {59041#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {59042#(<= main_~i~0 45)} is VALID [2018-11-23 11:58:18,117 INFO L273 TraceCheckUtils]: 141: Hoare triple {59042#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59042#(<= main_~i~0 45)} is VALID [2018-11-23 11:58:18,117 INFO L273 TraceCheckUtils]: 142: Hoare triple {59042#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59042#(<= main_~i~0 45)} is VALID [2018-11-23 11:58:18,118 INFO L273 TraceCheckUtils]: 143: Hoare triple {59042#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {59043#(<= main_~i~0 46)} is VALID [2018-11-23 11:58:18,118 INFO L273 TraceCheckUtils]: 144: Hoare triple {59043#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59043#(<= main_~i~0 46)} is VALID [2018-11-23 11:58:18,119 INFO L273 TraceCheckUtils]: 145: Hoare triple {59043#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59043#(<= main_~i~0 46)} is VALID [2018-11-23 11:58:18,119 INFO L273 TraceCheckUtils]: 146: Hoare triple {59043#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {59044#(<= main_~i~0 47)} is VALID [2018-11-23 11:58:18,120 INFO L273 TraceCheckUtils]: 147: Hoare triple {59044#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59044#(<= main_~i~0 47)} is VALID [2018-11-23 11:58:18,120 INFO L273 TraceCheckUtils]: 148: Hoare triple {59044#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59044#(<= main_~i~0 47)} is VALID [2018-11-23 11:58:18,121 INFO L273 TraceCheckUtils]: 149: Hoare triple {59044#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {59045#(<= main_~i~0 48)} is VALID [2018-11-23 11:58:18,122 INFO L273 TraceCheckUtils]: 150: Hoare triple {59045#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59045#(<= main_~i~0 48)} is VALID [2018-11-23 11:58:18,122 INFO L273 TraceCheckUtils]: 151: Hoare triple {59045#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59045#(<= main_~i~0 48)} is VALID [2018-11-23 11:58:18,123 INFO L273 TraceCheckUtils]: 152: Hoare triple {59045#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {59046#(<= main_~i~0 49)} is VALID [2018-11-23 11:58:18,123 INFO L273 TraceCheckUtils]: 153: Hoare triple {59046#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59046#(<= main_~i~0 49)} is VALID [2018-11-23 11:58:18,124 INFO L273 TraceCheckUtils]: 154: Hoare triple {59046#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59046#(<= main_~i~0 49)} is VALID [2018-11-23 11:58:18,124 INFO L273 TraceCheckUtils]: 155: Hoare triple {59046#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {59047#(<= main_~i~0 50)} is VALID [2018-11-23 11:58:18,125 INFO L273 TraceCheckUtils]: 156: Hoare triple {59047#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59047#(<= main_~i~0 50)} is VALID [2018-11-23 11:58:18,125 INFO L273 TraceCheckUtils]: 157: Hoare triple {59047#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59047#(<= main_~i~0 50)} is VALID [2018-11-23 11:58:18,126 INFO L273 TraceCheckUtils]: 158: Hoare triple {59047#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {59048#(<= main_~i~0 51)} is VALID [2018-11-23 11:58:18,126 INFO L273 TraceCheckUtils]: 159: Hoare triple {59048#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59048#(<= main_~i~0 51)} is VALID [2018-11-23 11:58:18,127 INFO L273 TraceCheckUtils]: 160: Hoare triple {59048#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59048#(<= main_~i~0 51)} is VALID [2018-11-23 11:58:18,127 INFO L273 TraceCheckUtils]: 161: Hoare triple {59048#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {59049#(<= main_~i~0 52)} is VALID [2018-11-23 11:58:18,128 INFO L273 TraceCheckUtils]: 162: Hoare triple {59049#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59049#(<= main_~i~0 52)} is VALID [2018-11-23 11:58:18,128 INFO L273 TraceCheckUtils]: 163: Hoare triple {59049#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59049#(<= main_~i~0 52)} is VALID [2018-11-23 11:58:18,129 INFO L273 TraceCheckUtils]: 164: Hoare triple {59049#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {59050#(<= main_~i~0 53)} is VALID [2018-11-23 11:58:18,129 INFO L273 TraceCheckUtils]: 165: Hoare triple {59050#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59050#(<= main_~i~0 53)} is VALID [2018-11-23 11:58:18,130 INFO L273 TraceCheckUtils]: 166: Hoare triple {59050#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59050#(<= main_~i~0 53)} is VALID [2018-11-23 11:58:18,131 INFO L273 TraceCheckUtils]: 167: Hoare triple {59050#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {59051#(<= main_~i~0 54)} is VALID [2018-11-23 11:58:18,131 INFO L273 TraceCheckUtils]: 168: Hoare triple {59051#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59051#(<= main_~i~0 54)} is VALID [2018-11-23 11:58:18,132 INFO L273 TraceCheckUtils]: 169: Hoare triple {59051#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59051#(<= main_~i~0 54)} is VALID [2018-11-23 11:58:18,132 INFO L273 TraceCheckUtils]: 170: Hoare triple {59051#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {59052#(<= main_~i~0 55)} is VALID [2018-11-23 11:58:18,133 INFO L273 TraceCheckUtils]: 171: Hoare triple {59052#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59052#(<= main_~i~0 55)} is VALID [2018-11-23 11:58:18,133 INFO L273 TraceCheckUtils]: 172: Hoare triple {59052#(<= main_~i~0 55)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59052#(<= main_~i~0 55)} is VALID [2018-11-23 11:58:18,134 INFO L273 TraceCheckUtils]: 173: Hoare triple {59052#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {59053#(<= main_~i~0 56)} is VALID [2018-11-23 11:58:18,134 INFO L273 TraceCheckUtils]: 174: Hoare triple {59053#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59053#(<= main_~i~0 56)} is VALID [2018-11-23 11:58:18,135 INFO L273 TraceCheckUtils]: 175: Hoare triple {59053#(<= main_~i~0 56)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59053#(<= main_~i~0 56)} is VALID [2018-11-23 11:58:18,135 INFO L273 TraceCheckUtils]: 176: Hoare triple {59053#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {59054#(<= main_~i~0 57)} is VALID [2018-11-23 11:58:18,136 INFO L273 TraceCheckUtils]: 177: Hoare triple {59054#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59054#(<= main_~i~0 57)} is VALID [2018-11-23 11:58:18,136 INFO L273 TraceCheckUtils]: 178: Hoare triple {59054#(<= main_~i~0 57)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59054#(<= main_~i~0 57)} is VALID [2018-11-23 11:58:18,137 INFO L273 TraceCheckUtils]: 179: Hoare triple {59054#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {59055#(<= main_~i~0 58)} is VALID [2018-11-23 11:58:18,138 INFO L273 TraceCheckUtils]: 180: Hoare triple {59055#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59055#(<= main_~i~0 58)} is VALID [2018-11-23 11:58:18,138 INFO L273 TraceCheckUtils]: 181: Hoare triple {59055#(<= main_~i~0 58)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59055#(<= main_~i~0 58)} is VALID [2018-11-23 11:58:18,139 INFO L273 TraceCheckUtils]: 182: Hoare triple {59055#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {59056#(<= main_~i~0 59)} is VALID [2018-11-23 11:58:18,139 INFO L273 TraceCheckUtils]: 183: Hoare triple {59056#(<= main_~i~0 59)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59056#(<= main_~i~0 59)} is VALID [2018-11-23 11:58:18,140 INFO L273 TraceCheckUtils]: 184: Hoare triple {59056#(<= main_~i~0 59)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59056#(<= main_~i~0 59)} is VALID [2018-11-23 11:58:18,140 INFO L273 TraceCheckUtils]: 185: Hoare triple {59056#(<= main_~i~0 59)} ~i~0 := 1 + ~i~0; {59057#(<= main_~i~0 60)} is VALID [2018-11-23 11:58:18,141 INFO L273 TraceCheckUtils]: 186: Hoare triple {59057#(<= main_~i~0 60)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59057#(<= main_~i~0 60)} is VALID [2018-11-23 11:58:18,141 INFO L273 TraceCheckUtils]: 187: Hoare triple {59057#(<= main_~i~0 60)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59057#(<= main_~i~0 60)} is VALID [2018-11-23 11:58:18,142 INFO L273 TraceCheckUtils]: 188: Hoare triple {59057#(<= main_~i~0 60)} ~i~0 := 1 + ~i~0; {59058#(<= main_~i~0 61)} is VALID [2018-11-23 11:58:18,142 INFO L273 TraceCheckUtils]: 189: Hoare triple {59058#(<= main_~i~0 61)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59058#(<= main_~i~0 61)} is VALID [2018-11-23 11:58:18,143 INFO L273 TraceCheckUtils]: 190: Hoare triple {59058#(<= main_~i~0 61)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59058#(<= main_~i~0 61)} is VALID [2018-11-23 11:58:18,144 INFO L273 TraceCheckUtils]: 191: Hoare triple {59058#(<= main_~i~0 61)} ~i~0 := 1 + ~i~0; {59059#(<= main_~i~0 62)} is VALID [2018-11-23 11:58:18,144 INFO L273 TraceCheckUtils]: 192: Hoare triple {59059#(<= main_~i~0 62)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59059#(<= main_~i~0 62)} is VALID [2018-11-23 11:58:18,145 INFO L273 TraceCheckUtils]: 193: Hoare triple {59059#(<= main_~i~0 62)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59059#(<= main_~i~0 62)} is VALID [2018-11-23 11:58:18,145 INFO L273 TraceCheckUtils]: 194: Hoare triple {59059#(<= main_~i~0 62)} ~i~0 := 1 + ~i~0; {59060#(<= main_~i~0 63)} is VALID [2018-11-23 11:58:18,146 INFO L273 TraceCheckUtils]: 195: Hoare triple {59060#(<= main_~i~0 63)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59060#(<= main_~i~0 63)} is VALID [2018-11-23 11:58:18,146 INFO L273 TraceCheckUtils]: 196: Hoare triple {59060#(<= main_~i~0 63)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59060#(<= main_~i~0 63)} is VALID [2018-11-23 11:58:18,147 INFO L273 TraceCheckUtils]: 197: Hoare triple {59060#(<= main_~i~0 63)} ~i~0 := 1 + ~i~0; {59061#(<= main_~i~0 64)} is VALID [2018-11-23 11:58:18,148 INFO L273 TraceCheckUtils]: 198: Hoare triple {59061#(<= main_~i~0 64)} assume !(~i~0 < 100000); {58996#false} is VALID [2018-11-23 11:58:18,148 INFO L273 TraceCheckUtils]: 199: Hoare triple {58996#false} havoc ~x~0;~x~0 := 0; {58996#false} is VALID [2018-11-23 11:58:18,148 INFO L273 TraceCheckUtils]: 200: Hoare triple {58996#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {58996#false} is VALID [2018-11-23 11:58:18,148 INFO L256 TraceCheckUtils]: 201: Hoare triple {58996#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {58996#false} is VALID [2018-11-23 11:58:18,148 INFO L273 TraceCheckUtils]: 202: Hoare triple {58996#false} ~cond := #in~cond; {58996#false} is VALID [2018-11-23 11:58:18,149 INFO L273 TraceCheckUtils]: 203: Hoare triple {58996#false} assume 0 == ~cond; {58996#false} is VALID [2018-11-23 11:58:18,149 INFO L273 TraceCheckUtils]: 204: Hoare triple {58996#false} assume !false; {58996#false} is VALID [2018-11-23 11:58:18,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6112 backedges. 0 proven. 6112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:18,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:18,177 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:18,188 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:58:18,279 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:58:18,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:18,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:18,771 INFO L256 TraceCheckUtils]: 0: Hoare triple {58995#true} call ULTIMATE.init(); {58995#true} is VALID [2018-11-23 11:58:18,771 INFO L273 TraceCheckUtils]: 1: Hoare triple {58995#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {58995#true} is VALID [2018-11-23 11:58:18,771 INFO L273 TraceCheckUtils]: 2: Hoare triple {58995#true} assume true; {58995#true} is VALID [2018-11-23 11:58:18,771 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {58995#true} {58995#true} #55#return; {58995#true} is VALID [2018-11-23 11:58:18,771 INFO L256 TraceCheckUtils]: 4: Hoare triple {58995#true} call #t~ret4 := main(); {58995#true} is VALID [2018-11-23 11:58:18,772 INFO L273 TraceCheckUtils]: 5: Hoare triple {58995#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {59080#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:18,772 INFO L273 TraceCheckUtils]: 6: Hoare triple {59080#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59080#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:18,772 INFO L273 TraceCheckUtils]: 7: Hoare triple {59080#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59080#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:18,773 INFO L273 TraceCheckUtils]: 8: Hoare triple {59080#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {58998#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:18,773 INFO L273 TraceCheckUtils]: 9: Hoare triple {58998#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58998#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:18,773 INFO L273 TraceCheckUtils]: 10: Hoare triple {58998#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {58998#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:18,774 INFO L273 TraceCheckUtils]: 11: Hoare triple {58998#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {58999#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:18,774 INFO L273 TraceCheckUtils]: 12: Hoare triple {58999#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58999#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:18,774 INFO L273 TraceCheckUtils]: 13: Hoare triple {58999#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {58999#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:18,775 INFO L273 TraceCheckUtils]: 14: Hoare triple {58999#(<= main_~i~0 2)} ~i~0 := 1 + ~i~0; {59000#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:18,776 INFO L273 TraceCheckUtils]: 15: Hoare triple {59000#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59000#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:18,776 INFO L273 TraceCheckUtils]: 16: Hoare triple {59000#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59000#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:18,777 INFO L273 TraceCheckUtils]: 17: Hoare triple {59000#(<= main_~i~0 3)} ~i~0 := 1 + ~i~0; {59001#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:18,777 INFO L273 TraceCheckUtils]: 18: Hoare triple {59001#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59001#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:18,778 INFO L273 TraceCheckUtils]: 19: Hoare triple {59001#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59001#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:18,778 INFO L273 TraceCheckUtils]: 20: Hoare triple {59001#(<= main_~i~0 4)} ~i~0 := 1 + ~i~0; {59002#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:18,779 INFO L273 TraceCheckUtils]: 21: Hoare triple {59002#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59002#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:18,779 INFO L273 TraceCheckUtils]: 22: Hoare triple {59002#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59002#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:18,780 INFO L273 TraceCheckUtils]: 23: Hoare triple {59002#(<= main_~i~0 5)} ~i~0 := 1 + ~i~0; {59003#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:18,780 INFO L273 TraceCheckUtils]: 24: Hoare triple {59003#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59003#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:18,781 INFO L273 TraceCheckUtils]: 25: Hoare triple {59003#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59003#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:18,782 INFO L273 TraceCheckUtils]: 26: Hoare triple {59003#(<= main_~i~0 6)} ~i~0 := 1 + ~i~0; {59004#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:18,782 INFO L273 TraceCheckUtils]: 27: Hoare triple {59004#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59004#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:18,782 INFO L273 TraceCheckUtils]: 28: Hoare triple {59004#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59004#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:18,783 INFO L273 TraceCheckUtils]: 29: Hoare triple {59004#(<= main_~i~0 7)} ~i~0 := 1 + ~i~0; {59005#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:18,784 INFO L273 TraceCheckUtils]: 30: Hoare triple {59005#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59005#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:18,784 INFO L273 TraceCheckUtils]: 31: Hoare triple {59005#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59005#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:18,785 INFO L273 TraceCheckUtils]: 32: Hoare triple {59005#(<= main_~i~0 8)} ~i~0 := 1 + ~i~0; {59006#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:18,785 INFO L273 TraceCheckUtils]: 33: Hoare triple {59006#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59006#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:18,786 INFO L273 TraceCheckUtils]: 34: Hoare triple {59006#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59006#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:18,786 INFO L273 TraceCheckUtils]: 35: Hoare triple {59006#(<= main_~i~0 9)} ~i~0 := 1 + ~i~0; {59007#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:18,787 INFO L273 TraceCheckUtils]: 36: Hoare triple {59007#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59007#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:18,787 INFO L273 TraceCheckUtils]: 37: Hoare triple {59007#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59007#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:18,788 INFO L273 TraceCheckUtils]: 38: Hoare triple {59007#(<= main_~i~0 10)} ~i~0 := 1 + ~i~0; {59008#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:18,788 INFO L273 TraceCheckUtils]: 39: Hoare triple {59008#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59008#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:18,789 INFO L273 TraceCheckUtils]: 40: Hoare triple {59008#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59008#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:18,790 INFO L273 TraceCheckUtils]: 41: Hoare triple {59008#(<= main_~i~0 11)} ~i~0 := 1 + ~i~0; {59009#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:18,790 INFO L273 TraceCheckUtils]: 42: Hoare triple {59009#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59009#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:18,790 INFO L273 TraceCheckUtils]: 43: Hoare triple {59009#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59009#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:18,791 INFO L273 TraceCheckUtils]: 44: Hoare triple {59009#(<= main_~i~0 12)} ~i~0 := 1 + ~i~0; {59010#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:18,792 INFO L273 TraceCheckUtils]: 45: Hoare triple {59010#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59010#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:18,792 INFO L273 TraceCheckUtils]: 46: Hoare triple {59010#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59010#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:18,793 INFO L273 TraceCheckUtils]: 47: Hoare triple {59010#(<= main_~i~0 13)} ~i~0 := 1 + ~i~0; {59011#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:18,793 INFO L273 TraceCheckUtils]: 48: Hoare triple {59011#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59011#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:18,794 INFO L273 TraceCheckUtils]: 49: Hoare triple {59011#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59011#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:18,794 INFO L273 TraceCheckUtils]: 50: Hoare triple {59011#(<= main_~i~0 14)} ~i~0 := 1 + ~i~0; {59012#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:18,795 INFO L273 TraceCheckUtils]: 51: Hoare triple {59012#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59012#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:18,795 INFO L273 TraceCheckUtils]: 52: Hoare triple {59012#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59012#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:18,796 INFO L273 TraceCheckUtils]: 53: Hoare triple {59012#(<= main_~i~0 15)} ~i~0 := 1 + ~i~0; {59013#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:18,796 INFO L273 TraceCheckUtils]: 54: Hoare triple {59013#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59013#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:18,797 INFO L273 TraceCheckUtils]: 55: Hoare triple {59013#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59013#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:18,798 INFO L273 TraceCheckUtils]: 56: Hoare triple {59013#(<= main_~i~0 16)} ~i~0 := 1 + ~i~0; {59014#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:18,798 INFO L273 TraceCheckUtils]: 57: Hoare triple {59014#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59014#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:18,799 INFO L273 TraceCheckUtils]: 58: Hoare triple {59014#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59014#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:18,799 INFO L273 TraceCheckUtils]: 59: Hoare triple {59014#(<= main_~i~0 17)} ~i~0 := 1 + ~i~0; {59015#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:18,800 INFO L273 TraceCheckUtils]: 60: Hoare triple {59015#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59015#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:18,800 INFO L273 TraceCheckUtils]: 61: Hoare triple {59015#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59015#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:18,801 INFO L273 TraceCheckUtils]: 62: Hoare triple {59015#(<= main_~i~0 18)} ~i~0 := 1 + ~i~0; {59016#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:18,801 INFO L273 TraceCheckUtils]: 63: Hoare triple {59016#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59016#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:18,802 INFO L273 TraceCheckUtils]: 64: Hoare triple {59016#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59016#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:18,802 INFO L273 TraceCheckUtils]: 65: Hoare triple {59016#(<= main_~i~0 19)} ~i~0 := 1 + ~i~0; {59017#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:18,803 INFO L273 TraceCheckUtils]: 66: Hoare triple {59017#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59017#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:18,803 INFO L273 TraceCheckUtils]: 67: Hoare triple {59017#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59017#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:18,804 INFO L273 TraceCheckUtils]: 68: Hoare triple {59017#(<= main_~i~0 20)} ~i~0 := 1 + ~i~0; {59018#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:18,805 INFO L273 TraceCheckUtils]: 69: Hoare triple {59018#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59018#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:18,805 INFO L273 TraceCheckUtils]: 70: Hoare triple {59018#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59018#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:18,806 INFO L273 TraceCheckUtils]: 71: Hoare triple {59018#(<= main_~i~0 21)} ~i~0 := 1 + ~i~0; {59019#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:18,806 INFO L273 TraceCheckUtils]: 72: Hoare triple {59019#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59019#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:18,807 INFO L273 TraceCheckUtils]: 73: Hoare triple {59019#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59019#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:18,807 INFO L273 TraceCheckUtils]: 74: Hoare triple {59019#(<= main_~i~0 22)} ~i~0 := 1 + ~i~0; {59020#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:18,808 INFO L273 TraceCheckUtils]: 75: Hoare triple {59020#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59020#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:18,808 INFO L273 TraceCheckUtils]: 76: Hoare triple {59020#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59020#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:18,809 INFO L273 TraceCheckUtils]: 77: Hoare triple {59020#(<= main_~i~0 23)} ~i~0 := 1 + ~i~0; {59021#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:18,809 INFO L273 TraceCheckUtils]: 78: Hoare triple {59021#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59021#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:18,810 INFO L273 TraceCheckUtils]: 79: Hoare triple {59021#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59021#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:18,810 INFO L273 TraceCheckUtils]: 80: Hoare triple {59021#(<= main_~i~0 24)} ~i~0 := 1 + ~i~0; {59022#(<= main_~i~0 25)} is VALID [2018-11-23 11:58:18,811 INFO L273 TraceCheckUtils]: 81: Hoare triple {59022#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59022#(<= main_~i~0 25)} is VALID [2018-11-23 11:58:18,811 INFO L273 TraceCheckUtils]: 82: Hoare triple {59022#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59022#(<= main_~i~0 25)} is VALID [2018-11-23 11:58:18,812 INFO L273 TraceCheckUtils]: 83: Hoare triple {59022#(<= main_~i~0 25)} ~i~0 := 1 + ~i~0; {59023#(<= main_~i~0 26)} is VALID [2018-11-23 11:58:18,813 INFO L273 TraceCheckUtils]: 84: Hoare triple {59023#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59023#(<= main_~i~0 26)} is VALID [2018-11-23 11:58:18,813 INFO L273 TraceCheckUtils]: 85: Hoare triple {59023#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59023#(<= main_~i~0 26)} is VALID [2018-11-23 11:58:18,814 INFO L273 TraceCheckUtils]: 86: Hoare triple {59023#(<= main_~i~0 26)} ~i~0 := 1 + ~i~0; {59024#(<= main_~i~0 27)} is VALID [2018-11-23 11:58:18,814 INFO L273 TraceCheckUtils]: 87: Hoare triple {59024#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59024#(<= main_~i~0 27)} is VALID [2018-11-23 11:58:18,815 INFO L273 TraceCheckUtils]: 88: Hoare triple {59024#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59024#(<= main_~i~0 27)} is VALID [2018-11-23 11:58:18,815 INFO L273 TraceCheckUtils]: 89: Hoare triple {59024#(<= main_~i~0 27)} ~i~0 := 1 + ~i~0; {59025#(<= main_~i~0 28)} is VALID [2018-11-23 11:58:18,816 INFO L273 TraceCheckUtils]: 90: Hoare triple {59025#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59025#(<= main_~i~0 28)} is VALID [2018-11-23 11:58:18,816 INFO L273 TraceCheckUtils]: 91: Hoare triple {59025#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59025#(<= main_~i~0 28)} is VALID [2018-11-23 11:58:18,817 INFO L273 TraceCheckUtils]: 92: Hoare triple {59025#(<= main_~i~0 28)} ~i~0 := 1 + ~i~0; {59026#(<= main_~i~0 29)} is VALID [2018-11-23 11:58:18,817 INFO L273 TraceCheckUtils]: 93: Hoare triple {59026#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59026#(<= main_~i~0 29)} is VALID [2018-11-23 11:58:18,818 INFO L273 TraceCheckUtils]: 94: Hoare triple {59026#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59026#(<= main_~i~0 29)} is VALID [2018-11-23 11:58:18,819 INFO L273 TraceCheckUtils]: 95: Hoare triple {59026#(<= main_~i~0 29)} ~i~0 := 1 + ~i~0; {59027#(<= main_~i~0 30)} is VALID [2018-11-23 11:58:18,819 INFO L273 TraceCheckUtils]: 96: Hoare triple {59027#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59027#(<= main_~i~0 30)} is VALID [2018-11-23 11:58:18,820 INFO L273 TraceCheckUtils]: 97: Hoare triple {59027#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59027#(<= main_~i~0 30)} is VALID [2018-11-23 11:58:18,820 INFO L273 TraceCheckUtils]: 98: Hoare triple {59027#(<= main_~i~0 30)} ~i~0 := 1 + ~i~0; {59028#(<= main_~i~0 31)} is VALID [2018-11-23 11:58:18,821 INFO L273 TraceCheckUtils]: 99: Hoare triple {59028#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59028#(<= main_~i~0 31)} is VALID [2018-11-23 11:58:18,821 INFO L273 TraceCheckUtils]: 100: Hoare triple {59028#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59028#(<= main_~i~0 31)} is VALID [2018-11-23 11:58:18,822 INFO L273 TraceCheckUtils]: 101: Hoare triple {59028#(<= main_~i~0 31)} ~i~0 := 1 + ~i~0; {59029#(<= main_~i~0 32)} is VALID [2018-11-23 11:58:18,822 INFO L273 TraceCheckUtils]: 102: Hoare triple {59029#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59029#(<= main_~i~0 32)} is VALID [2018-11-23 11:58:18,823 INFO L273 TraceCheckUtils]: 103: Hoare triple {59029#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59029#(<= main_~i~0 32)} is VALID [2018-11-23 11:58:18,823 INFO L273 TraceCheckUtils]: 104: Hoare triple {59029#(<= main_~i~0 32)} ~i~0 := 1 + ~i~0; {59030#(<= main_~i~0 33)} is VALID [2018-11-23 11:58:18,824 INFO L273 TraceCheckUtils]: 105: Hoare triple {59030#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59030#(<= main_~i~0 33)} is VALID [2018-11-23 11:58:18,824 INFO L273 TraceCheckUtils]: 106: Hoare triple {59030#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59030#(<= main_~i~0 33)} is VALID [2018-11-23 11:58:18,825 INFO L273 TraceCheckUtils]: 107: Hoare triple {59030#(<= main_~i~0 33)} ~i~0 := 1 + ~i~0; {59031#(<= main_~i~0 34)} is VALID [2018-11-23 11:58:18,826 INFO L273 TraceCheckUtils]: 108: Hoare triple {59031#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59031#(<= main_~i~0 34)} is VALID [2018-11-23 11:58:18,826 INFO L273 TraceCheckUtils]: 109: Hoare triple {59031#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59031#(<= main_~i~0 34)} is VALID [2018-11-23 11:58:18,827 INFO L273 TraceCheckUtils]: 110: Hoare triple {59031#(<= main_~i~0 34)} ~i~0 := 1 + ~i~0; {59032#(<= main_~i~0 35)} is VALID [2018-11-23 11:58:18,827 INFO L273 TraceCheckUtils]: 111: Hoare triple {59032#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59032#(<= main_~i~0 35)} is VALID [2018-11-23 11:58:18,828 INFO L273 TraceCheckUtils]: 112: Hoare triple {59032#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59032#(<= main_~i~0 35)} is VALID [2018-11-23 11:58:18,828 INFO L273 TraceCheckUtils]: 113: Hoare triple {59032#(<= main_~i~0 35)} ~i~0 := 1 + ~i~0; {59033#(<= main_~i~0 36)} is VALID [2018-11-23 11:58:18,829 INFO L273 TraceCheckUtils]: 114: Hoare triple {59033#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59033#(<= main_~i~0 36)} is VALID [2018-11-23 11:58:18,829 INFO L273 TraceCheckUtils]: 115: Hoare triple {59033#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59033#(<= main_~i~0 36)} is VALID [2018-11-23 11:58:18,830 INFO L273 TraceCheckUtils]: 116: Hoare triple {59033#(<= main_~i~0 36)} ~i~0 := 1 + ~i~0; {59034#(<= main_~i~0 37)} is VALID [2018-11-23 11:58:18,830 INFO L273 TraceCheckUtils]: 117: Hoare triple {59034#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59034#(<= main_~i~0 37)} is VALID [2018-11-23 11:58:18,831 INFO L273 TraceCheckUtils]: 118: Hoare triple {59034#(<= main_~i~0 37)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59034#(<= main_~i~0 37)} is VALID [2018-11-23 11:58:18,831 INFO L273 TraceCheckUtils]: 119: Hoare triple {59034#(<= main_~i~0 37)} ~i~0 := 1 + ~i~0; {59035#(<= main_~i~0 38)} is VALID [2018-11-23 11:58:18,832 INFO L273 TraceCheckUtils]: 120: Hoare triple {59035#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59035#(<= main_~i~0 38)} is VALID [2018-11-23 11:58:18,832 INFO L273 TraceCheckUtils]: 121: Hoare triple {59035#(<= main_~i~0 38)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59035#(<= main_~i~0 38)} is VALID [2018-11-23 11:58:18,833 INFO L273 TraceCheckUtils]: 122: Hoare triple {59035#(<= main_~i~0 38)} ~i~0 := 1 + ~i~0; {59036#(<= main_~i~0 39)} is VALID [2018-11-23 11:58:18,833 INFO L273 TraceCheckUtils]: 123: Hoare triple {59036#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59036#(<= main_~i~0 39)} is VALID [2018-11-23 11:58:18,834 INFO L273 TraceCheckUtils]: 124: Hoare triple {59036#(<= main_~i~0 39)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59036#(<= main_~i~0 39)} is VALID [2018-11-23 11:58:18,835 INFO L273 TraceCheckUtils]: 125: Hoare triple {59036#(<= main_~i~0 39)} ~i~0 := 1 + ~i~0; {59037#(<= main_~i~0 40)} is VALID [2018-11-23 11:58:18,835 INFO L273 TraceCheckUtils]: 126: Hoare triple {59037#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59037#(<= main_~i~0 40)} is VALID [2018-11-23 11:58:18,836 INFO L273 TraceCheckUtils]: 127: Hoare triple {59037#(<= main_~i~0 40)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59037#(<= main_~i~0 40)} is VALID [2018-11-23 11:58:18,836 INFO L273 TraceCheckUtils]: 128: Hoare triple {59037#(<= main_~i~0 40)} ~i~0 := 1 + ~i~0; {59038#(<= main_~i~0 41)} is VALID [2018-11-23 11:58:18,837 INFO L273 TraceCheckUtils]: 129: Hoare triple {59038#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59038#(<= main_~i~0 41)} is VALID [2018-11-23 11:58:18,837 INFO L273 TraceCheckUtils]: 130: Hoare triple {59038#(<= main_~i~0 41)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59038#(<= main_~i~0 41)} is VALID [2018-11-23 11:58:18,838 INFO L273 TraceCheckUtils]: 131: Hoare triple {59038#(<= main_~i~0 41)} ~i~0 := 1 + ~i~0; {59039#(<= main_~i~0 42)} is VALID [2018-11-23 11:58:18,838 INFO L273 TraceCheckUtils]: 132: Hoare triple {59039#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59039#(<= main_~i~0 42)} is VALID [2018-11-23 11:58:18,839 INFO L273 TraceCheckUtils]: 133: Hoare triple {59039#(<= main_~i~0 42)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59039#(<= main_~i~0 42)} is VALID [2018-11-23 11:58:18,839 INFO L273 TraceCheckUtils]: 134: Hoare triple {59039#(<= main_~i~0 42)} ~i~0 := 1 + ~i~0; {59040#(<= main_~i~0 43)} is VALID [2018-11-23 11:58:18,840 INFO L273 TraceCheckUtils]: 135: Hoare triple {59040#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59040#(<= main_~i~0 43)} is VALID [2018-11-23 11:58:18,840 INFO L273 TraceCheckUtils]: 136: Hoare triple {59040#(<= main_~i~0 43)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59040#(<= main_~i~0 43)} is VALID [2018-11-23 11:58:18,841 INFO L273 TraceCheckUtils]: 137: Hoare triple {59040#(<= main_~i~0 43)} ~i~0 := 1 + ~i~0; {59041#(<= main_~i~0 44)} is VALID [2018-11-23 11:58:18,841 INFO L273 TraceCheckUtils]: 138: Hoare triple {59041#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59041#(<= main_~i~0 44)} is VALID [2018-11-23 11:58:18,842 INFO L273 TraceCheckUtils]: 139: Hoare triple {59041#(<= main_~i~0 44)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59041#(<= main_~i~0 44)} is VALID [2018-11-23 11:58:18,843 INFO L273 TraceCheckUtils]: 140: Hoare triple {59041#(<= main_~i~0 44)} ~i~0 := 1 + ~i~0; {59042#(<= main_~i~0 45)} is VALID [2018-11-23 11:58:18,843 INFO L273 TraceCheckUtils]: 141: Hoare triple {59042#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59042#(<= main_~i~0 45)} is VALID [2018-11-23 11:58:18,844 INFO L273 TraceCheckUtils]: 142: Hoare triple {59042#(<= main_~i~0 45)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59042#(<= main_~i~0 45)} is VALID [2018-11-23 11:58:18,844 INFO L273 TraceCheckUtils]: 143: Hoare triple {59042#(<= main_~i~0 45)} ~i~0 := 1 + ~i~0; {59043#(<= main_~i~0 46)} is VALID [2018-11-23 11:58:18,845 INFO L273 TraceCheckUtils]: 144: Hoare triple {59043#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59043#(<= main_~i~0 46)} is VALID [2018-11-23 11:58:18,845 INFO L273 TraceCheckUtils]: 145: Hoare triple {59043#(<= main_~i~0 46)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59043#(<= main_~i~0 46)} is VALID [2018-11-23 11:58:18,846 INFO L273 TraceCheckUtils]: 146: Hoare triple {59043#(<= main_~i~0 46)} ~i~0 := 1 + ~i~0; {59044#(<= main_~i~0 47)} is VALID [2018-11-23 11:58:18,846 INFO L273 TraceCheckUtils]: 147: Hoare triple {59044#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59044#(<= main_~i~0 47)} is VALID [2018-11-23 11:58:18,847 INFO L273 TraceCheckUtils]: 148: Hoare triple {59044#(<= main_~i~0 47)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59044#(<= main_~i~0 47)} is VALID [2018-11-23 11:58:18,848 INFO L273 TraceCheckUtils]: 149: Hoare triple {59044#(<= main_~i~0 47)} ~i~0 := 1 + ~i~0; {59045#(<= main_~i~0 48)} is VALID [2018-11-23 11:58:18,848 INFO L273 TraceCheckUtils]: 150: Hoare triple {59045#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59045#(<= main_~i~0 48)} is VALID [2018-11-23 11:58:18,849 INFO L273 TraceCheckUtils]: 151: Hoare triple {59045#(<= main_~i~0 48)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59045#(<= main_~i~0 48)} is VALID [2018-11-23 11:58:18,849 INFO L273 TraceCheckUtils]: 152: Hoare triple {59045#(<= main_~i~0 48)} ~i~0 := 1 + ~i~0; {59046#(<= main_~i~0 49)} is VALID [2018-11-23 11:58:18,850 INFO L273 TraceCheckUtils]: 153: Hoare triple {59046#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59046#(<= main_~i~0 49)} is VALID [2018-11-23 11:58:18,850 INFO L273 TraceCheckUtils]: 154: Hoare triple {59046#(<= main_~i~0 49)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59046#(<= main_~i~0 49)} is VALID [2018-11-23 11:58:18,851 INFO L273 TraceCheckUtils]: 155: Hoare triple {59046#(<= main_~i~0 49)} ~i~0 := 1 + ~i~0; {59047#(<= main_~i~0 50)} is VALID [2018-11-23 11:58:18,851 INFO L273 TraceCheckUtils]: 156: Hoare triple {59047#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59047#(<= main_~i~0 50)} is VALID [2018-11-23 11:58:18,852 INFO L273 TraceCheckUtils]: 157: Hoare triple {59047#(<= main_~i~0 50)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59047#(<= main_~i~0 50)} is VALID [2018-11-23 11:58:18,852 INFO L273 TraceCheckUtils]: 158: Hoare triple {59047#(<= main_~i~0 50)} ~i~0 := 1 + ~i~0; {59048#(<= main_~i~0 51)} is VALID [2018-11-23 11:58:18,853 INFO L273 TraceCheckUtils]: 159: Hoare triple {59048#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59048#(<= main_~i~0 51)} is VALID [2018-11-23 11:58:18,853 INFO L273 TraceCheckUtils]: 160: Hoare triple {59048#(<= main_~i~0 51)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59048#(<= main_~i~0 51)} is VALID [2018-11-23 11:58:18,854 INFO L273 TraceCheckUtils]: 161: Hoare triple {59048#(<= main_~i~0 51)} ~i~0 := 1 + ~i~0; {59049#(<= main_~i~0 52)} is VALID [2018-11-23 11:58:18,855 INFO L273 TraceCheckUtils]: 162: Hoare triple {59049#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59049#(<= main_~i~0 52)} is VALID [2018-11-23 11:58:18,855 INFO L273 TraceCheckUtils]: 163: Hoare triple {59049#(<= main_~i~0 52)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59049#(<= main_~i~0 52)} is VALID [2018-11-23 11:58:18,856 INFO L273 TraceCheckUtils]: 164: Hoare triple {59049#(<= main_~i~0 52)} ~i~0 := 1 + ~i~0; {59050#(<= main_~i~0 53)} is VALID [2018-11-23 11:58:18,856 INFO L273 TraceCheckUtils]: 165: Hoare triple {59050#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59050#(<= main_~i~0 53)} is VALID [2018-11-23 11:58:18,857 INFO L273 TraceCheckUtils]: 166: Hoare triple {59050#(<= main_~i~0 53)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59050#(<= main_~i~0 53)} is VALID [2018-11-23 11:58:18,857 INFO L273 TraceCheckUtils]: 167: Hoare triple {59050#(<= main_~i~0 53)} ~i~0 := 1 + ~i~0; {59051#(<= main_~i~0 54)} is VALID [2018-11-23 11:58:18,858 INFO L273 TraceCheckUtils]: 168: Hoare triple {59051#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59051#(<= main_~i~0 54)} is VALID [2018-11-23 11:58:18,858 INFO L273 TraceCheckUtils]: 169: Hoare triple {59051#(<= main_~i~0 54)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59051#(<= main_~i~0 54)} is VALID [2018-11-23 11:58:18,859 INFO L273 TraceCheckUtils]: 170: Hoare triple {59051#(<= main_~i~0 54)} ~i~0 := 1 + ~i~0; {59052#(<= main_~i~0 55)} is VALID [2018-11-23 11:58:18,859 INFO L273 TraceCheckUtils]: 171: Hoare triple {59052#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59052#(<= main_~i~0 55)} is VALID [2018-11-23 11:58:18,860 INFO L273 TraceCheckUtils]: 172: Hoare triple {59052#(<= main_~i~0 55)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59052#(<= main_~i~0 55)} is VALID [2018-11-23 11:58:18,861 INFO L273 TraceCheckUtils]: 173: Hoare triple {59052#(<= main_~i~0 55)} ~i~0 := 1 + ~i~0; {59053#(<= main_~i~0 56)} is VALID [2018-11-23 11:58:18,861 INFO L273 TraceCheckUtils]: 174: Hoare triple {59053#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59053#(<= main_~i~0 56)} is VALID [2018-11-23 11:58:18,861 INFO L273 TraceCheckUtils]: 175: Hoare triple {59053#(<= main_~i~0 56)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59053#(<= main_~i~0 56)} is VALID [2018-11-23 11:58:18,862 INFO L273 TraceCheckUtils]: 176: Hoare triple {59053#(<= main_~i~0 56)} ~i~0 := 1 + ~i~0; {59054#(<= main_~i~0 57)} is VALID [2018-11-23 11:58:18,863 INFO L273 TraceCheckUtils]: 177: Hoare triple {59054#(<= main_~i~0 57)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59054#(<= main_~i~0 57)} is VALID [2018-11-23 11:58:18,863 INFO L273 TraceCheckUtils]: 178: Hoare triple {59054#(<= main_~i~0 57)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59054#(<= main_~i~0 57)} is VALID [2018-11-23 11:58:18,864 INFO L273 TraceCheckUtils]: 179: Hoare triple {59054#(<= main_~i~0 57)} ~i~0 := 1 + ~i~0; {59055#(<= main_~i~0 58)} is VALID [2018-11-23 11:58:18,864 INFO L273 TraceCheckUtils]: 180: Hoare triple {59055#(<= main_~i~0 58)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59055#(<= main_~i~0 58)} is VALID [2018-11-23 11:58:18,865 INFO L273 TraceCheckUtils]: 181: Hoare triple {59055#(<= main_~i~0 58)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59055#(<= main_~i~0 58)} is VALID [2018-11-23 11:58:18,865 INFO L273 TraceCheckUtils]: 182: Hoare triple {59055#(<= main_~i~0 58)} ~i~0 := 1 + ~i~0; {59056#(<= main_~i~0 59)} is VALID [2018-11-23 11:58:18,866 INFO L273 TraceCheckUtils]: 183: Hoare triple {59056#(<= main_~i~0 59)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59056#(<= main_~i~0 59)} is VALID [2018-11-23 11:58:18,866 INFO L273 TraceCheckUtils]: 184: Hoare triple {59056#(<= main_~i~0 59)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59056#(<= main_~i~0 59)} is VALID [2018-11-23 11:58:18,867 INFO L273 TraceCheckUtils]: 185: Hoare triple {59056#(<= main_~i~0 59)} ~i~0 := 1 + ~i~0; {59057#(<= main_~i~0 60)} is VALID [2018-11-23 11:58:18,868 INFO L273 TraceCheckUtils]: 186: Hoare triple {59057#(<= main_~i~0 60)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59057#(<= main_~i~0 60)} is VALID [2018-11-23 11:58:18,868 INFO L273 TraceCheckUtils]: 187: Hoare triple {59057#(<= main_~i~0 60)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59057#(<= main_~i~0 60)} is VALID [2018-11-23 11:58:18,869 INFO L273 TraceCheckUtils]: 188: Hoare triple {59057#(<= main_~i~0 60)} ~i~0 := 1 + ~i~0; {59058#(<= main_~i~0 61)} is VALID [2018-11-23 11:58:18,869 INFO L273 TraceCheckUtils]: 189: Hoare triple {59058#(<= main_~i~0 61)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59058#(<= main_~i~0 61)} is VALID [2018-11-23 11:58:18,870 INFO L273 TraceCheckUtils]: 190: Hoare triple {59058#(<= main_~i~0 61)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59058#(<= main_~i~0 61)} is VALID [2018-11-23 11:58:18,870 INFO L273 TraceCheckUtils]: 191: Hoare triple {59058#(<= main_~i~0 61)} ~i~0 := 1 + ~i~0; {59059#(<= main_~i~0 62)} is VALID [2018-11-23 11:58:18,871 INFO L273 TraceCheckUtils]: 192: Hoare triple {59059#(<= main_~i~0 62)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59059#(<= main_~i~0 62)} is VALID [2018-11-23 11:58:18,871 INFO L273 TraceCheckUtils]: 193: Hoare triple {59059#(<= main_~i~0 62)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59059#(<= main_~i~0 62)} is VALID [2018-11-23 11:58:18,872 INFO L273 TraceCheckUtils]: 194: Hoare triple {59059#(<= main_~i~0 62)} ~i~0 := 1 + ~i~0; {59060#(<= main_~i~0 63)} is VALID [2018-11-23 11:58:18,872 INFO L273 TraceCheckUtils]: 195: Hoare triple {59060#(<= main_~i~0 63)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {59060#(<= main_~i~0 63)} is VALID [2018-11-23 11:58:18,873 INFO L273 TraceCheckUtils]: 196: Hoare triple {59060#(<= main_~i~0 63)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~min~0 := #t~mem1;havoc #t~mem1; {59060#(<= main_~i~0 63)} is VALID [2018-11-23 11:58:18,874 INFO L273 TraceCheckUtils]: 197: Hoare triple {59060#(<= main_~i~0 63)} ~i~0 := 1 + ~i~0; {59061#(<= main_~i~0 64)} is VALID [2018-11-23 11:58:18,874 INFO L273 TraceCheckUtils]: 198: Hoare triple {59061#(<= main_~i~0 64)} assume !(~i~0 < 100000); {58996#false} is VALID [2018-11-23 11:58:18,874 INFO L273 TraceCheckUtils]: 199: Hoare triple {58996#false} havoc ~x~0;~x~0 := 0; {58996#false} is VALID [2018-11-23 11:58:18,875 INFO L273 TraceCheckUtils]: 200: Hoare triple {58996#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {58996#false} is VALID [2018-11-23 11:58:18,875 INFO L256 TraceCheckUtils]: 201: Hoare triple {58996#false} call __VERIFIER_assert((if #t~mem3 > ~min~0 then 1 else 0)); {58996#false} is VALID [2018-11-23 11:58:18,875 INFO L273 TraceCheckUtils]: 202: Hoare triple {58996#false} ~cond := #in~cond; {58996#false} is VALID [2018-11-23 11:58:18,875 INFO L273 TraceCheckUtils]: 203: Hoare triple {58996#false} assume 0 == ~cond; {58996#false} is VALID [2018-11-23 11:58:18,875 INFO L273 TraceCheckUtils]: 204: Hoare triple {58996#false} assume !false; {58996#false} is VALID [2018-11-23 11:58:18,918 INFO L134 CoverageAnalysis]: Checked inductivity of 6112 backedges. 0 proven. 6112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:18,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:18,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 68 [2018-11-23 11:58:18,938 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 205 [2018-11-23 11:58:18,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:18,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 68 states. [2018-11-23 11:58:19,137 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 209 edges. 209 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:19,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-11-23 11:58:19,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-11-23 11:58:19,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-11-23 11:58:19,138 INFO L87 Difference]: Start difference. First operand 210 states and 275 transitions. Second operand 68 states. [2018-11-23 11:58:20,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:20,448 INFO L93 Difference]: Finished difference Result 226 states and 294 transitions. [2018-11-23 11:58:20,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-11-23 11:58:20,448 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 205 [2018-11-23 11:58:20,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:20,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 11:58:20,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 294 transitions. [2018-11-23 11:58:20,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 11:58:20,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 294 transitions. [2018-11-23 11:58:20,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 67 states and 294 transitions. [2018-11-23 11:58:20,716 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 294 edges. 294 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:20,720 INFO L225 Difference]: With dead ends: 226 [2018-11-23 11:58:20,720 INFO L226 Difference]: Without dead ends: 215 [2018-11-23 11:58:20,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-11-23 11:58:20,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-11-23 11:58:20,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-11-23 11:58:20,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:20,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 215 states. Second operand 213 states. [2018-11-23 11:58:20,809 INFO L74 IsIncluded]: Start isIncluded. First operand 215 states. Second operand 213 states. [2018-11-23 11:58:20,809 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 213 states. [2018-11-23 11:58:20,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:20,812 INFO L93 Difference]: Finished difference Result 215 states and 282 transitions. [2018-11-23 11:58:20,813 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 282 transitions. [2018-11-23 11:58:20,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:20,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:20,813 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand 215 states. [2018-11-23 11:58:20,813 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 215 states. [2018-11-23 11:58:20,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:20,816 INFO L93 Difference]: Finished difference Result 215 states and 282 transitions. [2018-11-23 11:58:20,816 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 282 transitions. [2018-11-23 11:58:20,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:20,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:20,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:20,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:20,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-11-23 11:58:20,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 279 transitions. [2018-11-23 11:58:20,820 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 279 transitions. Word has length 205 [2018-11-23 11:58:20,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:20,820 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 279 transitions. [2018-11-23 11:58:20,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-11-23 11:58:20,820 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 279 transitions. [2018-11-23 11:58:20,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-11-23 11:58:20,821 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:20,821 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:20,821 INFO L423 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:20,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:20,821 INFO L82 PathProgramCache]: Analyzing trace with hash 603702499, now seen corresponding path program 65 times [2018-11-23 11:58:20,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:20,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:20,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:20,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:20,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat